research
∙
05/02/2023
Sample-based distance-approximation for subsequence-freeness
In this work, we study the problem of approximating the distance to subs...
share
research
∙
12/24/2022
Testing Distributions of Huge Objects
We initiate a study of a new model of property testing that is a hybrid ...
research
∙
05/18/2022
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
We study the dynamics of (synchronous) one-dimensional cellular automata...
research
∙
10/28/2021
Approximating the Arboricity in Sublinear Time
We consider the problem of approximating the arboricity of a graph G= (V...
research
∙
05/03/2021
Testing Dynamic Environments: Back to Basics
We continue the line of work initiated by Goldreich and Ron (Journal of ...
research
∙
12/07/2020
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting
In this work, we consider the problem of sampling a k-clique in a graph ...
research
∙
01/06/2020
On Efficient Distance Approximation for Graph Properties
A distance-approximation algorithm for a graph property P in the adjacen...
research
∙
08/30/2019
Property testing of the Boolean and binary rank
We present algorithms for testing if a (0,1)-matrix M has Boolean/binary...
research
∙
02/21/2019
The Arboricity Captures the Complexity of Sampling Edges
In this paper, we revisit the problem of sampling edges in an unknown gr...
research
∙
11/11/2018
Faster sublinear approximations of k-cliques for low arboricity graphs
Given query access to an undirected graph G, we consider the problem of ...
research
∙
05/27/2018
Property Testing of Planarity in the CONGEST model
We give a distributed algorithm in the CONGEST model for property testi...
research
∙
10/24/2017
