Random Infinite Permutations and the Cyclic Time Random Walk. - Omer Angel (DRW, 2003)

The stationary measure of a 2-type totally asymmetric exclusion process. - Omer Angel (J. Comb. Theory A, 2006)

A phase transition for the metric distortion of percolation on the hypercube. - Omer Angel; Itai Benjamini (Comb., 2007)

Routing complexity of faulty networks. - Omer Angel; Itai Benjamini; Eran Ofek; Udi Wieder (Random Struct. Algorithms, 2008)

Random Subnetworks of Random Sorting Networks. - Omer Angel; Alexander E. Holroyd (Electron. J. Comb., 2010)

Rotor Walks on General Trees. - Omer Angel; Alexander E. Holroyd (SIAM J. Discret. Math., 2011)

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. - Omer Angel; Abraham D. Flaxman; David B. Wilson 002 (Comb., 2012)

A Tight Upper Bound on Acquaintance Time of Graphs. - Omer Angel; Igor Shinkar (Graphs Comb., 2016)

Random walks on stochastic hyperbolic half planar triangulations. - Omer Angel; Asaf Nachmias; Gourab Ray (Random Struct. Algorithms, 2016)

The String of Diamonds Is Tight for Rumor Spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (APPROX-RANDOM, 2017)

Local max-cut in smoothed polynomial time. - Omer Angel; Sébastien Bubeck; Yuval Peres; Fan Wei (STOC, 2017)

Voronoi tessellations in the CRT and continuum random maps of finite excess. - Louigi Addario-Berry; Omer Angel; Guillaume Chapuy; Éric Fusy; Christina Goldschmidt (SODA, 2018)

An Isoperimetric Inequality for Planar Triangulations. - Omer Angel; Itai Benjamini; Nizan Horesh (Discret. Comput. Geom., 2018)

Letter to the Editor. - Omer Angel; Mark Holmes (J. Appl. Probab., 2019)

Long Monotone Trails in Random Edge-Labellings of Random Graphs. - Omer Angel; Asaf Ferber; Benny Sudakov; Vincent Tassion (Comb. Probab. Comput., 2020)

The string of diamonds is nearly tight for rumour spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (Comb. Probab. Comput., 2020)