Abbas Mehrabian

Math. Oper. Res., 2022

2021

Regret Bounds for Batched Bandits.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Christopher Liaw

Yaniv Plan

J. ACM, 2020

The string of diamonds is nearly tight for rumour spreading.

[BibT_eX]

[DOI]

Omer Angel

Yuval Peres

Comb. Probab. Comput., 2020

Old Dog Learns New Tricks: Randomized UCB for Bandit Problems.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Notes on growing a tree in a graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

Batched Multi-Armed Bandits with Optimal Regret.

[BibT_eX]

[DOI]

CoRR, 2019

New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players.

[BibT_eX]

[DOI]

Emilie Kaufmann

CoRR, 2019

2018

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models.

[BibT_eX]

[DOI]

Luc Devroye

Tommy Reddad

CoRR, 2018

Some techniques in density estimation.

[BibT_eX]

[DOI]

CoRR, 2018

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Christopher Liaw

Yaniv Plan

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Sample-Efficient Learning of Mixtures.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Rumors Spread Slowly in a Small-World Spatial Network.

[BibT_eX]

[DOI]

Jeannette C. M. Janssen

SIAM J. Discret. Math., 2017

On the Push&Pull Protocol for Rumor Spreading.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Justifying the small-world phenomenon via random recursive trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Agnostic Distribution Learning via Compression.

[BibT_eX]

[DOI]

CoRR, 2017

Tight Load Balancing Via Randomized Local Search.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Nearly-tight VC-dimension bounds for piecewise linear neural networks.

[BibT_eX]

[DOI]

Nick Harvey

Christopher Liaw

Proceedings of the 30th Conference on Learning Theory, 2017

The String of Diamonds Is Tight for Rumor Spreading.

[BibT_eX]

[DOI]

Omer Angel

Yuval Peres

Proceedings of the Approximation, 2017

2016

Randomized rumor spreading in poorly connected small-world networks.

[BibT_eX]

[DOI]

Ali Pourmiri

Random Struct. Algorithms, 2016

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees.

[BibT_eX]

[DOI]

Andrea Collevecchio

Nick Wormald

J. Appl. Probab., 2016

A simple tool for bounding the deviation of random matrices on geometric sets.

[BibT_eX]

[DOI]

CoRR, 2016

It's a Small World for Random Surfers.

[BibT_eX]

[DOI]

Sina Sadeghian Sadeghabad

Nick Wormald

Algorithmica, 2016

2015

A Bounded Budget Network Creation Game.

[BibT_eX]

[DOI]

Mohammad Ali Safari

Morteza Saghafian

ACM Trans. Algorithms, 2015

Chasing a Fast Robber on Planar Graphs and Random Graphs.

[BibT_eX]

[DOI]

Noga Alon

J. Graph Theory, 2015

The fast robber on interval and chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Nowhere-zero Unoriented Flows in Hamiltonian Graphs.

[BibT_eX]

Ars Comb., 2015

Rumours Spread Slowly in a Small World Spatial Network.

[BibT_eX]

[DOI]

Jeannette C. M. Janssen

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

On longest paths and diameter in random apollonian network.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

On the push&pull protocol for rumour spreading.

[BibT_eX]

[DOI]

CoRR, 2014

2013

On the Maximum Density of Graphs with Unique-Path Labelings.

[BibT_eX]

[DOI]

Dieter Mitsche

Pawel Pralat

SIAM J. Discret. Math., 2013

On the Longest Paths and the Diameter in Random Apollonian Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On the Stretch Factor of Randomly Embedded Random Graphs.

[BibT_eX]

[DOI]

Nick Wormald

Discret. Comput. Geom., 2013

2012

On the Density of Nearly Regular Graphs with a Good Edge-Labeling.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

On a DAG Partitioning Problem.

[BibT_eX]

[DOI]

Soroush Alamdari

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

2011

The capture time of grids.

[BibT_eX]

[DOI]

Discret. Math., 2011

Lower Bounds for the Cop Number when the Robber is Fast.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game.

[BibT_eX]

[DOI]

Noga Alon

Electron. J. Comb., 2011

A Randomly Embedded Random Graph is Not a Spanner.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Zero-Sum Flows in Regular Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

Pursuing a Superfast Robber in an Interval Graph

[BibT_eX]

[DOI]