The Multicast Bandwidth Advantage in Serving a Web Site. - Yossi Azar; Meir Feder; Eyal Lubetzky; Doron Rajwan; Nadav Shulman (Networked Group Communication, 2001)

The Shannon capacity of a graph and the independence numbers of its powers. - Noga Alon; Eyal Lubetzky (IEEE Trans. Inf. Theory, 2006)

Non-Linear Index Coding Outperforming the Linear Optimum. - Eyal Lubetzky; Uri Stav (FOCS, 2007)

Codes And Xor Graph Products. - Noga Alon; Eyal Lubetzky (Comb., 2007)

Privileged users in zero-error transmission over a noisy channel. - Noga Alon; Eyal Lubetzky (Comb., 2007)

Independent sets in tensor graph powers. - Noga Alon; Eyal Lubetzky (J. Graph Theory, 2007)

Coarse to over-fine optical flow estimation. - Tomer Amiaz; Eyal Lubetzky; Nahum Kiryati (Pattern Recognit., 2007)

Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. - Noga Alon; Eyal Lubetzky (SIAM J. Discret. Math., 2007)

Broadcasting with Side Information. - Noga Alon; Eyal Lubetzky; Uri Stav; Amit Weinstein; Avinatan Hassidim (FOCS, 2008)

The isoperimetric constant of the random graph process. - Itai Benjamini; Simi Haber; Michael Krivelevich; Eyal Lubetzky (Random Struct. Algorithms, 2008)

Choice-Memory Tradeoff in Allocations. - Noga Alon; Eyal Lubetzky; Ori Gurel-Gurevich (FOCS, 2009)

Uniformly cross intersecting families. - Noga Alon; Eyal Lubetzky (Comb., 2009)

Nonlinear index coding outperforming the linear optimum. - Eyal Lubetzky; Uri Stav (IEEE Trans. Inf. Theory, 2009)

Index coding via linear programming - Anna Blasiak; Robert D. Kleinberg; Eyal Lubetzky (CoRR, 2010)

A note on the random greedy triangle-packing algorithm - Tom Bohman; Alan M. Frieze; Eyal Lubetzky (CoRR, 2010)

Optimal whitespace synchronization strategies - Yossi Azar; Ori Gurel-Gurevich; Eyal Lubetzky; Thomas Moscibroda (CoRR, 2010)

Diameters in Supercritical Random Graphs Via First Passage Percolation. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Comb. Probab. Comput., 2010)

Hamiltonicity thresholds in Achlioptas processes. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2010)

Optimal Discovery Strategies in White Space Networks. - Yossi Azar; Ori Gurel-Gurevich; Eyal Lubetzky; Thomas Moscibroda (ESA, 2011)

Lexicographic Products and the Power of Non-linear Network Coding. - Anna Blasiak; Robert Kleinberg; Eyal Lubetzky (FOCS, 2011)

Random greedy triangle-packing beyond the 7/4 barrier - Tom Bohman; Alan M. Frieze; Eyal Lubetzky (CoRR, 2011)

Anatomy of a young giant component in the random graph. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Random Struct. Algorithms, 2011)

Stochastic coalescence in logarithmic time. - Po-Shen Loh; Eyal Lubetzky (SODA, 2012)

Longest cycles in sparse random digraphs. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2013)

Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate. - Anna Blasiak; Robert Kleinberg; Eyal Lubetzky (IEEE Trans. Inf. Theory, 2013)

Anatomy of the giant component: The strictly supercritical regime. - Jian Ding; Eyal Lubetzky; Yuval Peres (Eur. J. Comb., 2014)

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. - Colin Cooper; Alan M. Frieze; Eyal Lubetzky (Random Struct. Algorithms, 2014)

On replica symmetry of large deviations in random graphs. - Eyal Lubetzky; Yufei Zhao (Random Struct. Algorithms, 2015)

The threshold for combs in random graphs. - Jeff Kahn 001; Eyal Lubetzky; Nicholas C. Wormald (Random Struct. Algorithms, 2016)

On the variational problem for upper tails in sparse random graphs. - Eyal Lubetzky; Yufei Zhao (Random Struct. Algorithms, 2017)

Comparing mixing times on sparse random graphs. - Anna Ben-Hamou; Eyal Lubetzky; Yuval Peres (SODA, 2018)

Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. - Reza Gheissari; Eyal Lubetzky; Yuval Peres (SODA, 2018)

Tractable near-optimal policies for crawling. - Yossi Azar; Eric Horvitz; Eyal Lubetzky; Yuval Peres; Dafna Shahaf (Proc. Natl. Acad. Sci. USA, 2018)

Optimal Freshness Crawl Under Politeness Constraints. - Andrey Kolobov; Yuval Peres; Eyal Lubetzky; Eric Horvitz (SIGIR, 2019)

Quasi-polynomial mixing of critical two-dimensional random cluster models. - Reza Gheissari; Eyal Lubetzky (Random Struct. Algorithms, 2020)

Asymptotics in percolation on high-girth expanders. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2020)

Cycle lengths in sparse random graphs. - Yahav Alon; Michael Krivelevich; Eyal Lubetzky (Random Struct. Algorithms, 2022)