Finitary Coloring

Independent and stationary sequences of random variables

I. A. Ibragimov and Y. V. Linnik · 1971

Earlier work this paper cites.

Exactly solved models in statistical mechanics

R. J. Baxter · 1982

Earlier work this paper cites.

Ergodic theory

I. P. Cornfeld, S. V. Fomin, and Y. G. Sinaĭ · 1982

Earlier work this paper cites.

Families of finite sets in which no set is covered by the union of

P. Erdős, P. Frankl, and Z. Füredi · 1985

Earlier work this paper cites.

Deterministic coin tossing with applications to optimal parallel list ranking

R. Cole and U. Vishkin · 1986

Earlier work this paper cites.

Distributive graph algorithms – global solutions from local data

N. Linial · 1987

Earlier work this paper cites.

Parallel symmetry-breaking in sparse graphs

A. V. Goldberg, S. A. Plotkin, and G. E. Shannon · 1988

Cited alongside, same era.

An algebraic construction of a class of one-dependent processes

J. Aaronson, D. Gilat, M. Keane, and V. de Valk · 1989

Cited alongside, same era.

A lower bound on probabilistic algorithms for distributive ring coloring

M. Naor · 1991

Cited alongside, same era.

Locality in distributed graph algorithms

N. Linial · 1992

Cited alongside, same era.

Group-invariant percolation on graphs

I. Benjamini, R. Lyons, Y. Peres, and O. Schramm · 1999

Cited alongside, same era.

Percolation

G. Grimmett · 1999

Cited alongside, same era.

On homomorphisms from the Hamming cube to

D. Galvin · 2003

Later among the works it cites.

Convexity and optimization in Banach spaces

V. Barbu and T. Precupanu · 2012

Later among the works it cites.

A note on general sliding window processes

N. Alon and O. N. Feldheim · 2014

Closest in time.

Finitely dependent coloring

Original

A. E. Holroyd and T. M. Liggett · 2014

Closest in time.

One-dependent coloring by finitary factors

Original

A. E. Holroyd · 2014

Closest in time.

Symmetric 1-dependent colorings of the integers

Original

A. E. Holroyd and T. M. Liggett · 2015