Testing Properties of Collections of Distributions. - Reut Levi; Dana Ron; Ronitt Rubinfeld (Electron. Colloquium Comput. Complex., 2010)

Approximating and Testing k-Histogram Distributions in Sub-linear time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (Electron. Colloquium Comput. Complex., 2011)

Approximating and testing k-histogram distributions in sub-linear time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (PODS, 2012)

Testing Similar Means. - Reut Levi; Dana Ron; Ronitt Rubinfeld (Electron. Colloquium Comput. Complex., 2012)

A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. - Akashnil Dutta; Reut Levi; Dana Ron; Ronitt Rubinfeld (DCC, 2013)

Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (PODS, 2015)

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. - Reut Levi; Ronitt Rubinfeld; Anak Yodpinyanee (SPAA, 2015)

Non-Local Probes Do Not Help with Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (CoRR, 2015)

Constructing Near Spanning Trees with Few Local Inspections. - Reut Levi; Guy Moshkovitz; Dana Ron; Ronitt Rubinfeld; Asaf Shapira (Electron. Colloquium Comput. Complex., 2015)

A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. - Reut Levi; Dana Ron (ACM Trans. Algorithms, 2015)

A Local Algorithm for Constructing Spanners in Minor-Free Graphs. - Reut Levi; Dana Ron; Ronitt Rubinfeld (APPROX-RANDOM, 2016)

Distance in the Forest Fire Model How far are you from Eve? - Varun Kanade; Reut Levi; Zvi Lotker; Frederik Mallmann-Trenn; Claire Mathieu (SODA, 2016)

Non-local Probes Do Not Help with Many Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (DISC, 2016)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (DISC, 2017)

Local Computation Algorithms for Graphs of Non-constant Degrees. - Reut Levi; Ronitt Rubinfeld; Anak Yodpinyanee (Algorithmica, 2017)

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. - Guy Even; Reut Levi; Moti Medina (CoRR, 2017)

On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. - Hendrik Fichtenberger; Reut Levi; Yadu Vasudev; Maximilian Wötzel (CoRR, 2017)

A Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (CoRR, 2017)

A (Centralized) Local Guide. - Reut Levi; Moti Medina (Bull. EATCS, 2017)

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. - Hendrik Fichtenberger; Reut Levi; Yadu Vasudev; Maximilian Wötzel (ICALP, 2018)

A Centralized Local Algorithm for the Sparse Spanning Graph Problem. - Christoph Lenzen 001; Reut Levi (ICALP, 2018)

Closure Operators and Spam Resistance for PageRank. - Lucas Farach-Colton; Martin Farach-Colton; Reut Levi; Moti Medina; Miguel A. Mosteiro (CoRR, 2018)

Distributed Testing of Graph Isomorphism in the CONGEST Model. - Reut Levi; Moti Medina (APPROX-RANDOM, 2020)

Local Algorithms for Sparse Spanning Graphs. - Reut Levi; Dana Ron; Ronitt Rubinfeld (Algorithmica, 2020)

Testing Bounded Arboricity. - Talya Eden; Reut Levi; Dana Ron (ACM Trans. Algorithms, 2020)

Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. - Reut Levi; Nadav Shoshan (APPROX-RANDOM, 2021)

Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). - Reut Levi (ICALP, 2021)

Improved LCAs for constructing spanners. - Rubi Arviv; Reut Levi (CoRR, 2021)

Property testing of planarity in the CONGEST model. - Reut Levi; Moti Medina; Dana Ron (Distributed Comput., 2021)

Autoencoder based local T cell repertoire density can be used to classify samples and T cell receptors. - Shirit Dvorkin; Reut Levi; Yoram Louzoun (PLoS Comput. Biol., 2021)

Sublinear Random Access Generators for Preferential Attachment Graphs. - Guy Even; Reut Levi; Moti Medina; Adi Rosén (ACM Trans. Algorithms, 2021)

Improved Local Computation Algorithms for Constructing Spanners. - Rubi Arviv; Lily Chung; Reut Levi; Edward Pyne (APPROX/RANDOM, 2023)

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. - Noy Biton; Reut Levi; Moti Medina (MFCS, 2023)

Graph Ranking and the Cost of Sybil Defense. - Gwendolyn Farach-Colton; Martin Farach-Colton; Leslie Ann Goldberg; Hanna Komlós; John Lapinskas; Reut Levi; Moti Medina; Miguel A. Mosteiro (EC, 2023)

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. - Reut Levi; Moti Medina; Omer Tubul (APPROX/RANDOM, 2024)

Testing C_k-Freeness in Bounded-Arboricity Graphs. - Talya Eden; Reut Levi; Dana Ron (ICALP, 2024)

Testing Ck-freeness in bounded-arboricity graphs. - Talya Eden; Reut Levi; Dana Ron (CoRR, 2024)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. - Talya Eden; Reut Levi; Dana Ron; Ronitt Rubinfeld (STOC, 2025)