Eyal Lubetzky

According to our database1, Eyal Lubetzky authored at least 29 papers between 2001 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Tractable near-optimal policies for crawling.
Proc. Natl. Acad. Sci. U.S.A., 2018

Exponentially slow mixing in the mean-field Swendsen-Wang dynamics.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Comparing mixing times on sparse random graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
On the variational problem for upper tails in sparse random graphs.
Random Struct. Algorithms, 2017

2016
The threshold for combs in random graphs.
Random Struct. Algorithms, 2016

2015
On replica symmetry of large deviations in random graphs.
Random Struct. Algorithms, 2015

2014
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two.
Random Struct. Algorithms, 2014

Anatomy of the giant component: The strictly supercritical regime.
Eur. J. Comb., 2014

2013
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate.
IEEE Trans. Information Theory, 2013

Longest cycles in sparse random digraphs.
Random Struct. Algorithms, 2013

2012
Stochastic coalescence in logarithmic time.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Anatomy of a young giant component in the random graph.
Random Struct. Algorithms, 2011

Lexicographic Products and the Power of Non-linear Network Coding.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Optimal Discovery Strategies in White Space Networks.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Hamiltonicity thresholds in Achlioptas processes.
Random Struct. Algorithms, 2010

Diameters in Supercritical Random Graphs Via First Passage Percolation.
Combinatorics, Probability & Computing, 2010

2009
Nonlinear index coding outperforming the linear optimum.
IEEE Trans. Information Theory, 2009

Uniformly cross intersecting families.
Combinatorica, 2009

Choice-Memory Tradeoff in Allocations.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
The isoperimetric constant of the random graph process.
Random Struct. Algorithms, 2008

Broadcasting with Side Information.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon.
SIAM J. Discrete Math., 2007

Coarse to over-fine optical flow estimation.
Pattern Recognition, 2007

Independent sets in tensor graph powers.
Journal of Graph Theory, 2007

Privileged users in zero-error transmission over a noisy channel.
Combinatorica, 2007

Codes And Xor Graph Products.
Combinatorica, 2007

Non-Linear Index Coding Outperforming the Linear Optimum.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
The Shannon capacity of a graph and the independence numbers of its powers.
IEEE Trans. Information Theory, 2006

2001
The Multicast Bandwidth Advantage in Serving a Web Site.
Proceedings of the Networked Group Communication, 2001


  Loading...