Risultati della ricerca - Ron, Dana

On Efficient Distance Approximation for Graph Properties di Fiat, Nimrod, Ron, Dana

Testo
Testo

Testing Dynamic Environments: Back to Basics di Nakar, Yonatan, Ron, Dana

Testo
Testo

The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity di Nakar, Yonatan, Ron, Dana

Testo
Testo

Testing Distributions of Huge Objects di Goldreich, Oded, Ron, Dana

Testo
Testo

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata di Nakar, Yonatan, Ron, Dana

Testo
Testo

Almost Optimal Bounds for Sublinear-Time Sampling of $k$-Cliques: Sampling Cliques is Harder Than Counting di Eden, Talya, Ron, Dana, Rosenbaum, Will

Testo
Testo

Sample-based distance-approximation for subsequence-freeness di Sidon, Omer Cohen, Ron, Dana

Testo
Testo

Local Algorithms for Sparse Spanning Graphs di Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Testo
Testo

A Local Algorithm for Constructing Spanners in Minor-Free Graphs di Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Testo
Testo

Testing bounded arboricity di Eden, Talya, Levi, Reut, Ron, Dana

Testo
Testo

Approximating the Arboricity in Sublinear Time di Eden, Talya, Mossel, Saleet, Ron, Dana

Testo
Testo

Testing $C_k$-freeness in bounded-arboricity graphs di Eden, Talya, Levi, Reut, Ron, Dana

Testo
Testo

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time di Eden, Talya, Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Testo
Testo