| Cycle lengths in sparse random graphs | 0 | 0.34 | 2022 |
| Quasi‐polynomial mixing of critical two‐dimensional random cluster models | 0 | 0.34 | 2020 |
| Optimal Freshness Crawl Under Politeness Constraints | 0 | 0.34 | 2019 |
| Tractable Near-Optimal Policies For Crawling | 1 | 0.35 | 2018 |
| On the variational problem for upper tails in sparse random graphs | 5 | 0.82 | 2017 |
| The threshold for combs in random graphs. | 0 | 0.34 | 2016 |
| On replica symmetry of large deviations in random graphs | 5 | 0.65 | 2015 |
| Anatomy of the giant component: The strictly supercritical regime | 5 | 0.54 | 2014 |
| Cover time of a random graph with a degree sequence II: Allowing vertices of degree two | 0 | 0.34 | 2014 |
| Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate | 32 | 1.19 | 2013 |
| Longest cycles in sparse random digraphs. | 3 | 0.54 | 2013 |
| Stochastic coalescence in logarithmic time | 0 | 0.34 | 2012 |
| Optimal discovery strategies in white space networks | 4 | 0.42 | 2011 |
| Anatomy of a young giant component in the random graph | 15 | 0.93 | 2011 |
| Lexicographic Products and the Power of Non-linear Network Coding | 33 | 1.85 | 2011 |
| Random greedy triangle-packing beyond the 7/4 barrier | 2 | 0.40 | 2011 |
| Diameters in supercritical random graphs via first passage percolation | 9 | 1.00 | 2010 |
| Index coding via linear programming | 44 | 2.71 | 2010 |
| Optimal whitespace synchronization strategies | 0 | 0.34 | 2010 |
| Hamiltonicity thresholds in Achlioptas processes | 7 | 0.53 | 2010 |
| Uniformly cross intersecting families | 1 | 0.35 | 2009 |
| Choice-Memory Tradeoff in Allocations | 1 | 0.39 | 2009 |
| Nonlinear index coding outperforming the linear optimum | 59 | 3.21 | 2009 |
| The isoperimetric constant of the random graph process | 2 | 0.53 | 2008 |
| Broadcasting with Side Information | 19 | 1.84 | 2008 |
| Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon | 4 | 0.55 | 2007 |
| Privileged users in zero-error transmission over a noisy channel | 3 | 0.43 | 2007 |
| Coarse to over-fine optical flow estimation | 23 | 1.07 | 2007 |
| Independent sets in tensor graph powers | 20 | 1.39 | 2007 |
| Codes And Xor Graph Products | 1 | 0.38 | 2007 |
| Non-Linear Index Coding Outperforming the Linear Optimum | 42 | 3.30 | 2007 |
| The Shannon capacity of a graph and the independence numbers of its powers | 10 | 0.70 | 2006 |
| The Multicast Bandwidth Advantage in Serving a Web Site | 5 | 0.44 | 2001 |
