2009 |
35 | EE | Sam Greenberg,
Amanda Pascoe,
Dana Randall:
Sampling biased lattice configurations using exponential metrics.
SODA 2009: 76-85 |
34 | EE | Sam Greenberg,
Dana Randall:
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models.
Theor. Comput. Sci. 410(15): 1417-1427 (2009) |
2008 |
33 | EE | Nayantara Bhatnagar,
Sam Greenberg,
Dana Randall:
Sampling stable marriages: why spouse-swapping won't work.
SODA 2008: 1223-1232 |
32 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
Algorithmica 50(4): 418-445 (2008) |
2007 |
31 | EE | Sam Greenberg,
Dana Randall:
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.
APPROX-RANDOM 2007: 540-553 |
30 | EE | David Galvin,
Dana Randall:
Torpid mixing of local Markov chains on 3-colorings of the discrete torus.
SODA 2007: 376-384 |
2006 |
29 | EE | Nayantara Bhatnagar,
Sam Greenberg,
Dana Randall:
The Effect of Boundary Conditions on Mixing Rates of Markov Chains.
APPROX-RANDOM 2006: 280-291 |
28 | EE | Raissa D'Souza,
David Galvin,
Cristopher Moore,
Dana Randall:
Global connectivity from local geometric constraints for sensor networks with various wireless footprints.
IPSN 2006: 19-26 |
27 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
LATIN 2006: 190-201 |
26 | EE | Dana Randall:
Slow mixing of glauber dynamics via topological obstructions.
SODA 2006: 870-879 |
25 | EE | Russell A. Martin,
Dana Randall:
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs.
Combinatorics, Probability & Computing 15(3): 411-448 (2006) |
24 | EE | Dana Randall:
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics.
Computing in Science and Engineering 8(2): 30-41 (2006) |
2005 |
23 | EE | Dana Randall,
Peter Winkler:
Mixing Points on an Interval.
ALENEX/ANALCO 2005: 218-221 |
22 | EE | Dana Randall,
Peter Winkler:
Mixing Points on a Circle.
APPROX-RANDOM 2005: 426-435 |
21 | EE | Mary Cryan,
Martin E. Dyer,
Dana Randall:
Approximately counting integral flows and cell-bounded contingency tables.
STOC 2005: 413-422 |
2004 |
20 | EE | Nayantara Bhatnagar,
Dana Randall:
Torpid mixing of simulated tempering on the Potts model.
SODA 2004: 478-487 |
2003 |
19 | EE | Dana Randall:
Mixing.
FOCS 2003: 4- |
18 | EE | Anna R. Karlin,
Claire Kenyon,
Dana Randall:
Dynamic TCP Acknowledgment and Other Stories about e/(e-1).
Algorithmica 36(3): 209-224 (2003) |
2002 |
17 | EE | Svante Janson,
Dana Randall,
Joel Spencer:
Random dyadic tilings of the unit square.
Random Struct. Algorithms 21(3-4): 225-251 (2002) |
2001 |
16 | EE | Dana Randall,
Günter Rote,
Francisco Santos,
Jack Snoeyink:
Counting triangulations and pseudo-triangulations of wheels.
CCCG 2001: 149-152 |
15 | EE | Dana Randall:
Decomposition Methods and Sampling Circuits in the Cartesian Lattice.
MFCS 2001: 74-86 |
14 | EE | Anna R. Karlin,
Claire Kenyon,
Dana Randall:
Dynamic TCP acknowledgement and other stories about e/(e-1).
STOC 2001: 502-509 |
13 | EE | Michael Luby,
Dana Randall,
Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures.
SIAM J. Comput. 31(1): 167-192 (2001) |
2000 |
12 | | Russell A. Martin,
Dana Randall:
Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method.
FOCS 2000: 492-502 |
11 | EE | Dana Randall,
Gary D. Yngve:
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings.
SODA 2000: 636-645 |
1999 |
10 | | Russell A. Martin,
Dana Randall:
Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions.
RANDOM-APPROX 1999: 257-268 |
9 | EE | Dana Randall,
David Wilson:
Sampling Spin Configurations of an Ising System.
SODA 1999: 959-960 |
8 | | Jennifer T. Chayes,
Dana Randall:
Foreword.
Random Struct. Algorithms 15(3-4): 209 (1999) |
1998 |
7 | EE | Dana Randall,
Prasad Tetali:
Analyzing Glauber Dynamics by Comparison of Markov Chains.
LATIN 1998: 292-304 |
1996 |
6 | | Neal Madras,
Dana Randall:
Factoring Graphs to Bound Mixing Rates.
FOCS 1996: 194-203 |
1995 |
5 | | Michael Luby,
Dana Randall,
Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).
FOCS 1995: 150-159 |
1994 |
4 | | Dana Randall,
Alistair Sinclair:
Testable Algorithms for Self-Avoiding Walks.
SODA 1994: 593-602 |
1993 |
3 | EE | Claire Kenyon,
Dana Randall,
Alistair Sinclair:
Matchings in lattice graphs.
STOC 1993: 738-746 |
2 | | Dana Randall:
Efficient Generation of Random Nonsingular Matrices.
Random Struct. Algorithms 4(1): 111-118 (1993) |
1992 |
1 | | P. G. Doyle,
J. C. Lagarias,
Dana Randall:
Self-Packing of Centrally Symmetric Convex Bodies in R2.
Discrete & Computational Geometry 8: 171-189 (1992) |