| Regret Bounds For Batched Bandits | 0 | 0.34 | 2021 |
| A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. | 0 | 0.34 | 2020 |
| New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players. | 0 | 0.34 | 2019 |
| Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks | 16 | 0.95 | 2019 |
| Multiplayer bandits without observing collision information. | 4 | 0.44 | 2018 |
| The minimax learning rates of normal and Ising undirected graphical models | 1 | 0.36 | 2018 |
| Some techniques in density estimation. | 0 | 0.34 | 2018 |
| Sample-Efficient Learning of Mixtures | 2 | 0.40 | 2018 |
| Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. | 1 | 0.36 | 2018 |
| Notes on growing a tree in a graph | 0 | 0.34 | 2017 |
| The String Of Diamonds Is Nearly Tight For Rumour Spreading | 0 | 0.34 | 2017 |
| Tight Load Balancing Via Randomized Local Search | 2 | 0.37 | 2017 |
| Nearly-tight VC-dimension bounds for piecewise linear neural networks. | 19 | 0.85 | 2017 |
| Rumors Spread Slowly in a Small-World Spatial Network. | 0 | 0.34 | 2017 |
| Agnostic Distribution Learning via Compression. | 0 | 0.34 | 2017 |
| Rumours Spread Slowly in a Small World Spatial Network. | 1 | 0.37 | 2016 |
| Longest Paths In Random Apollonian Networks And Largest R-Ary Subtrees Of Random D-Ary Recursive Trees | 0 | 0.34 | 2016 |
| A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets | 3 | 0.43 | 2016 |
| Chasing a Fast Robber on Planar Graphs and Random Graphs | 2 | 0.43 | 2015 |
| Nowhere-zero Unoriented Flows in Hamiltonian Graphs. | 0 | 0.34 | 2015 |
| A Bounded Budget Network Creation Game | 6 | 0.51 | 2015 |
| On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract] | 4 | 0.46 | 2015 |
| Randomized Rumor Spreading in Poorly Connected Small-World Networks. | 0 | 0.34 | 2014 |
| On the push&pull protocol for rumour spreading. | 0 | 0.34 | 2014 |
| It's a Small World for Random Surfers. | 0 | 0.34 | 2014 |
| Justifying the small-world phenomenon via random recursive trees. | 0 | 0.34 | 2014 |
| On the Maximum Density of Graphs with Unique-Path Labelings. | 0 | 0.34 | 2013 |
| On the Longest Paths and the Diameter in Random Apollonian Networks. | 6 | 0.68 | 2013 |
| On the Stretch Factor of Randomly Embedded Random Graphs | 2 | 0.43 | 2012 |
| On a DAG partitioning problem | 1 | 0.39 | 2012 |
| On the Density of Nearly Regular Graphs with a Good Edge-Labeling. | 0 | 0.34 | 2012 |
| On a bounded budget network creation game | 13 | 0.97 | 2011 |
| A Randomly Embedded Random Graph is Not a Spanner. | 2 | 0.56 | 2011 |
| On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. | 11 | 1.01 | 2011 |
| Pursuing a Superfast Robber in an Interval Graph | 0 | 0.34 | 2010 |
