David Bruce Wilson

Publication Activity (10 Years)

Years Active: 1992-2017
Publications (10 Years): 2

Top Topics

Subjective Probabilities

Shortest Path Algorithm

Top Venues

Comb. Probab. Comput.

SIAM J. Discret. Math.

SIAM J. Comput.

Publications

Greta Panova, David Bruce Wilson
Pfaffian Formulas for Spanning Tree Probabilities. Comb. Probab. Comput. 26 (1) (2017)
Richard W. Kenyon, David Bruce Wilson
The Space of Circular Planar Electrical Networks. SIAM J. Discret. Math. 31 (1) (2017)
David Bruce Wilson, Uri Zwick
A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. 44 (3) (2015)
David Bruce Wilson, Uri Zwick
A forward-backward single-source shortest paths algorithm. CoRR (2014)
Yuval Peres, Oded Schramm, Scott Sheffield, David Bruce Wilson
Random-Turn Hex and Other Selection Games. Am. Math. Mon. 114 (5) (2007)
Itai Benjamini, Oded Schramm, David Bruce Wilson
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. STOC (2005)
Itai Benjamini, Oded Schramm, David Bruce Wilson
Balanced Boolean functions that can be evaluated so that every input bit is unlikely to be read CoRR (2004)
David Bruce Wilson
On the critical exponents of random k-SAT. Random Struct. Algorithms 21 (2) (2002)
David Bruce Wilson
Diagonal Sums of Boxed Plane Partitions. Electron. J. Comb. 8 (1) (2001)
Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson
The scaling window of the 2-SAT transition. Random Struct. Algorithms 18 (3) (2001)
David Bruce Wilson
How to couple from the past using a read-once source of randomness. Random Struct. Algorithms 16 (1) (2000)
Richard W. Kenyon, James Gary Propp, David Bruce Wilson
Trees and Matchings. Electron. J. Comb. 7 (2000)
Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson
Scaling limits for minimal and random spanning trees in two dimensions. Random Struct. Algorithms 15 (3-4) (1999)
James Gary Propp, David Bruce Wilson
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. J. Algorithms 27 (2) (1998)
David Bruce Wilson
Determinant Algorithms for Random Planar Structures. SODA (1997)
David Bruce Wilson, David S. Greenberg, Cynthia A. Phillips
Beyond islands (extended abstract): runs in clone-probe matrices. RECOMB (1997)
James Gary Propp, David Bruce Wilson
Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struct. Algorithms 9 (1-2) (1996)
David Bruce Wilson
Generating Random Spanning Trees More Quickly than the Cover Time. STOC (1996)
David Bruce Wilson, James Gary Propp
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. SODA (1996)
Bonnie Berger, David Bruce Wilson
Improved Algorithms for Protein Motif Recognition. SODA (1995)
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
Fast Exponentiation with Precomputation (Extended Abstract). EUROCRYPT (1992)
David Bruce Wilson
Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract). SPAA (1992)