Publications
 Phase transitions in random dyadic tilings and rectangular dissections, S. Cannon, S. Miracle and D. Randall,
26th Symposium on Discrete Algorithms (SODA), 2015
 Mixing times of Markov chains for selforganized lists and biased permutations, P. Bhakta, S. Miracle, D. Randall and A. Streib,
25th Symposium on Discrete Algorithms (SODA), 2014
 Phase coexistence and slow mixing for the hardcore model on $Z^2$.A. Blanca, D. Galvin, D. Randall and P. Tetali.17th Workshop on Randomization and Computation (RANDOM), 2013.
 Algorithms to approximately count and sample conforming colorings of graphs S. Miracle and D. Randall. VII LatinAmerican Algorithms, Graphs and Optimization Symposium (LAGOS), 2013
 Mixing times of Markov chains for selforganizing lists and biased permutations P. Bhakta, S. Miracle, D. Randall and A. Streib. 24th Symposium on Discrete Algorithms (SODA), 2013
 Mixing times of Markov chains on 3orientations of planar triangulations. S. Miracle, D. Randall, A. Streib and P. Tetali. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for hte Analysis of Algorithms (AofA), 2012.
 Clustering in interfering models of binary mixtures. S. Miracle, D. Randall and A. Streib.
15th International Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM), 2011.
 Cluster algorithms for discrete models of colloids with bars. S. Miracle, D. Randall and A. Streib.
Proceedings of the Second Workshop on Analytic Algorthmics and
Combinatorics (ANALCO), 2010.
 On the DiaconisGangolli Markov Chain for
sampling contingency tables with cellbounded entries. I. Bezakova, N. Bhatnagar and D. Randall.
Journal of Combinatorial Optimization, 2010.
(Conference version appeared earlier in the 15TH International Computing and Combinatorics Conference
(COCOON), 2009.

Approximately counting integer flows and cellbounded
contingency tables.
M. Cryan, M. Dyer and D. Randall.
SIAM Journal on Computing, 39: 26832703, 2010.
(Conference version appeared earlier in the 37th Symposium on Theory of Computing (STOC), 2005.)
 Selfassembly and convergence rates of heterogenous reversible growth processes. A. Pascoe and D. Randall.
Foundations of Nanoscience (FNANO), 2009.
 Sampling biased lattice conﬁgurations
using exponential metrics. Sam Greenberg, A. Pascoe and D. Randall.
20th Symposium on Discrete Algorithms (SODA), 2009.
 Convergence rates of Markov chains for some
selfassembly and nonsaturated Ising models.
S. Greenberg and D. Randall.
Theoretical Computer Science, 410: 14171427, 2009.

Sampling stable marriages: why spouseswapping won't work.
N. Bhatnagar, S. Greenberg and D. Randall.
19th Symposium on Discrete Algorithms (SODA), 2008.

Slow mixing of Markov chains using fault lines
and fat contours.
S. Greenberg and D. Randall. Algorithmica (online first), 2008.
(An earlier version appeared in
11th International Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM), 2007.)

Markov chain convergence and the efficiency of
some selfassembly models.
D. Randall.
Foundations of Nanoscience: SelfAssembled Archetectures and Devices (FNANO),
117125, 2007.

Torpid mixing of local Markov chains on 3colorings
of the discrete torus.
D. Galvin and D. Randall.
18th Symposium on Discrete Algorithms (SODA), 2007.

The effect of boundary conditions on mixing
rates of Markov chains.
N. Bhatnagar, S. Greenberg and D. Randall.
10th International Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM), 2006.

Global connectivity from local geometric constraints
for sensor networks with various wireless footprints.
R. D'Souza, D. Galvin, C. Moore and D. Randall.
Information Processing in Sensor Networks (IPSN), 2006.

Disjoint decomposition of Markov chains and sampling circuits in Cayley graphs.
R. Martin and D. Randall.
Combinatorics, Probability and Computing 15: 411448, 2006.
[pdf, ps.gz]

Rapidly mixing Markov chains with applications in computer science
and physics. D. Randall. Computing in Science and Engineering, 2006

Random bichromatic matchings N. Bhatnagar, D. Randall, V. Vazirani, E. Vigoda. 7th Latin Amerian Theoretical Informatics Symposium (LATIN), 2006.

Slow mixing of Glauber dynamics via
topological obstructions. D. Randall. 17th Symposium on Discrete Algorihtms (SODA), 2006.
(This version corrects an error in the original paper claiming better bounds due to a missing factor of 2 in some equations.)

Book review of "Complexities: Women in Mathematics." Times Higher Education Supplement, September 2, 2005.
[doc]

Mixing points on a circle.
D. Randall and P. Winkler.
9th International Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM)
in Lecture Notes in Computer Science, 3624: 426435, 2005.

Mixing points on an interval.
D. Randall and P. Winkler. In
Second Workshop on Analytic Algorthmics and
Combinatorics (ANALCO), 2005.

