default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver Riordan
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j56]Oliver Riordan:
Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors. Random Struct. Algorithms 61(4): 619-637 (2022)
2010 – 2019
- 2018
- [j55]Béla Bollobás, Oliver Riordan:
Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms 53(2): 185-220 (2018) - 2017
- [j54]Matthew Ashford, Oliver Riordan:
Counting racks of order n. Electron. J. Comb. 24(2): 2 (2017) - [j53]Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe:
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24(2): 2 (2017) - [j52]Béla Bollobás, Oliver Riordan, Erik Slivken
, Paul Smith:
The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j51]Béla Bollobás, Oliver Riordan:
Exploring hypergraphs with martingales. Random Struct. Algorithms 50(3): 325-352 (2017) - 2016
- [j50]Béla Bollobás, Oliver Riordan:
Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. 25(1): 21-75 (2016) - [j49]Oliver Riordan, Lutz Warnke:
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions. Comb. Probab. Comput. 25(1): 154-171 (2016) - [j48]Annika Heckel, Oliver Riordan:
On the threshold for rainbow connection number r in random graphs. Graphs Comb. 32(1): 161-174 (2016) - 2015
- [j47]Béla Bollobás, Oliver Riordan:
An old approach to the giant component problem. J. Comb. Theory B 113: 236-260 (2015) - [j46]Oliver Riordan, Lutz Warnke:
The Janson inequalities for general up-sets. Random Struct. Algorithms 46(2): 391-395 (2015) - [j45]Oliver Riordan, Lutz Warnke:
The evolution of subcritical Achlioptas processes. Random Struct. Algorithms 47(1): 174-203 (2015) - 2014
- [j44]Oliver Riordan:
Long cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 45(4): 764-767 (2014) - 2012
- [j43]Svante Janson, Oliver Riordan:
Susceptibility in Inhomogeneous Random Graphs. Electron. J. Comb. 19(1): 31 (2012) - [j42]Béla Bollobás, Oliver Riordan:
A Simple Branching Process Approach to the Phase Transition in Gn, p. Electron. J. Comb. 19(4): 21 (2012) - [j41]Annika Heckel, Oliver Riordan:
The Hitting Time of Rainbow Connection Number Two. Electron. J. Comb. 19(4): 37 (2012) - [j40]Oliver Riordan:
The Phase Transition in the Configuration Model. Comb. Probab. Comput. 21(1-2): 265-299 (2012) - [j39]Béla Bollobás, Svante Janson, Oliver Riordan:
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8(3): 187-231 (2012) - [j38]Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory B 102(1): 53-61 (2012) - [j37]József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan:
Linear algebra and bootstrap percolation. J. Comb. Theory A 119(6): 1328-1335 (2012) - [j36]Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41(4): 441-450 (2012) - 2011
- [j35]Béla Bollobás, Svante Janson, Oliver Riordan:
On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011) - [j34]Béla Bollobás, Svante Janson, Oliver Riordan:
Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011) - [j33]Béla Bollobás, Oliver Riordan:
Sparse graphs: Metrics and random models. Random Struct. Algorithms 39(1): 1-38 (2011) - [j32]Svante Janson, Oliver Riordan:
Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms 39(3): 399-411 (2011) - 2010
- [j31]Oliver Riordan, Nicholas C. Wormald:
The Diameter of Sparse Random Graphs. Comb. Probab. Comput. 19(5-6): 835-926 (2010)
2000 – 2009
- 2009
- [j30]Béla Bollobás, Svante Janson, Oliver Riordan:
Line-of-Sight Percolation. Comb. Probab. Comput. 18(1-2): 83-106 (2009) - [j29]Béla Bollobás, Oliver Riordan:
Clique percolation. Random Struct. Algorithms 35(3): 294-322 (2009) - 2008
- [j28]Oliver Riordan:
The k-Core and Branching Processes. Comb. Probab. Comput. 17(1): 111-136 (2008) - [j27]Béla Bollobás, Oliver Riordan:
Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008) - 2007
- [j26]Béla Bollobás, Oliver Riordan:
A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007) - [j25]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007) - [j24]Béla Bollobás, Svante Janson, Oliver Riordan:
Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007) - [j23]Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Degree distribution of the FKP network model. Theor. Comput. Sci. 379(3): 306-316 (2007) - 2006
- [b1]Béla Bollobás, Oliver Riordan:
Percolation. Cambridge University Press 2006, ISBN 978-0-521-87232-4, pp. I-X, 1-323 - [j22]Béla Bollobás, Oliver Riordan:
Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006) - 2005
- [j21]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms 26(1-2): 1-36 (2005) - [j20]Béla Bollobás, Oliver Riordan:
Slow emergence of the giant component in the growing m-out graph. Random Struct. Algorithms 27(1): 1-24 (2005) - 2004
- [j19]Béla Bollobás, Oliver Riordan:
The Diameter of a Scale-Free Random Graph. Comb. 24(1): 5-34 (2004) - [j18]Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree. Comb. 24(2): 187-207 (2004) - [c3]Béla Bollobás, Oliver Riordan:
The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18 - 2003
- [j17]Béla Bollobás, Oliver Riordan:
Robustness and Vulnerability of Scale-Free Random Graphs. Internet Math. 1(1): 1-35 (2003) - [j16]Béla Bollobás, Oliver Riordan:
Coupling Scale-Free and Classical Random Graphs. Internet Math. 1(2): 215-225 (2003) - [j15]Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp:
Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory B 87(2): 366-373 (2003) - [j14]Béla Bollobás, Oliver Riordan:
Disjointly representing set systems. J. Comb. Theory A 102(1): 1-9 (2003) - [c2]Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Degree Distribution of the FKP Network Model. ICALP 2003: 725-738 - [c1]Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Directed scale-free graphs. SODA 2003: 132-139 - 2002
- [j13]Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11(4): 323-341 (2002) - [j12]Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan:
Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4): 336-346 (2002) - 2001
- [j11]Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott:
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22(1): 1-4 (2001) - [j10]Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády:
The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3): 279-290 (2001) - 2000
- [j9]Béla Bollobás, Oliver Riordan:
Constrained Graph Processes. Electron. J. Comb. 7 (2000) - [j8]Oliver Riordan:
Spanning Subgraphs Of Random Graphs. Comb. Probab. Comput. 9(2): 125-148 (2000) - [j7]Oliver Riordan, Alex Selby:
The Maximum Degree Of A Random Graph. Comb. Probab. Comput. 9(6): 549-572 (2000) - [j6]Béla Bollobás, Oliver Riordan:
Polychromatic polynomials. Discret. Math. 219(1-3): 1-7 (2000) - [j5]Béla Bollobás, Luke Pebody, Oliver Riordan:
Contraction-Deletion Invariants for Graphs. J. Comb. Theory B 80(2): 320-345 (2000)
1990 – 1999
- 1999
- [j4]Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195(1-3): 67-80 (1999) - 1998
- [j3]Béla Bollobás, Oliver Riordan:
On some conjectures of Graffiti. Discret. Math. 179(1-3): 223-230 (1998) - [j2]Béla Bollobás, Oliver Riordan:
Colorings generated by monotone properties. Random Struct. Algorithms 12(1): 1-25 (1998) - [j1]Oliver Riordan:
An Ordering on the Even Discrete Torus. SIAM J. Discret. Math. 11(1): 110-127 (1998)
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-10-07 21:22 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:
