Eyal Lubetzky

Publication Activity (10 Years)

Years Active: 2001-2022
Publications (10 Years): 9

Top Topics

Top Venues

Random Struct. Algorithms

IEEE Trans. Inf. Theory

Publications

Yahav Alon, Michael Krivelevich, Eyal Lubetzky
Cycle lengths in sparse random graphs. Random Struct. Algorithms 61 (3) (2022)
Reza Gheissari, Eyal Lubetzky
Quasi-polynomial mixing of critical two-dimensional random cluster models. Random Struct. Algorithms 56 (2) (2020)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56 (4) (2020)
Andrey Kolobov, Yuval Peres, Eyal Lubetzky, Eric Horvitz
Optimal Freshness Crawl Under Politeness Constraints. SIGIR (2019)
Reza Gheissari, Eyal Lubetzky, Yuval Peres
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. SODA (2018)
Yossi Azar, Eric Horvitz, Eyal Lubetzky, Yuval Peres, Dafna Shahaf
Tractable near-optimal policies for crawling. Proc. Natl. Acad. Sci. USA 115 (32) (2018)
Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres
Comparing mixing times on sparse random graphs. SODA (2018)
Eyal Lubetzky, Yufei Zhao
On the variational problem for upper tails in sparse random graphs. Random Struct. Algorithms 50 (3) (2017)
Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald
The threshold for combs in random graphs. Random Struct. Algorithms 48 (4) (2016)
Eyal Lubetzky, Yufei Zhao
On replica symmetry of large deviations in random graphs. Random Struct. Algorithms 47 (1) (2015)
Jian Ding, Eyal Lubetzky, Yuval Peres
Anatomy of the giant component: The strictly supercritical regime. Eur. J. Comb. 35 (2014)
Colin Cooper, Alan M. Frieze, Eyal Lubetzky
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45 (4) (2014)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43 (1) (2013)
Anna Blasiak, Robert Kleinberg, Eyal Lubetzky
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate. IEEE Trans. Inf. Theory 59 (9) (2013)
Po-Shen Loh, Eyal Lubetzky
Stochastic coalescence in logarithmic time. SODA (2012)
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres
Anatomy of a young giant component in the random graph. Random Struct. Algorithms 39 (2) (2011)
Anna Blasiak, Robert Kleinberg, Eyal Lubetzky
Lexicographic Products and the Power of Non-linear Network Coding. FOCS (2011)
Anna Blasiak, Robert Kleinberg, Eyal Lubetzky
Lexicographic products and the power of non-linear network coding CoRR (2011)
Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda
Optimal Discovery Strategies in White Space Networks. ESA (2011)
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
Random greedy triangle-packing beyond the 7/4 barrier CoRR (2011)
Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda
Optimal whitespace synchronization strategies CoRR (2010)
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19 (5-6) (2010)
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
A note on the random greedy triangle-packing algorithm CoRR (2010)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37 (1) (2010)
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
Index coding via linear programming CoRR (2010)
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
Choice-Memory Tradeoff in Allocations. FOCS (2009)
Eyal Lubetzky, Uri Stav
Nonlinear index coding outperforming the linear optimum. IEEE Trans. Inf. Theory 55 (8) (2009)
Noga Alon, Eyal Lubetzky
Uniformly cross intersecting families. Comb. 29 (4) (2009)
Eyal Lubetzky, Uri Stav
Non-linear index coding outperforming the linear optimum CoRR (2008)
Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32 (1) (2008)
Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim
Broadcasting with Side Information. FOCS (2008)
Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein
Broadcasting with side information CoRR (2008)
Noga Alon, Eyal Lubetzky
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. SIAM J. Discret. Math. 21 (2) (2007)
Noga Alon, Eyal Lubetzky
Independent sets in tensor graph powers. J. Graph Theory 54 (1) (2007)
Eyal Lubetzky, Uri Stav
Non-Linear Index Coding Outperforming the Linear Optimum. FOCS (2007)
Tomer Amiaz, Eyal Lubetzky, Nahum Kiryati
Coarse to over-fine optical flow estimation. Pattern Recognit. 40 (9) (2007)
Noga Alon, Eyal Lubetzky
Codes And Xor Graph Products. Comb. 27 (1) (2007)
Noga Alon, Eyal Lubetzky
Privileged users in zero-error transmission over a noisy channel. Comb. 27 (6) (2007)
Noga Alon, Eyal Lubetzky
The Shannon capacity of a graph and the independence numbers of its powers CoRR (2006)
Noga Alon, Eyal Lubetzky
The Shannon capacity of a graph and the independence numbers of its powers. IEEE Trans. Inf. Theory 52 (5) (2006)
Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman
The Multicast Bandwidth Advantage in Serving a Web Site. Networked Group Communication (2001)