default search action
Richard Arratia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Richard Arratia, E. Rodney Canfield, Alfred W. Hales:
Random feedback shift registers and the limit distribution for largest cycle lengths. Comb. Probab. Comput. 32(4): 559-593 (2023) - [j14]Richard Arratia, Stephen Desalvo:
On the largest part size of low-rank combinatorial assemblies. Random Struct. Algorithms 63(1): 3-26 (2023) - 2021
- [j13]Richard Arratia, Stephen Desalvo:
Attacks and alignments: rooks, set partitions, and permutations. Australas. J Comb. 81: 25-45 (2021)
2010 – 2019
- 2016
- [j12]Richard Arratia, Stephen Desalvo:
Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example. Comb. Probab. Comput. 25(3): 324-351 (2016) - [j11]Richard Arratia, Skip Garibaldi
, Joe Kilian:
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. Random Struct. Algorithms 48(3): 480-502 (2016)
2000 – 2009
- 2006
- [j10]Richard Arratia, Andrew D. Barbour, Simon Tavaré:
A Tale of Three Couplings: Poisson-Dirichlet and GEM Approximations for Random Permutations. Comb. Probab. Comput. 15(1-2): 31-62 (2006) - 2004
- [j9]Richard Arratia, Béla Bollobás, Gregory B. Sorkin
A Two-Variable Interlace Polynomial. Comb. 24(4): 567-584 (2004) - [j8]Richard Arratia, Béla Bollobás, Gregory B. Sorkin
The interlace polynomial of a graph. J. Comb. Theory B 92(2): 199-233 (2004) - 2000
- [j7]Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin
Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. 104(1-3): 63-96 (2000) - [c3]Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
The interlace polynomial: a new graph polynomial. SODA 2000: 237-245
1990 – 1999
- 1999
- [j6]Richard Arratia:
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern. Electron. J. Comb. 6 (1999) - [j5]Richard Arratia, Andrew D. Barbour, Simon Tavaré:
The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process. Comb. Probab. Comput. 8(5): 407-416 (1999) - 1997
- [j4]Miroslav Tanushev, Richard Arratia:
A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains. Comb. Probab. Comput. 6(4): 493-496 (1997) - [j3]M. S. Tanushev, Richard Arratia:
Central Limit Theorem from Renewal Theory for Several Patterns. J. Comput. Biol. 4(1): 35-44 (1997) - [c2]Richard Arratia:
On the central role of scale invariant Poisson processes on (0, ∞). Microsurveys in Discrete Probability 1997: 21-41 - 1996
- [j2]Richard Arratia, Daniela Martin, Gesine Reinert
Poisson Process Approximation for Sequence Repeats and Sequencing by Hybridization. J. Comput. Biol. 3(3): 425-463 (1996) - [c1]Richard Arratia, Gesine Reinert
Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization. CPM 1996: 209-219 - 1992
- [j1]Richard Arratia, Simon Tavaré:
Limit Theorems for Combinatorial Structures via Discrete Process Approximations. Random Struct. Algorithms 3(3): 321-346 (1992)
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 20:29 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: