default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Romik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j15]Elia Bisi
, Fabio Deelan Cunden, Shane Gibbons, Dan Romik:
The oriented swap process and last passage percolation. Random Struct. Algorithms 60(4): 690-715 (2022)- 2018
- [j14]Dan Romik:
Differential Equations and Exact Solutions in the Moving Sofa Problem. Exp. Math. 27(3): 316-330 (2018) - 2016
- [j13]Dan Romik, Piotr Sniady:
Limit shapes of bumping routes in the Robinson-Schensted correspondence. Random Struct. Algorithms 48(1): 171-182 (2016) - 2010
- [j12]Matan Karklinsky, Dan Romik:
A formula for a doubly refined enumeration of alternating sign matrices. Adv. Appl. Math. 45(1): 28-35 (2010) - 2007
- [j11]Boris G. Pittel, Dan Romik:
Limit shapes for random square Young tableaux. Adv. Appl. Math. 38(2): 164-209 (2007) - [j10]George E. Andrews, Henrik Eriksson, Fedor Petrov, Dan Romik:
Integrals, partitions and MacMahon's Theorem. J. Comb. Theory A 114(3): 545-554 (2007) - 2006
- [j9]Dan Romik:
Permutations with short monotone subsequences. Adv. Appl. Math. 37(4): 501-510 (2006) - [j8]Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos:
Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. 15(5): 673-683 (2006) - [j7]Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik:
The number of guillotine partitions in d dimensions. Inf. Process. Lett. 98(4): 162-167 (2006) - [j6]Dan Romik:
Shortest Paths in the Tower of Hanoi Graph and Finite Automata. SIAM J. Discret. Math. 20(3): 610-622 (2006) - 2005
- [j5]Dan Romik:
Partitions of rt(t, n) into parts. Eur. J. Comb. 26(1): 1-17 (2005) - [j4]Dan Romik:
Roots of the Derivative of a Polynomial. Am. Math. Mon. 112(1): 66-69 (2005) - 2004
- [j3]Dan Romik:
Explicit formulas for hook walks on continual Young diagrams. Adv. Appl. Math. 32(4): 625-654 (2004) - [j2]Guy Kindler, Dan Romik:
On Distributions Computable by Random Walks on Graphs. SIAM J. Discret. Math. 17(4): 624-633 (2004) - 2000
- [j1]Dan Romik:
Stirling's Approximation for n!: The Ultimate Short Proof? Am. Math. Mon. 107(6): 556-557 (2000)
Conference and Workshop Papers
- 2004
- [c1]Guy Kindler, Dan Romik:
On distributions computable by random walks on graphs. SODA 2004: 131-138
Informal and Other Publications
- 2003
- [i1]Dan Romik:
Shortest paths in the Tower of Hanoi graph and finite automata. CoRR math.CO/0310109 (2003)
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 22:14 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:
