| 2005 |
| 16 | EE | 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: 244-250 |
| 2004 |
| 15 | EE | 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 math.PR/0410282: (2004) |
| 2002 |
| 14 | EE | David Bruce Wilson:
On the critical exponents of random k-SAT.
Random Struct. Algorithms 21(2): 182-195 (2002) |
| 2001 |
| 13 | EE | David Bruce Wilson:
Diagonal Sums of Boxed Plane Partitions.
Electr. J. Comb. 8(1): (2001) |
| 12 | | 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): 201-256 (2001) |
| 2000 |
| 11 | EE | Richard Kenyon,
James Gary Propp,
David Bruce Wilson:
Trees and Matchings.
Electr. J. Comb. 7: (2000) |
| 1999 |
| 10 | | 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): 319-367 (1999) |
| 1998 |
| 9 | | 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): 170-217 (1998) |
| 1997 |
| 8 | EE | David Bruce Wilson,
David S. Greenberg,
Cynthia A. Phillips:
Beyond islands (extended abstract): runs in clone-probe matrices.
RECOMB 1997: 320-329 |
| 7 | | David Bruce Wilson:
Determinant Algorithms for Random Planar Structures.
SODA 1997: 258-267 |
| 1996 |
| 6 | | 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: 448-457 |
| 5 | EE | David Bruce Wilson:
Generating Random Spanning Trees More Quickly than the Cover Time.
STOC 1996: 296-303 |
| 4 | | James Gary Propp,
David Bruce Wilson:
Exact sampling with coupled Markov chains and applications to statistical mechanics.
Random Struct. Algorithms 9(1-2): 223-252 (1996) |
| 1995 |
| 3 | | Bonnie Berger,
David Bruce Wilson:
Improved Algorithms for Protein Motif Recognition.
SODA 1995: 58-67 |
| 1992 |
| 2 | EE | Ernest F. Brickell,
Daniel M. Gordon,
Kevin S. McCurley,
David Bruce Wilson:
Fast Exponentiation with Precomputation (Extended Abstract).
EUROCRYPT 1992: 200-207 |
| 1 | EE | David Bruce Wilson:
Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract).
SPAA 1992: 264-270 |