| Suffocating Fire Sales | 0 | 0.34 | 2022 |
| Inference And Mutual Information On Random Factor Graphs | 0 | 0.34 | 2021 |
| Asymptotics for Push on the Complete Graph | 0 | 0.34 | 2020 |
| Bootstrap percolation with inhibition | 0 | 0.34 | 2019 |
| Satisfiability Thresholds for Regular Occupation Problems. | 0 | 0.34 | 2019 |
| Robustness of Randomized Rumour Spreading. | 0 | 0.34 | 2019 |
| Bootstrap Percolation in Directed Inhomogeneous Random Graphs. | 0 | 0.34 | 2019 |
| Asymptotically Optimal Amplifiers for the Moran Process. | 0 | 0.34 | 2019 |
| Load Thresholds for Cuckoo Hashing with Double Hashing. | 0 | 0.34 | 2018 |
| Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. | 0 | 0.34 | 2018 |
| Asymptotic Enumeration of Graph Classes with Many Components. | 0 | 0.34 | 2018 |
| Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes. | 0 | 0.34 | 2017 |
| Optimal strategies for weighted ray search. | 0 | 0.34 | 2017 |
| Asynchronous Rumor Spreading on Random Graphs. | 4 | 0.40 | 2016 |
| Maximizing the Minimum Load for Random Processing Times | 0 | 0.34 | 2015 |
| Randomized Rumour Spreading: The Effect of the Network Topology. | 1 | 0.37 | 2015 |
| Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). | 0 | 0.34 | 2014 |
| Coloring d-Embeddable k-Uniform Hypergraphs. | 1 | 0.36 | 2014 |
| On the connectivity of random graphs from addable classes | 7 | 0.68 | 2013 |
| The multiple-orientability thresholds for random hypergraphs | 9 | 0.68 | 2013 |
| Going after the k-SAT threshold | 12 | 0.62 | 2013 |
| On the Insertion Time of Cuckoo Hashing | 11 | 0.83 | 2013 |
| Faster Rumor Spreading With Multiple Calls. | 1 | 0.35 | 2013 |
| A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. | 1 | 0.38 | 2012 |
| Ultra-fast rumor spreading in social networks | 28 | 0.91 | 2012 |
| Vertices of Degree k in Random Unlabeled Trees | 0 | 0.34 | 2012 |
| Random hyperbolic graphs: degree sequence and clustering | 18 | 1.07 | 2012 |
| The maximum degree of random planar graphs | 3 | 0.40 | 2012 |
| Catching the k-NAESAT threshold | 10 | 0.55 | 2012 |
| Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract). | 4 | 0.48 | 2012 |
| Extremal subgraphs of random graphs | 1 | 0.42 | 2012 |
| Efficient sampling methods for discrete distributions | 2 | 0.38 | 2012 |
| Multi-target ray searching problems. | 0 | 0.34 | 2011 |
| On the degree distribution of random planar graphs | 3 | 0.41 | 2011 |
| Explosive percolation in Erdős-Rényi-like random graph processes | 1 | 0.39 | 2011 |
| Approximate counting of cycles in streams | 20 | 0.76 | 2011 |
| 3-connected cores in random planar graphs | 3 | 0.50 | 2011 |
| Rumor spreading on random regular graphs and expanders | 23 | 1.09 | 2010 |
| Maximal biconnected subgraphs of random planar graphs | 6 | 0.58 | 2010 |
| Orientability of random hypergraphs and the power of multiple choices | 12 | 0.84 | 2010 |
| Synchrony and asynchrony in neural networks | 1 | 0.38 | 2010 |
| Vertices of degree k in random maps | 2 | 0.39 | 2010 |
| Sharp load thresholds for cuckoo hashing | 21 | 1.05 | 2009 |
| Tight Bounds for Quasirandom Rumor Spreading | 8 | 0.69 | 2009 |
| The degree sequence of random graphs from subcritical classes† | 14 | 0.92 | 2009 |
| Optimal Algorithms for k-Search with Application in Option Pricing | 25 | 1.46 | 2009 |
| A note on the chromatic number of a dense random graph | 2 | 0.38 | 2009 |
| Brief announcement: the speed of broadcasting in random networks - density does not matter | 0 | 0.34 | 2009 |
| On the chromatic number of random graphs | 7 | 0.52 | 2008 |
| On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs | 3 | 0.52 | 2008 |
