| Publication | Date of Publication | Type |
|---|
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
Journal of the ACM | 2022-12-08 | Paper |
Multiplayer Bandits Without Observing Collision Information
Mathematics of Operations Research | 2022-06-27 | Paper |
The String of Diamonds Is Tight for Rumor Spreading
| 2021-07-28 | Paper |
The string of diamonds is nearly tight for rumour spreading
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
The minimax learning rates of normal and Ising undirected graphical models
Electronic Journal of Statistics | 2020-08-17 | Paper |
Notes on growing a tree in a graph
Random Structures \& Algorithms | 2019-11-07 | Paper |
scientific article; zbMATH DE number 7064043 (Why is no real title available?)
| 2019-06-07 | Paper |
A bounded budget network creation game
ACM Transactions on Algorithms | 2018-10-30 | Paper |
The total variation distance between high-dimensional Gaussians with the same mean
| 2018-10-19 | Paper |
Rumors spread slowly in a small-world spatial network
SIAM Journal on Discrete Mathematics | 2017-11-02 | Paper |
A simple tool for bounding the deviation of random matrices on geometric sets
Lecture Notes in Mathematics | 2017-07-13 | Paper |
Tight Load Balancing via Randomized Local Search
| 2017-06-29 | Paper |
On the Push&Pull Protocol for Rumor Spreading
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Justifying the small-world phenomenon via random recursive trees
Random Structures \& Algorithms | 2017-04-18 | Paper |
It's a small world for random surfers
| 2017-03-22 | Paper |
Longest paths in random Apollonian networks and largest \(r\)-ary subtrees of random \(d\)-ary recursive trees
Journal of Applied Probability | 2016-12-09 | Paper |
It's a small world for random surfers
Algorithmica | 2016-10-21 | Paper |
Randomized rumor spreading in poorly connected small-world networks
Random Structures \& Algorithms | 2016-09-07 | Paper |
Nowhere-zero unoriented flows in Hamiltonian graphs.
Ars Combinatoria | 2016-05-31 | Paper |
On the Push\&Pull protocol for rumour spreading (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Rumours spread slowly in a small world spatial network
Lecture Notes in Computer Science | 2016-01-08 | Paper |
On longest paths and diameter in random Apollonian networks
Random Structures \& Algorithms | 2015-06-22 | Paper |
Chasing a fast robber on planar graphs and random graphs
Journal of Graph Theory | 2015-01-21 | Paper |
The fast robber on interval and chordal graphs
Discrete Applied Mathematics | 2014-11-28 | Paper |
On the maximum density of graphs with unique-path labelings
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
On the stretch factor of randomly embedded random graphs
Discrete \& Computational Geometry | 2013-06-07 | Paper |
Cops and Robber game with a fast robber on expander graphs and random graphs
Annals of Combinatorics | 2013-01-09 | Paper |
On the density of nearly regular graphs with a good edge-labeling
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
On the Maximum Density of Graphs with Good Edge-Labellings
| 2012-11-12 | Paper |
On a DAG partitioning problem
Lecture Notes in Computer Science | 2012-07-23 | Paper |
Lower bounds for the cop number when the robber is fast
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
On a generalization of Meyniel's conjecture on the Cops and Robbers game
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The capture time of grids
Discrete Mathematics | 2011-01-07 | Paper |
Zero-sum flows in regular graphs
Graphs and Combinatorics | 2010-11-12 | Paper |
Cops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs
| 2010-08-25 | Paper |
