Dana Randall | Academic Influence

Dana Randall's AcademicInfluence.com Rankings

Dana Randall

Computer Science

#1554

World Rank

#1608

Historical Rank

#765

USA Rank

Database

#9411

World Rank

#9914

Historical Rank

#1320

USA Rank

computer-science Degrees

Download Badge

Computer Science

Dana Randall's Degrees

PhD Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Dana Randall Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dana Randall is an American computer scientist. She works as the ADVANCE Professor of Computing, and adjunct professor of mathematics at the Georgia Institute of Technology. She is also an External Professor of the Santa Fe Institute. Previously she was executive director of the Georgia Tech Institute of Data Engineering and Science that she co-founded, and director of the Algorithms and Randomness Center. Her research include combinatorics, computational aspects of statistical mechanics, Monte Carlo stimulation of Markov chains, and randomized algorithms.

(See a Problem?)

Dana Randall's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Markov chain algorithms for planar lattice structures (1995) (210)
Analyzing Glauber Dynamics by Comparison of Markov Chains (1998) (150)
Dynamic TCP acknowledgement and other stories about e/(e-1) (2001) (120)
Markov chain decomposition for convergence rate analysis (2002) (110)
Rapidly mixing Markov chains with applications in computer science and physics (2006) (89)
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) (2003) (73)
Torpid mixing of simulated tempering on the Potts model (2004) (61)
Approximating the number of monomer-dimer coverings of a lattice (1996) (58)
Sampling adsorbing staircase walks using a new Markov chain decomposition method (2000) (57)
Sampling spin configurations of an Ising system (1999) (47)
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems (2016) (46)
Slow mixing of glauber dynamics via topological obstructions (2006) (44)
Clustering and Mixing Times for Segregation Models on ℤ2 (2014) (35)
Sampling stable marriages: why spouse-swapping won't work (2008) (35)
Counting triangulations and pseudo-triangulations of wheels (2001) (35)
Sampling biased lattice configurations using exponential metrics (2009) (34)
Cyberterrorism: its effects on psychological well-being, public confidence and political attitudes (2017) (33)
Efficient Generation of Random Nonsingular Matrices (1993) (31)
Self-packing of centrally symmetric convex bodies in ℝ2 (1992) (27)
The van den Berg-Kesten-Reimer Inequality: A Review (1999) (27)
Factoring graphs to bound mixing rates (1996) (27)
Torpid mixing of local Markov chains on 3-colorings of the discrete torus (2007) (27)
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). (1995) (25)
A stochastic approach to shortcut bridging in programmable matter (2017) (24)
Global connectivity from local geometric constraints for sensor networks with various wireless footprints (2006) (24)
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs (2006) (24)
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2 (2012) (24)
Self-testing algorithms for self-avoiding walks (2000) (22)
Phase coexistence and torpid mixing in the 3-coloring model on ℤd (2012) (22)
Phototactic supersmarticles (2017) (20)
Programming active cohesive granular matter with mechanically induced phase changes (2020) (20)
Mixing times of Markov chains for self‐organizing lists and biased permutations (2013) (18)
Approximately counting integral flows and cell-bounded contingency tables (2005) (18)
Testable algorithms for self-avoiding walks (1994) (15)
Mixing Points on an Interval (2005) (15)
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections (2015) (14)
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours (2010) (14)
Clustering in Interfering Binary Mixtures (2011) (13)
Random dyadic tilings of the unit square (2002) (13)
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models (2009) (13)
Counting in lattices: Combinatorial problems from statistical mechanics (1994) (13)
Mixing Points on a Circle (2005) (13)
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings (2000) (13)
Matchings in lattice graphs (1993) (12)
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems (2018) (12)
Phase Coexistence for the Hard-Core Model on ℤ2 (2018) (10)
Simulated Tempering and Swapping on Mean-Field Models (2015) (10)
Mixing Times of Self-Organizing Lists and Biased Permutations (2012) (8)
Thermodynamic Computing (2019) (8)
Algorithms for Sampling 3-Orientations of Planar Triangulations (2012) (5)
The Effect of Boundary Conditions on Mixing Rates of Markov Chains (2006) (5)
Sampling biased monotonic surfaces using exponential metrics (2017) (5)
Random Bichromatic Matchings (2006) (5)
Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions (2016) (4)
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$ (2016) (4)
Mixing times of Markov chains on 3-Orientations of Planar Triangulations (2012) (4)
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (2009) (4)
On the Periods of Some Graph Transformations (1987) (4)
Cluster Algorithms for Discrete Models of Colloids with Bars (2011) (4)
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases (2019) (4)
Approximately Sampling Elements with Fixed Rank in Graded Posets (2016) (4)
Sampling and Counting 3-Orientations of Planar Triangulations (2016) (4)
Decomposition Methods and Sampling Circuits in the Cartesian Lattice (2001) (4)
Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions (1999) (3)
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions (2017) (3)
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 (2011) (3)
Annealing and tempering for sampling and counting (2007) (3)
Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk) (2017) (2)
Spanning tree methods for sampling graph partitions (2022) (2)
Phase Transitions in Sampling Algorithms and the Underlying Random Structures (2010) (2)
Statistical Physics and Algorithms (Invited Talk) (2020) (2)
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ferroelectric and Antiferroelectric Phases (2019) (1)
Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems (2022) (1)
Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan (2022) (1)
A stochastic approach to shortcut bridging in programmable matter (2018) (1)
Socioeconomic Clustering and Racial Segregation on Lattices with Heterogeneous Sites (2021) (1)
Algorithms to approximately count and sample conforming colorings of graphs (2013) (1)
Self-Assembly and Convergence Rates of Heterogeneous Reversible Growth Processes ( Extended Abstract ) (2009) (1)
Phototactic supersmarticles (2018) (0)
CS 6550 – Design and Analysis of Algorithms Professor : (2007) (0)
Mathematically Quantifying Gerrymandering and the Non-responsiveness of the 2021 Georgia Congressional Districting Plan (2022) (0)
Statistical Physics and Algorithms (2020) (0)
22nd annual ACM-SIAM Symposium on Discrete Algorithms 2011 : San Francisco, California, USA 23-25 January 2011 (2011) (0)
Emergent Phenomena in Random Structures and Algorithms (2018) (0)
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours (2007) (0)
Hubs and Authorities in a Hyperlinked Environment 1 Searching the World Wide Web (0)
Analysis of Markov chains and algorithms for ad-hoc networks (2008) (0)
Markov chains for Self-assembly: How to create something out of (almost) nothing. (2011) (0)
Collective behavior of BOBbots, a robotic active matter system (2020) (0)
Sampling weighted perfect matchings on the square-octagon lattice (2017) (0)
Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)
Markov Chain Decompositionfor Convergence Rate AnalysisNeal Madras (0)
Foraging in Particle Systems via Self-Induced Phase Changes (2022) (0)
Foreword to the Special Issue on SODA’11 (2013) (0)
A Heterogeneous Schelling Model for Wealth Disparity and its Effect on Segregation (2021) (0)
Markov chain algorithms for problems from computer science and statistical physics (2011) (0)
PR ] 3 N ov 2 01 6 Phase Coexistence for the Hard-Core Model on Z 2 (2016) (0)
Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks (2023) (0)
SAMPLING AND COUNTING 3-ORIENTATIONS OF PLANAR (2016) (0)
Markov Chain Algorithms for Programmable Active Matter (2018) (0)
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices (2018) (0)
Simulated Tempering and Swapping on Mean-Field Models (2016) (0)

This paper list is powered by the following services:

Other Resources About Dana Randall

en.wikipedia.org

What Schools Are Affiliated With Dana Randall?

Dana Randall is affiliated with the following schools: