Dan Romik

17 papers A* 1Journal 16
YearRankTypeTitle / Venue / Authors
2022 J jnl
The oriented swap process and last passage percolation.
Random Struct. Algorithms
Elia Bisi, Fabio Deelan Cunden, Shane Gibbons, Dan Romik
2018 J jnl
Differential Equations and Exact Solutions in the Moving Sofa Problem.
Exp. Math.
Dan Romik
2016 J jnl
Limit shapes of bumping routes in the Robinson-Schensted correspondence.
Random Struct. Algorithms
Dan Romik, Piotr Sniady
2010 J jnl
A formula for a doubly refined enumeration of alternating sign matrices.
Adv. Appl. Math.
Matan Karklinsky, Dan Romik
2007 J jnl
Integrals, partitions and MacMahon's Theorem.
J. Comb. Theory A
George E. Andrews, Henrik Eriksson, Fedor Petrov, Dan Romik
2007 J jnl
Limit shapes for random square Young tableaux.
Adv. Appl. Math.
Boris G. Pittel, Dan Romik
2006 J jnl
Permutations with short monotone subsequences.
Adv. Appl. Math.
Dan Romik
2006 J jnl
Shortest Paths in the Tower of Hanoi Graph and Finite Automata.
SIAM J. Discret. Math.
Dan Romik
2006 J jnl
The number of guillotine partitions in
Inf. Process. Lett.
Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik
2006 J jnl
Waiting for a Bat to Fly By (in Polynomial Time).
Comb. Probab. Comput.
Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos
2005 J jnl
Partitions of rt(t, n) into parts.
Eur. J. Comb.
Dan Romik
2005 J jnl
Roots of the Derivative of a Polynomial.
Am. Math. Mon.
Dan Romik
2004 J jnl
Explicit formulas for hook walks on continual Young diagrams.
Adv. Appl. Math.
Dan Romik
2004 J jnl
On Distributions Computable by Random Walks on Graphs.
SIAM J. Discret. Math.
Guy Kindler, Dan Romik
2004 A* conf
On distributions computable by random walks on graphs.
SODA
Guy Kindler, Dan Romik
2003 J jnl
Shortest paths in the Tower of Hanoi graph and finite automata
CoRR
Dan Romik
2000 J jnl
Stirling's Approximation for n!: The Ultimate Short Proof?
Am. Math. Mon.
Dan Romik