Fast Exponentiation with Precomputation (Extended Abstract). - Ernest F. Brickell; Daniel M. Gordon; Kevin S. McCurley; David Bruce Wilson (EUROCRYPT, 1992)

Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract). - David Bruce Wilson (SPAA, 1992)

Improved Algorithms for Protein Motif Recognition. - Bonnie Berger; David Bruce Wilson (SODA, 1995)

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. - David Bruce Wilson; James Gary Propp (SODA, 1996)

Generating Random Spanning Trees More Quickly than the Cover Time. - David Bruce Wilson (STOC, 1996)

Exact sampling with coupled Markov chains and applications to statistical mechanics. - James Gary Propp; David Bruce Wilson (Random Struct. Algorithms, 1996)

Annotated bibliography of perfectly random sampling with Markov chains. - David B. Wilson 002 (Microsurveys in Discrete Probability, 1997)

Beyond islands (extended abstract): runs in clone-probe matrices. - David Bruce Wilson; David S. Greenberg; Cynthia A. Phillips (RECOMB, 1997)

Determinant Algorithms for Random Planar Structures. - David Bruce Wilson (SODA, 1997)

How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. - James Gary Propp; David Bruce Wilson (J. Algorithms, 1998)

Scaling limits for minimal and random spanning trees in two dimensions. - Michael Aizenman; Almut Burchard; Charles M. Newman; David Bruce Wilson (Random Struct. Algorithms, 1999)

Trees and Matchings. - Richard W. Kenyon; James Gary Propp; David Bruce Wilson (Electron. J. Comb., 2000)

How to couple from the past using a read-once source of randomness. - David Bruce Wilson (Random Struct. Algorithms, 2000)

Diagonal Sums of Boxed Plane Partitions. - David Bruce Wilson (Electron. J. Comb., 2001)

The scaling window of the 2-SAT transition. - Béla Bollobás; Christian Borgs; Jennifer T. Chayes; Jeong Han Kim; David Bruce Wilson (Random Struct. Algorithms, 2001)

On the critical exponents of random k-SAT. - David Bruce Wilson (Random Struct. Algorithms, 2002)

Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. - Itai Benjamini; Oded Schramm; David Bruce Wilson (STOC, 2005)

Random-Turn Hex and Other Selection Games. - Yuval Peres; Oded Schramm; Scott Sheffield; David Bruce Wilson (Am. Math. Mon., 2007)

Combinatorics of Tripartite Boundary Connections for Trees and Dimers. - Richard W. Kenyon; David B. Wilson 002 (Electron. J. Comb., 2009)

Double-Dimer Pairings and Skew Young Diagrams. - Richard W. Kenyon; David B. Wilson 002 (Electron. J. Comb., 2011)

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. - Omer Angel; Abraham D. Flaxman; David B. Wilson 002 (Comb., 2012)

The Min Mean-Weight Cycle in a Random Network. - Claire Mathieu; David B. Wilson 002 (Comb. Probab. Comput., 2013)

Dyck tilings, increasing trees, descents, and inversions. - Jang Soo Kim; Karola Mészáros; Greta Panova; David B. Wilson 002 (J. Comb. Theory A, 2014)

A Forward-Backward Single-Source Shortest Paths Algorithm. - David Bruce Wilson; Uri Zwick (SIAM J. Comput., 2015)

The Looping Rate and Sandpile Density of Planar Graphs. - Adrien Kassel; David B. Wilson 002 (Am. Math. Mon., 2016)

Pfaffian Formulas for Spanning Tree Probabilities. - Greta Panova; David Bruce Wilson (Comb. Probab. Comput., 2017)

The Space of Circular Planar Electrical Networks. - Richard W. Kenyon; David Bruce Wilson (SIAM J. Discret. Math., 2017)