default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Angel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29(1): 22-30 (2020)- [j11]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is nearly tight for rumour spreading. Comb. Probab. Comput. 29(2): 190-199 (2020)
2010 – 2019
- 2019
- [j10]Omer Angel, Mark Holmes
:
Letter to the Editor. J. Appl. Probab. 56(4): 1269-1270 (2019) - 2018
- [j9]Omer Angel, Itai Benjamini, Nizan Horesh:
An Isoperimetric Inequality for Planar Triangulations. Discret. Comput. Geom. 59(4): 802-809 (2018) - [c5]Louigi Addario-Berry, Omer Angel, Guillaume Chapuy, Éric Fusy, Christina Goldschmidt:
Voronoi tessellations in the CRT and continuum random maps of finite excess. SODA 2018: 933-946 - 2017
- [c4]Omer Angel, Abbas Mehrabian, Yuval Peres:
The String of Diamonds Is Tight for Rumor Spreading. APPROX-RANDOM 2017: 26:1-26:9 - [c3]Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei:
Local max-cut in smoothed polynomial time. STOC 2017: 429-437 - [i3]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is tight for rumor spreading. CoRR abs/1704.00874 (2017) - 2016
- [j8]Omer Angel, Igor Shinkar:
A Tight Upper Bound on Acquaintance Time of Graphs. Graphs Comb. 32(5): 1667-1673 (2016) - [j7]Omer Angel, Asaf Nachmias, Gourab Ray:
Random walks on stochastic hyperbolic half planar triangulations. Random Struct. Algorithms 49(2): 213-234 (2016) - [i2]Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei:
Local max-cut in smoothed polynomial time. CoRR abs/1610.04807 (2016) - 2013
- [i1]Omer Angel, Igor Shinkar:
A Tight Upper Bound on Acquaintance Time of Graphs. CoRR abs/1307.6029 (2013) - 2012
- [j6]Omer Angel, Abraham D. Flaxman, David B. Wilson:
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. Comb. 32(1): 1-33 (2012) - 2011
- [j5]Omer Angel, Alexander E. Holroyd:
Rotor Walks on General Trees. SIAM J. Discret. Math. 25(1): 423-446 (2011) - 2010
- [j4]Omer Angel, Alexander E. Holroyd:
Random Subnetworks of Random Sorting Networks. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2008
- [j3]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008) - 2007
- [j2]Omer Angel, Itai Benjamini:
A phase transition for the metric distortion of percolation on the hypercube. Comb. 27(6): 645-658 (2007) - 2006
- [j1]Omer Angel:
The stationary measure of a 2-type totally asymmetric exclusion process. J. Comb. Theory A 113(4): 625-635 (2006) - 2005
- [c2]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. PODC 2005: 209-217 - 2003
- [c1]Omer Angel:
Random Infinite Permutations and the Cyclic Time Random Walk. DRW 2003: 9-16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
