David Bruce Wilson

SIAM J. Discret. Math., 2017

Pfaffian Formulas for Spanning Tree Probabilities.

[BibT_eX]

[DOI]

Greta Panova

Comb. Probab. Comput., 2017

2016

The Looping Rate and Sandpile Density of Planar Graphs.

[BibT_eX]

[DOI]

Adrien Kassel

Am. Math. Mon., 2016

2014

Dyck tilings, increasing trees, descents, and inversions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

2013

The Min Mean-Weight Cycle in a Random Network.

[BibT_eX]

[DOI]

Claire Mathieu

Comb. Probab. Comput., 2013

A Forward-Backward Single-Source Shortest Paths Algorithm.

[BibT_eX]

[DOI]

Uri Zwick

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks.

[BibT_eX]

[DOI]

Omer Angel

Abraham D. Flaxman

Comb., 2012

2011

Double-Dimer Pairings and Skew Young Diagrams.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2009

Combinatorics of Tripartite Boundary Connections for Trees and Dimers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2007

Random-Turn Hex and Other Selection Games.

[BibT_eX]

[DOI]

Am. Math. Mon., 2007

2005

Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read.

[BibT_eX]

[DOI]

Itai Benjamini

Oded Schramm

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2002

On the critical exponents of random k-SAT.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

2001

The scaling window of the 2-SAT transition.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Diagonal Sums of Boxed Plane Partitions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

How to couple from the past using a read-once source of randomness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Trees and Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1999

Scaling limits for minimal and random spanning trees in two dimensions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1999

1998

How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph.

[BibT_eX]

[DOI]

J. Algorithms, 1998

1997

Determinant Algorithms for Random Planar Structures.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Beyond islands (extended abstract): runs in clone-probe matrices.

[BibT_eX]

[DOI]

David S. Greenberg

Cynthia A. Phillips

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Annotated bibliography of perfectly random sampling with Markov chains.

[BibT_eX]

[DOI]

Proceedings of the Microsurveys in Discrete Probability, 1997

1996

Exact sampling with coupled Markov chains and applications to statistical mechanics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Generating Random Spanning Trees More Quickly than the Cover Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover Time.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Improved Algorithms for Protein Motif Recognition.

[BibT_eX]

[DOI]

Bonnie Berger

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1992

Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract).

[BibT_eX]

[DOI]