Dana Randall

Orcid: 0000-0002-1152-2627

Affiliations:
  • Georgia Institute of Technology, Atlanta, USA


According to our database1, Dana Randall authored at least 80 papers between 1987 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Adaptive collective responses to local stimuli in anonymous dynamic networks.
Theor. Comput. Sci., 2025

2024
Single Bridge Formation in Self-Organizing Particle Systems.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2022
Mixing times of Markov chains for self-organizing lists and biased permutations.
Random Struct. Algorithms, 2022

Spanning tree methods for sampling graph partitions.
CoRR, 2022

Foraging in Particle Systems via Self-Induced Phase Changes.
CoRR, 2022

Mathematically Quantifying Gerrymandering and the Non-responsiveness of the 2021 Georgia Congressional Districting Plan.
CoRR, 2022

Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

A Heterogeneous Schelling Model for Wealth Disparity and its Effect on Segregation.
Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan.
Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems.
Proceedings of the Approximation, 2022

2020
Sampling biased monotonic surfaces using exponential metrics.
Comb. Probab. Comput., 2020

Programming Active Granular Matter with Mechanically Induced Phase Changes.
CoRR, 2020

Statistical Physics and Algorithms (Invited Talk).
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
Phase Coexistence for the Hard-Core Model on ℤ2.
Comb. Probab. Comput., 2019

Thermodynamic Computing.
CoRR, 2019

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ferroelectric and Antiferroelectric Phases.
CoRR, 2019

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases.
Proceedings of the Approximation, 2019

A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the Approximation, 2019

2018
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections.
SIAM J. Discret. Math., 2018

A stochastic approach to shortcut bridging in programmable matter.
Nat. Comput., 2018

Phototactic supersmarticles.
Artif. Life Robotics, 2018

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices.
Proceedings of the 29th International Conference on Probabilistic, 2018

Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Sampling weighted perfect matchings on the square-octagon lattice.
Theor. Comput. Sci., 2017

Cyberterrorism: its effects on psychological well-being, public confidence and political attitudes.
J. Cybersecur., 2017

Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk).
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Approximately Sampling Elements with Fixed Rank in Graded Posets.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Sampling and Counting 3-Orientations of Planar Triangulations.
SIAM J. Discret. Math., 2016

Algorithms to approximately count and sample conforming colorings of graphs.
Discret. Appl. Math., 2016

Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$.
CoRR, 2016

Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Phase coexistence and torpid mixing in the 3-coloring model on ℤ<sup>d</sup>.
SIAM J. Discret. Math., 2015

Simulated Tempering and Swapping on Mean-Field Models.
CoRR, 2015

2014
Clustering and Mixing Times for Segregation Models on ℤ<sup>2</sup>.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Foreword to the Special Issue on SODA'11.
ACM Trans. Algorithms, 2013

Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2
CoRR, 2012

Mixing Times of Self-Organizing Lists and Biased Permutations
CoRR, 2012

Algorithms for Sampling 3-Orientations of Planar Triangulations
CoRR, 2012

2011
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.
J. Comb. Optim., 2011

Clustering in Interfering Binary Mixtures.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

Cluster Algorithms for Discrete Models of Colloids with Bars.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables.
SIAM J. Comput., 2010

Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.
Algorithmica, 2010

Phase Transitions in Sampling Algorithms and the Underlying Random Structures.
Proceedings of the Algorithm Theory, 2010

2009
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models.
Theor. Comput. Sci., 2009

Sampling biased lattice configurations using exponential metrics.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Random Bichromatic Matchings.
Algorithmica, 2008

Sampling stable marriages: why spouse-swapping won't work.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Torpid mixing of local Markov chains on 3-colorings of the discrete torus.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics.
Comput. Sci. Eng., 2006

Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs.
Comb. Probab. Comput., 2006

Slow mixing of glauber dynamics via topological obstructions.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Global connectivity from local geometric constraints for sensor networks with various wireless footprints.
Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, 2006

The Effect of Boundary Conditions on Mixing Rates of Markov Chains.
Proceedings of the Approximation, 2006

2005
Mixing Points on a Circle.
Proceedings of the Approximation, 2005

Mixing Points on an Interval.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Torpid mixing of simulated tempering on the Potts model.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Dynamic TCP Acknowledgment and Other Stories about e/(e-1).
Algorithmica, 2003

Mixing.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Random dyadic tilings of the unit square.
Random Struct. Algorithms, 2002

2001
Markov Chain Algorithms for Planar Lattice Structures.
SIAM J. Comput., 2001

Dynamic TCP acknowledgement and other stories about e/(e-1).
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Decomposition Methods and Sampling Circuits in the Cartesian Lattice.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Counting triangulations and pseudo-triangulations of wheels.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Foreword.
Random Struct. Algorithms, 1999

Sampling Spin Configurations of an Ising System.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions.
Proceedings of the Randomization, 1999

1998
Analyzing Glauber Dynamics by Comparison of Markov Chains.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1996
Factoring Graphs to Bound Mixing Rates.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Testable Algorithms for Self-Avoiding Walks.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Efficient Generation of Random Nonsingular Matrices.
Random Struct. Algorithms, 1993

Matchings in lattice graphs.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Self-Packing of Centrally Symmetric Convex Bodies in R<sup>2</sup>.
Discret. Comput. Geom., 1992

1987
On the Periods of Some Graph Transformations.
Complex Syst., 1987


  Loading...