default search action
Reut Levi
Person information
- affiliation: Max-Planck-Institut für Informatik, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Reut Levi, Moti Medina, Omer Tubul:
Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. APPROX/RANDOM 2024: 60:1-60:21 - [c25]Talya Eden, Reut Levi, Dana Ron:
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP 2024: 60:1-60:20 - [i24]Talya Eden, Reut Levi, Dana Ron:
Testing Ck-freeness in bounded-arboricity graphs. CoRR abs/2404.18126 (2024) - 2023
- [c24]Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne:
Improved Local Computation Algorithms for Constructing Spanners. APPROX/RANDOM 2023: 42:1-42:23 - [c23]Noy Biton, Reut Levi, Moti Medina:
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. MFCS 2023: 19:1-19:14 - [c22]Gwendolyn Farach-Colton
, Martin Farach-Colton
Graph Ranking and the Cost of Sybil Defense. EC 2023: 586-625 - [i23]Noy Biton, Reut Levi, Moti Medina:
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. CoRR abs/2302.00742 (2023) - 2021
- [j11]Reut Levi
Property testing of planarity in the CONGEST model. Distributed Comput. 34(1): 15-32 (2021) - [j10]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) - [j9]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17(4): 28:1-28:26 (2021) - [c21]Reut Levi, Nadav Shoshan:
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. APPROX-RANDOM 2021: 61:1-61:23 - [c20]Reut Levi:
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). ICALP 2021: 93:1-93:13 - [i22]Reut Levi, Nadav Shoshan:
Testing Hamiltonicity (and other problems) in Minor-Free Graphs. CoRR abs/2102.11728 (2021) - [i21]Reut Levi:
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). CoRR abs/2105.04809 (2021) - [i20]Rubi Arviv, Reut Levi:
Improved LCAs for constructing spanners. CoRR abs/2105.04847 (2021) - 2020
- [j8]Reut Levi
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82(4): 747-786 (2020) - [j7]Talya Eden
Testing Bounded Arboricity. ACM Trans. Algorithms 16(2): 18:1-18:22 (2020) - [c19]Reut Levi
Distributed Testing of Graph Isomorphism in the CONGEST Model. APPROX-RANDOM 2020: 19:1-19:24 - [i19]Reut Levi, Moti Medina:
Distributed Testing of Graph Isomorphism in the CONGEST model. CoRR abs/2003.00468 (2020)
2010 – 2019
- 2018
- [c18]Hendrik Fichtenberger
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. ICALP 2018: 52:1-52:14 - [c17]Christoph Lenzen, Reut Levi:
A Centralized Local Algorithm for the Sparse Spanning Graph Problem. ICALP 2018: 87:1-87:14 - [c16]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. PODC 2018: 347-356 - [c15]Talya Eden, Reut Levi, Dana Ron
Testing bounded arboricity. SODA 2018: 2081-2092 - [i18]Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Closure Operators and Spam Resistance for PageRank. CoRR abs/1803.05001 (2018) - [i17]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. CoRR abs/1805.10657 (2018) - 2017
- [j6]Reut Levi
Local Computation Algorithms for Graphs of Non-constant Degrees. Algorithmica 77(4): 971-994 (2017) - [j5]Reut Levi, Moti Medina:
A (Centralized) Local Guide. Bull. EATCS 122 (2017) - [j4]Reut Levi, Guy Moshkovitz, Dana Ron
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - [c14]Guy Even, Reut Levi, Moti Medina
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP 2017: 6:1-6:15 - [c13]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [c12]Christoph Lenzen, Reut Levi:
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. DISC 2017: 57:1-57:3 - [i16]Christoph Lenzen, Reut Levi:
A Local Algorithm for the Sparse Spanning Graph Problem. CoRR abs/1703.05418 (2017) - [i15]Guy Even, Reut Levi, Moti Medina:
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. CoRR abs/1705.04898 (2017) - [i14]Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. CoRR abs/1707.04864 (2017) - [i13]Hendrik Fichtenberger
On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. CoRR abs/1707.06126 (2017) - 2016
- [c11]Reut Levi, Dana Ron
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM 2016: 38:1-38:15 - [c10]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: 1602-1620 - [c9]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina
Non-local Probes Do Not Help with Many Graph Problems. DISC 2016: 201-214 - [i12]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR abs/1602.06159 (2016) - [i11]Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR abs/1604.07038 (2016) - 2015
- [j3]Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ACM Trans. Algorithms 11(3): 24:1-24:13 (2015) - [c8]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. PODS 2015: 343 - [c7]Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. SPAA 2015: 59-61 - [i10]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. CoRR abs/1502.00413 (2015) - [i9]Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Computation Algorithms for Graphs of Non-Constant Degrees. CoRR abs/1502.04022 (2015) - [i8]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-Local Probes Do Not Help with Graph Problems. CoRR abs/1512.05411 (2015) - [i7]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Reut Levi, Dana Ron
Testing Similar Means. SIAM J. Discret. Math. 28(4): 1699-1724 (2014) - [c6]Reut Levi, Dana Ron
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM 2014: 826-842 - [i6]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. CoRR abs/1402.3609 (2014) - 2013
- [j1]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. Theory Comput. 9: 295-347 (2013) - [c5]Akashnil Dutta, Reut Levi, Dana Ron
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC 2013: 113-122 - [c4]Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ICALP (1) 2013: 709-720 - [i5]Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld:
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support. CoRR abs/1301.2495 (2013) - [i4]Reut Levi, Dana Ron:
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. CoRR abs/1302.3417 (2013) - 2012
- [c3]Reut Levi, Dana Ron
Testing Similar Means. ICALP (1) 2012: 629-640 - [c2]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and testing k-histogram distributions in sub-linear time. PODS 2012: 15-22 - [i3]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c1]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. ICS 2011: 179-194 - [i2]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and Testing k-Histogram Distributions in Sub-linear time. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i1]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: