| 2008 |
|---|
| 16 | EE | Persi Diaconis:
Shuffling cards, adding numbers, and symmetric functions.
SODA 2008: 560 |
| 2006 |
|---|
| 15 | EE | Persi Diaconis,
Nicholas Eriksson:
Markov bases for noncommutative Fourier analysis of ranked data.
J. Symb. Comput. 41(2): 182-195 (2006) |
| 2005 |
|---|
| 14 | | Stephen P. Boyd,
Persi Diaconis,
Pablo A. Parrilo,
Lin Xiao:
Symmetry Analysis of Reversible Markov Chains.
Internet Mathematics 2(1): (2005) |
| 2004 |
|---|
| 13 | EE | Xiang Yan,
Persi Diaconis,
Paat Rusmevichientong,
Benjamin Van Roy:
Solitaire: Man Versus Machine.
NIPS 2004 |
| 12 | EE | Persi Diaconis,
Alexander Gamburd:
Random Matrices, Magic Squares and Matching Polynomials.
Electr. J. Comb. 11(2): (2004) |
| 2003 |
|---|
| 11 | EE | Persi Diaconis:
Who cares about permanents?
SODA 2003: 708-708 |
| 2002 |
|---|
| 10 | EE | Daniel Bump,
Persi Diaconis:
Toeplitz Minors.
J. Comb. Theory, Ser. A 97(2): 252-271 (2002) |
| 2000 |
|---|
| 9 | EE | Persi Diaconis,
Steven N. Evans:
Immanants and Finite Point Processes.
J. Comb. Theory, Ser. A 91(1-2): 305-321 (2000) |
| 1998 |
|---|
| 8 | | Persi Diaconis,
Laurent Saloff-Coste:
What Do We Know about the Metropolis Algorithm?
J. Comput. Syst. Sci. 57(1): 20-36 (1998) |
| 1995 |
|---|
| 7 | EE | Persi Diaconis,
Laurent Saloff-Coste:
What do we know about the Metropolis algorithm?
STOC 1995: 112-129 |
| 6 | | Persi Diaconis,
Michael McGrath,
Jim Pitman:
Riffle Shuffles, Cycles, and Descents.
Combinatorica 15(1): 11-29 (1995) |
| 1992 |
|---|
| 5 | | Persi Diaconis,
James Allen Fill,
Jim Pitman:
Analysis of Top To Random Shuffles.
Combinatorics, Probability & Computing 1: 135-155 (1992) |
| 4 | EE | Persi Diaconis,
Ronald L. Graham:
Binomial coefficient codes over GF(2).
Discrete Mathematics 106-107: 181-188 (1992) |
| 3 | EE | Fan R. K. Chung,
Persi Diaconis,
Ronald L. Graham:
Universal cycles for combinatorial structures.
Discrete Mathematics 110(1-3): 43-59 (1992) |
| 1990 |
|---|
| 2 | | Persi Diaconis,
Ronald L. Graham,
John A. Morrison:
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.
Random Struct. Algorithms 1(1): 51-72 (1990) |
| 1980 |
|---|
| 1 | | Persi Diaconis:
Average Running Time of the Fast Fourier Transform.
J. Algorithms 1(2): 187-208 (1980) |
