Reut Levi

From MaRDI portal
Person:524358

Available identifiers

zbMath Open levi.reutMaRDI QIDQ524358

List of research outcomes





PublicationDate of PublicationType
Improved local computation algorithms for constructing spanners2025-01-14Paper
Distributed CONGEST algorithm for finding Hamiltonian paths in Dirac graphs and generalizations2024-12-03Paper
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs2023-11-20Paper
Distributed Testing of Graph Isomorphism in the CONGEST Model.2023-10-31Paper
Three notes on distributed property testing2023-02-03Paper
Sublinear Random Access Generators for Preferential Attachment Graphs2022-02-22Paper
https://portal.mardi4nfdi.de/entity/Q50027662021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027272021-07-28Paper
Testing Bounded Arboricity2021-05-03Paper
Property testing of planarity in the \textsf{CONGEST} model2021-03-12Paper
Sublinear Random Access Generators for Preferential Attachment Graphs.2020-05-27Paper
Local algorithms for sparse spanning graphs2020-02-28Paper
Property Testing of Planarity in the CONGEST model2019-09-19Paper
https://portal.mardi4nfdi.de/entity/Q49672332019-07-03Paper
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor2018-10-30Paper
Non-local probes do not help with many graph problems2018-08-16Paper
Distance in the Forest Fire Model How far are you from Eve?2018-07-16Paper
A Local Algorithm for Constructing Spanners in Minor-Free Graphs2018-04-19Paper
Testing Bounded Arboricity2018-03-15Paper
Local computation algorithms for graphs of non-constant degrees2017-05-02Paper
Constructing near spanning trees with few local inspections2017-04-18Paper
Local Algorithms for Sparse Spanning Graphs2017-03-22Paper
Testing Similar Means2015-04-17Paper
https://portal.mardi4nfdi.de/entity/Q31915762014-10-06Paper
Testing Similar Means2013-08-12Paper
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor2013-08-06Paper

Research outcomes over time

This page was built for person: Reut Levi