Follow
Reut Levi
Title
Cited by
Cited by
Year
Testing properties of collections of distributions
R Levi, D Ron, R Rubinfeld
Theory of Computing 9 (1), 295-347, 2013
812013
Approximating and testing k-histogram distributions in sub-linear time
P Indyk, R Levi, R Rubinfeld
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles ofá…, 2012
702012
A quasi-polynomial time partition oracle for graphs with an excluded minor
R Levi, D Ron
ACM Transactions on Algorithms (TALG) 11 (3), 1-13, 2015
672015
Three notes on distributed property testing
G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ...
31st International Symposium on Distributed Computing (DISC 2017), 2017
472017
Local algorithms for sparse spanning graphs
R Levi, D Ron, R Rubinfeld
Algorithmica 82 (4), 747-786, 2020
452020
Local computation algorithms for graphs of non-constant degrees
R Levi, R Rubinfeld, A Yodpinyanee
Proceedings of the 27th ACM symposium on Parallelism in Algorithms andá…, 2015
412015
Testing bounded arboricity
T Eden, R Levi, D Ron
ACM Transactions on Algorithms (TALG) 16 (2), 1-22, 2020
232020
Non-local probes do not help with many graph problems
M G÷÷s, J Hirvonen, R Levi, M Medina, J Suomela
Distributed Computing: 30th International Symposium, DISC 2016, Parisá…, 2016
23*2016
A (centralized) local guide
R Levi, M Medina
Bulletin of EATCS 2 (122), 2017
192017
A centralized local algorithm for the sparse spanning graph problem
C Lenzen, R Levi
45th International Colloquium on Automata, Languages, and Programming (ICALPá…, 2018
17*2018
A simple online competitive adaptation of lempel-ziv compression with efficient random access support
A Dutta, R Levi, D Ron, R Rubinfeld
2013 Data Compression Conference, 113-122, 2013
172013
Constructing near spanning trees with few local inspections
R Levi, G Moshkovitz, D Ron, R Rubinfeld, A Shapira
Random Structures & Algorithms 50 (2), 183-200, 2017
162017
On testing minor-freeness in bounded degree graphs with one-sided error
H Fichtenberger, R Levi, Y Vasudev, M W÷tzel
Unpublished manuscript, 2017
132017
Property testing of planarity in the CONGEST model
R Levi, M Medina, D Ron
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computingá…, 2018
112018
Brief announcement: Local computation algorithms for graphs of non-constant degrees
R Levi, R Rubinfeld, A Yodpinyanee
27th ACM Symposium on Parallelism in Algorithms and Architectures, 59-61, 2015
112015
Testing similar means
R Levi, D Ron, R Rubinfeld
SIAM Journal on Discrete Mathematics 28 (4), 1699-1724, 2014
112014
Sublinear random access generators for preferential attachment graphs
G Even, R Levi, M Medina, A RosÚn
arXiv preprint arXiv:1602.06159, 2016
92016
A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error
H Fichtenberger, R Levi, Y Vasudev, M W÷tzel
arXiv preprint arXiv:1707.06126, 2017
82017
Faster and simpler distributed algorithms for testing and correcting graph properties in the congest-model
G Even, R Levi, M Medina
arXiv preprint arXiv:1705.04898, 2017
72017
Distance in the Forest Fire Model How far are you from Eve?
V Kanade, R Levi, Z Lotker, F Mallmann-Trenn, C Mathieu
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discreteá…, 2016
72016
The system can't perform the operation now. Try again later.
Articles 1–20