| 2003 |
|---|
| 13 | EE | James Gary Propp:
Generalized domino-shuffling.
Theor. Comput. Sci. 2-3(303): 267-301 (2003) |
| 2002 |
|---|
| 12 | EE | Henry Cohn,
Robin Pemantle,
James Gary Propp:
Generating a Random Sink-free Orientation in Quadratic Time.
Electr. J. Comb. 9(1): (2002) |
| 2001 |
|---|
| 11 | EE | James Gary Propp:
The Many Faces of Alternating-Sign Matrices.
DM-CCG 2001: 43-58 |
| 10 | EE | James Gary Propp:
A Reciprocity Theorem for Domino Tilings.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 9 | EE | Richard Kenyon,
James Gary Propp,
David Bruce Wilson:
Trees and Matchings.
Electr. J. Comb. 7: (2000) |
| 8 | EE | James Gary Propp:
Three-player impartial games.
Theor. Comput. Sci. 233(1-2): 263-278 (2000) |
| 1999 |
|---|
| 7 | EE | James Gary Propp,
Richard Stanley:
Domino Tilings with Barriers.
J. Comb. Theory, Ser. A 87(2): 347-356 (1999) |
| 1998 |
|---|
| 6 | | 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 |
|---|
| 5 | EE | James Gary Propp:
Generating random elements of finite distributive lattices.
Electr. J. Comb. 4(2): (1997) |
| 1996 |
|---|
| 4 | | 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 |
| 3 | | 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) |
| 1992 |
|---|
| 2 | | Robin Pemantle,
James Gary Propp,
Daniel Ullman:
On Tensor Powers of Integer Programs.
SIAM J. Discrete Math. 5(1): 127-143 (1992) |
| 1989 |
|---|
| 1 | EE | James Gary Propp:
Some variants of Ferrers diagrams.
J. Comb. Theory, Ser. A 52(1): 98-128 (1989) |
