Eyal Lubetzky - RankMe

41 papers A* 8A 1Journal 31Unranked 1

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