Reut Levi

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