The SCEAS System
| |||||||

## Search the dblp DataBase
Dana Randall:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Dana Randall, Peter Winkler
**Mixing Points on an Interval.**[Citation Graph (0, 0)][DBLP] ALENEX/ANALCO, 2005, pp:218-221 [Conf] - Dana Randall, Peter Winkler
**Mixing Points on a Circle.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:426-435 [Conf] - Nayantara Bhatnagar, Sam Greenberg, Dana Randall
**The Effect of Boundary Conditions on Mixing Rates of Markov Chains.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:280-291 [Conf] - Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
**Counting triangulations and pseudo-triangulations of wheels.**[Citation Graph (0, 0)][DBLP] CCCG, 2001, pp:149-152 [Conf] - Russell A. Martin, Dana Randall
**Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:492-502 [Conf] - Neal Madras, Dana Randall
**Factoring Graphs to Bound Mixing Rates.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:194-203 [Conf] - Michael Luby, Dana Randall, Alistair Sinclair
**Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:150-159 [Conf] - Dana Randall
**Mixing.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:4-0 [Conf] - Raissa D'Souza, David Galvin, Cristopher Moore, Dana Randall
**Global connectivity from local geometric constraints for sensor networks with various wireless footprints.**[Citation Graph (0, 0)][DBLP] IPSN, 2006, pp:19-26 [Conf] - Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
**Random Bichromatic Matchings.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:190-201 [Conf] - Dana Randall, Prasad Tetali
**Analyzing Glauber Dynamics by Comparison of Markov Chains.**[Citation Graph (0, 0)][DBLP] LATIN, 1998, pp:292-304 [Conf] - Dana Randall
**Decomposition Methods and Sampling Circuits in the Cartesian Lattice.**[Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:74-86 [Conf] - Russell A. Martin, Dana Randall
**Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 1999, pp:257-268 [Conf] - Nayantara Bhatnagar, Dana Randall
**Torpid mixing of simulated tempering on the Potts model.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:478-487 [Conf] - Dana Randall
**Slow mixing of glauber dynamics via topological obstructions.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:870-879 [Conf] - Dana Randall, Alistair Sinclair
**Testable Algorithms for Self-Avoiding Walks.**[Citation Graph (0, 0)][DBLP] SODA, 1994, pp:593-602 [Conf] - Dana Randall, David Wilson
**Sampling Spin Configurations of an Ising System.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:959-960 [Conf] - Dana Randall, Gary D. Yngve
**Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:636-645 [Conf] - Mary Cryan, Martin E. Dyer, Dana Randall
**Approximately counting integral flows and cell-bounded contingency tables.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:413-422 [Conf] - Anna R. Karlin, Claire Kenyon, Dana Randall
**Dynamic TCP acknowledgement and other stories about e/(e-1).**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:502-509 [Conf] - Claire Kenyon, Dana Randall, Alistair Sinclair
**Matchings in lattice graphs.**[Citation Graph (0, 0)][DBLP] STOC, 1993, pp:738-746 [Conf] - Anna R. Karlin, Claire Kenyon, Dana Randall
**Dynamic TCP Acknowledgment and Other Stories about e/(e-1).**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:3, pp:209-224 [Journal] - Dana Randall
**Rapidly Mixing Markov Chains with Applications in Computer Science and Physics.**[Citation Graph (0, 0)][DBLP] Computing in Science and Engineering, 2006, v:8, n:2, pp:30-41 [Journal] - P. G. Doyle, J. C. Lagarias, Dana Randall
**Self-Packing of Centrally Symmetric Convex Bodies in R**[Citation Graph (0, 0)][DBLP]^{2}. Discrete & Computational Geometry, 1992, v:8, n:, pp:171-189 [Journal] - Jennifer T. Chayes, Dana Randall
**Foreword.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1999, v:15, n:3-4, pp:209- [Journal] - Svante Janson, Dana Randall, Joel Spencer
**Random dyadic tilings of the unit square.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:225-251 [Journal] - Dana Randall
**Efficient Generation of Random Nonsingular Matrices.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1993, v:4, n:1, pp:111-118 [Journal] - Michael Luby, Dana Randall, Alistair Sinclair
**Markov Chain Algorithms for Planar Lattice Structures.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:1, pp:167-192 [Journal] - Sam Greenberg, Dana Randall
**Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:540-553 [Conf] - David Galvin, Dana Randall
**Torpid mixing of local Markov chains on 3-colorings of the discrete torus.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:376-384 [Conf] **On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.**[Citation Graph (, )][DBLP]**Sampling stable marriages: why spouse-swapping won't work.**[Citation Graph (, )][DBLP]**Sampling biased lattice configurations using exponential metrics.**[Citation Graph (, )][DBLP]**Phase Transitions in Sampling Algorithms and the Underlying Random Structures.**[Citation Graph (, )][DBLP]**Random Bichromatic Matchings.**[Citation Graph (, )][DBLP]**Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |