Reut Levi

According to our database, Reut Levi authored at least 35 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations.

Noy Biton, Reut Levi, Moti Medina

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Improved Local Computation Algorithms for Constructing Spanners.

Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne

Proceedings of the Approximation, 2023

2021

Sublinear Random Access Generators for Preferential Attachment Graphs.

Guy Even, Reut Levi, Moti Medina, Adi Rosén

ACM Trans. Algorithms, 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

Property testing of planarity in the CONGEST model.

Reut Levi, Moti Medina, Dana Ron

Distributed Comput., 2021

Improved LCAs for constructing spanners.

Rubi Arviv, Reut Levi

CoRR, 2021

Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n).

Reut Levi

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs.

Reut Levi, Nadav Shoshan

Proceedings of the Approximation, 2021

2020

Testing Bounded Arboricity.

Talya Eden, Reut Levi, Dana Ron

ACM Trans. Algorithms, 2020

Local Algorithms for Sparse Spanning Graphs.

Reut Levi, Dana Ron, Ronitt Rubinfeld

Algorithmica, 2020

Distributed Testing of Graph Isomorphism in the CONGEST Model.

Reut Levi, Moti Medina

Proceedings of the Approximation, 2020

2018

Closure Operators and Spam Resistance for PageRank.

Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro

CoRR, 2018

A Centralized Local Algorithm for the Sparse Spanning Graph Problem.

Christoph Lenzen, Reut Levi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error.

Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

A (Centralized) Local Guide.

Reut Levi, Moti Medina

Bull. EATCS, 2017

A Local Algorithm for the Sparse Spanning Graph Problem.

Christoph Lenzen, Reut Levi

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

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model.

Guy Even, Reut Levi, Moti Medina

CoRR, 2017

Local Computation Algorithms for Graphs of Non-constant Degrees.

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

Algorithmica, 2017

Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem.

Christoph Lenzen, Reut Levi

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Three Notes on Distributed Property Testing.

Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Non-local Probes Do Not Help with Many Graph Problems.

Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Distance in the Forest Fire Model How far are you from Eve?

Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Local Algorithm for Constructing Spanners in Minor-Free Graphs.

Reut Levi, Dana Ron, Ronitt Rubinfeld

Proceedings of the Approximation, 2016

2015

A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor.

Reut Levi, Dana Ron

ACM Trans. Algorithms, 2015

Constructing Near Spanning Trees with Few Local Inspections.

Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira

Electron. Colloquium Comput. Complex., 2015

Non-Local Probes Do Not Help with Graph Problems.

Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela

CoRR, 2015

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees.

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Erratum for: Approximating and Testing <i>k</i>-Histogram Distributions in Sub-linear Time.

Piotr Indyk, Reut Levi, Ronitt Rubinfeld

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

Testing Similar Means.

Reut Levi, Dana Ron, Ronitt Rubinfeld

SIAM J. Discret. Math., 2014

2013

Testing Properties of Collections of Distributions.

Reut Levi, Dana Ron, Ronitt Rubinfeld

Theory Comput., 2013

A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support.

Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld

Proceedings of the 2013 Data Compression Conference, 2013

2012

Approximating and testing k-histogram distributions in sub-linear time.

Piotr Indyk, Reut Levi, Ronitt Rubinfeld

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

2011

Approximating and Testing <i>k</i>-Histogram Distributions in Sub-linear time.

Piotr Indyk, Reut Levi, Ronitt Rubinfeld

Electron. Colloquium Comput. Complex., 2011