Reut Levi

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 39

Top Topics

Subgraph Isomorphism

Top Venues

ACM Trans. Algorithms

Publications

Talya Eden, Reut Levi, Dana Ron
-freeness in bounded-arboricity graphs. CoRR (2024)
Talya Eden, Reut Levi, Dana Ron
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP (2024)
Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne
Improved Local Computation Algorithms for Constructing Spanners. APPROX/RANDOM (2023)
Noy Biton, Reut Levi, Moti Medina
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. CoRR (2023)
Noy Biton, Reut Levi, Moti Medina
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. MFCS (2023)
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro
Graph Ranking and the Cost of Sybil Defense. EC (2023)
Reut Levi, Nadav Shoshan
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. APPROX-RANDOM (2021)
Reut Levi, Moti Medina, Dana Ron
Property testing of planarity in the CONGEST model. Distributed Comput. 34 (1) (2021)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17 (4) (2021)
Rubi Arviv, Reut Levi
Improved LCAs for constructing spanners. CoRR (2021)
Reut Levi
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). ICALP (2021)
Shirit Dvorkin, Reut Levi, Yoram Louzoun
Autoencoder based local T cell repertoire density can be used to classify samples and T cell receptors. PLoS Comput. Biol. 17 (7) (2021)
Reut Levi, Nadav Shoshan
Testing Hamiltonicity (and other problems) in Minor-Free Graphs. CoRR (2021)
Reut Levi
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). CoRR (2021)
Reut Levi, Moti Medina
Distributed Testing of Graph Isomorphism in the CONGEST Model. APPROX-RANDOM (2020)
Reut Levi, Moti Medina
Distributed Testing of Graph Isomorphism in the CONGEST model. CoRR (2020)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82 (4) (2020)
Talya Eden, Reut Levi, Dana Ron
Testing Bounded Arboricity. ACM Trans. Algorithms 16 (2) (2020)
Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro
Closure Operators and Spam Resistance for PageRank. CoRR (2018)
Reut Levi, Moti Medina, Dana Ron
Property Testing of Planarity in the CONGEST model. CoRR (2018)
Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. ICALP (2018)
Christoph Lenzen, Reut Levi
A Centralized Local Algorithm for the Sparse Spanning Graph Problem. ICALP (2018)
Reut Levi, Moti Medina, Dana Ron
Property Testing of Planarity in the CONGEST model. PODC (2018)
Talya Eden, Reut Levi, Dana Ron
Testing bounded arboricity. SODA (2018)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50 (2) (2017)
Reut Levi, Moti Medina
A (Centralized) Local Guide. Bull. EATCS 122 (2017)
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
Three Notes on Distributed Property Testing. DISC (2017)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Local Computation Algorithms for Graphs of Non-constant Degrees. Algorithmica 77 (4) (2017)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP (2017)
Christoph Lenzen, Reut Levi
A Local Algorithm for the Sparse Spanning Graph Problem. CoRR (2017)
Talya Eden, Reut Levi, Dana Ron
Testing bounded arboricity. CoRR (2017)
Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel
On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. CoRR (2017)
Christoph Lenzen, Reut Levi
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. DISC (2017)
Guy Even, Reut Levi, Moti Medina
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. CoRR (2017)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR (2016)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR (2016)
Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu
Distance in the Forest Fire Model How far are you from Eve? SODA (2016)
Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela
Non-local Probes Do Not Help with Many Graph Problems. DISC (2016)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM (2016)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ACM Trans. Algorithms 11 (3) (2015)
Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela
Non-Local Probes Do Not Help with Graph Problems. CoRR (2015)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
-Histogram Distributions in Sub-linear Time. PODS (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. CoRR (2015)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. SPAA (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. 22 (2015)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Local Computation Algorithms for Graphs of Non-Constant Degrees. CoRR (2015)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. CoRR (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. SIAM J. Discret. Math. 28 (4) (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM (2014)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support CoRR (2013)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor CoRR (2013)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ICALP (1) (2013)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Properties of Collections of Distributions. Theory Comput. 9 (2013)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC (2013)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. ICALP (1) (2012)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. Electron. Colloquium Comput. Complex. 19 (2012)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
Approximating and testing k-histogram distributions in sub-linear time. PODS (2012)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
-Histogram Distributions in Sub-linear time. Electron. Colloquium Comput. Complex. 18 (2011)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Properties of Collections of Distributions. ICS (2011)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Properties of Collections of Distributions. Electron. Colloquium Comput. Complex. 17 (2010)