James Gary Propp

According to our database1, James Gary Propp authored at least 29 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The Combinatorics of Frieze Patterns and Markoff Numbers.
Integers, 2020

Quantifying Noninvertibility in Discrete Dynamical Systems.
Electron. J. Comb., 2020

2017
Sorting via Chip-Firing.
Electron. J. Comb., 2017

2016
Noncrossing Partitions, Toggles, and Homomesies.
Electron. J. Comb., 2016

2015
Homomesy in Products of Two Chains.
Electron. J. Comb., 2015

2013
Real Analysis in Reverse.
Am. Math. Mon., 2013

2012
Local-to-Global Principles for the Hitting Sequence of a Rotor Walk.
Electron. J. Comb., 2012

2011
Tiling Lattices with Sublattices, I.
Discret. Comput. Geom., 2011

2009
Perfect Matchings for the Three-Term Gale-Robinson Sequences.
Electron. J. Comb., 2009

2007
Combinatorial Interpretations for Rank-Two Cluster Algebras of Affine Type.
Electron. J. Comb., 2007

2005
Lambda-determinants and domino-tilings.
Adv. Appl. Math., 2005

In search of Robbins stability.
Adv. Appl. Math., 2005

2003
Generalized domino-shuffling.
Theor. Comput. Sci., 2003

2002
Generating a Random Sink-free Orientation in Quadratic Time.
Electron. J. Comb., 2002

2001
A Reciprocity Theorem for Domino Tilings.
Electron. J. Comb., 2001

The Many Faces of Alternating-Sign Matrices.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
Three-player impartial games.
Theor. Comput. Sci., 2000

Deriving a Perfect Square: 10706.
Am. Math. Mon., 2000

An Application of Sperner's Theorem: 10679.
Am. Math. Mon., 2000

Trees and Matchings.
Electron. J. Comb., 2000

1999
Domino Tilings with Barriers.
J. Comb. Theory, Ser. A, 1999

1998
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph.
J. Algorithms, 1998

1997
Generating random elements of finite distributive lattices.
Electron. J. Comb., 1997

Coupling from the past: A user's guide.
Proceedings of the Microsurveys in Discrete Probability, 1997

1996
Exact sampling with coupled Markov chains and applications to statistical mechanics.
Random Struct. Algorithms, 1996

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.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
The fractional chromatic number of mycielski's graphs.
J. Graph Theory, 1995

1992
On Tensor Powers of Integer Programs.
SIAM J. Discret. Math., 1992

1989
Some variants of Ferrers diagrams.
J. Comb. Theory, Ser. A, 1989


  Loading...