Torpid mixing of simulated tempering on the Potts model.
N. Bhatnagar and D. Randall.
the 15th ACM/SIAM Symposium on Discrete Algorithms (SODA): 478487, 2004.
[pdf,
ps.gz]

Mixing.
D. Randall.
A tutorial on Markov chains in
the 44th Symposium on Foundations of Computer Science
(FOCS): 415, 2003.
[pdf,
ps.gz]

Dynamic TCP acknowledgement and other stories about e/(e1).
A.R. Karlin, C. Kenyon and D. Randall.
Algorithmica 36: 209224, 2003.
[pdf,
ps.gz]
(Earlier
conference version appeared in the
33rd Symposium on Theory of Computing (STOC): 502509, 2001.)

Random dyadic tilings of the unit square.
S. Janson, D. Randall and J. Spencer.
Random Structures and Algorithms 21: 225251, 2002.
[pdf,
ps.gz]

Markov chain decomposition for convergence rate
analysis.
N. Madras and D. Randall.
Annals of Applied Probability, 12: 581606, 2002.
[pdf,
ps.gz]

Decomposition methods and sampling circuits in the Cartesian lattice.
D. Randall.
Mathematical Foundations of Computer Science (MFCS), in
Lecture Notes in Computer Science
1256: 7284, 2001. (Invited contribution.)
[pdf,
ps.gz]

Counting triangulations and pseudotriangulations of wheels.
D. Randall, G. Rote, F. Santos and J. Snoeyink.
the 13th Canadian Conference on Computational Geometry
(CCCG): 149152, 2001.
[pdf]
(Slightly longer version.)

Markov chain algorithms for planar lattice structures
M. Luby, D. Randall and A.J. Sinclair.
SIAM Journal on Computing, 31: 167192, 2001.
[pdf,
ps.gz]
(The conference version appeared in
the 36th Symposium on Foundations of Computer Science
(FOCS): 150159, 1995. )

Sampling adsorbing staircase walks
using a new Markov chain decomposition method.
R.A. Martin and D. Randall.
41st Symposium on Foundations of Computer Science (FOCS)
492502, 2000.
[pdf,
ps.gz]

Analyzing Glauber dynamics by comparison
of Markov chains.
D. Randall and P. Tetali.
Journal of Mathematical Physics, 41 : 15981615, 2000.
[pdf,
ps.gz]
(The conference version appeared in
Latin American Theoretical Informatics (LATIN)
in
Lecture Notes in Computer Science 1380: 392304, 1998.)

Selftesting algorithms for selfavoiding walks.
D. Randall and A.J. Sinclair.
Journal of Mathematical Physics, 41 : 15701584, 2000.
[pdf,
ps.gz/a>]
(The conference version
''Testable algorithms for selfavoiding walks'' appeared in
the 5th ACM/SIAM Symposium on Discrete Algorithms (SODA): 593602, 1994.)

Random threedimensional tilings of Aztec
octahedra and tetrahedra: An extension of domino tilings.
D. Randall and G. Yngve.
11th SIAM/ACM Symposium on Discrete Algorithms (SODA), 2000.
[pdf,
ps.gz]
(This file is very long!
Try the shorter version for a
smaller file with some pictures omitted.)

The Van den BergKestenReimer inequality.
C. Borgs, J.T. Chayes and D. Randall.
Perplexing Problems in Probability: Festschrift in honor of Harry Kesten,
Birkhauser
(M. Bramson and R. Durrett, editors): 159173, 1999.
[pdf,
ps.gz]

Pfaffian algorithms for sampling routings
on regions with free boundary conditions.
R.A. Martin and D. Randall.
3rd International Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM)
in Lecture Notes in Computer Science, 1671: 257268, 1999.
[pdf,
ps.gz]

Sampling spin configurations of an Ising system.
D. Randall and D.B. Wilson.
10th Symposium on Discrete Algorithms (SODA): S959960, 1999.
[pdf,
ps.gz]

Approximating the number of monomerdimer coverings of a
lattice.
C. Kenyon, D. Randall and A.J. Sinclair.
Journal of Statistical Physics, 83: 637659, 1996.
[pdf,
ps.gz]
(The conference version appeared in
the 25th Sympsium on Theoretical Computer Science (STOC), 1993.)

Factoring Markov chains to bound mixing rates.
N. Madras and D. Randall.
37th Symposium on Foundations of Computer Science (FOCS):
194203, 1996.

Efficient generation of random nonsingular matrices.
D. Randall.
Random Structures and Algorithms , 4: 111118, 1993.

Selfpacking of centrally symmetric convex bodies in R^2.
P. Doyle, J.C. Lagarias and D. Randall.
Discrete and Computational Geometry, 8: 171189, 1992.

On the transformations of some graphs.
A.M. Odlyzko and D. Randall.
Complex Systems, 1: 203209, 1987.

Counting in lattices: some combinatorial problems from statistical
mechanics.
Ph. D. Thesis: D. Randall.
International Computer Science Institute (ICSI) Technical Report Number TR05594, 1994.
[pdf,
ps.gz]
