Fetching the paper…
Reading the bibliography…
LCLs or locally checkable labelling problems (e.g.
Application of recursive arithmetic to the problem of circuit synthesis
Alonzo Church · 1957
Earlier work this paper cites.
Proving theorems by pattern recognition – II
Hao Wang · 1961
Earlier work this paper cites.
Theory of Self-Reproducing Automata
John von Neumann · 1966
Earlier work this paper cites.
The fantastic combinations of John Conway’s new solitaire game ‘life’
Martin Gardner · 1970
Earlier work this paper cites.
Introduction to and survey of cellular automata or polyautomata theory
Alvy Ray Smith, III · 1976
Earlier work this paper cites.
Design and synthesis of synchronization skeletons using branching time temporal logic
Edmund M. Clarke and E. Allen Emerson · 1982
Earlier work this paper cites.
Synthesis of communicating processes from temporal logic specifications
Zohar Manna and Pierre Wolper · 1984
Earlier work this paper cites.
Deterministic coin tossing with applications to optimal parallel list ranking
Richard Cole and Uzi Vishkin · 1986
Earlier work this paper cites.
Tilings and Patterns
Branko Grünbaum and G. C. Shephard · 1987
Earlier work this paper cites.
Distributed reactive systems are hard to synthesize
Amir Pnueli and Roni Rosner · 1990
Earlier work this paper cites.
Locality in distributed graph algorithms
Nathan Linial · 1992
Earlier work this paper cites.
What can be computed locally?
Moni Naor and Larry Stockmeyer · 1995
Earlier work this paper cites.
The local nature of Δ \Delta -colouring and its algorithmic applications
Alessandro Panconesi and Aravind Srinivasan · 1995
Earlier work this paper cites.
Algorithmic Self-Assembly of DNA
Erik Winfree · 1998
Earlier work this paper cites.
Dancing links
Donald E. Knuth · 2000
Earlier work this paper cites.
Distributed Computing: A Locality-Sensitive Approach
David Peleg · 2000
Earlier work this paper cites.
Synthesis of concurrent programs for an atomic read/write model of computation
Paul C. Attie and E. Allen Emerson · 2001
Cited alongside, same era.
Synthesizing distributed systems
Orna Kupferman and Moshe Y. Vardi · 2001
Cited alongside, same era.
Some simple distributed algorithms for sparse networks
Alessandro Panconesi and Romeo Rizzi · 2001
Cited alongside, same era.
A New Kind of Science
Stephen Wolfram · 2002
Cited alongside, same era.
Automatic discovery of mutual exclusion algorithms
Yoah Bar-David and Gadi Taubenfeld · 2003
Cited alongside, same era.
A survey on cellular automata
Niloy Ganguly, Biplab K. Sikdar, Andreas Deutsch, Geoffrey Canright, and P. Pal Chaudhuri · 2003
Cited alongside, same era.
Distributed ( Δ + 1 ) (\Delta+1) -coloring in linear (in Δ \Delta ) time
Leonid Barenboim, Michael Elkin, and Fabian Kuhn · 2014
Later among the works it cites.
Large cuts with local algorithms on triangle-free graphs, February 2014
Juho Hirvonen, Joel Rybicki, Stefan Schmid, and Jukka Suomela · 2014
Later among the works it cites.
Alexander E. Holroyd, Oded Schramm, and David B. Wilson · 2014
Later among the works it cites.
An introduction to tile-based self-assembly and a survey of recent results
Matthew J. Patitz · 2014
Later among the works it cites.
Intrinsic universality and the computational power of self-assembly
Damien Woods · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jarkko Kari · 2004
Cited alongside, same era.
Uniform distributed synthesis
Bernd Finkbeiner and Sven Schewe · 2005
Cited alongside, same era.
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, and Roger Wattenhofer · 2005
Cited alongside, same era.
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Beat Gfeller and Elias Vicari · 2007
Cited alongside, same era.
A limit to the power of multiple nucleation in self-assembly
Aaron D. Sterling · 2008
Cited alongside, same era.
From Church and prior to PSL
Moshe Y. Vardi · 2008
Cited alongside, same era.
Deterministic ( Δ + 1 ) (\Delta+1) -coloring in sublinear (in Δ \Delta ) time in static, dynamic and faulty networks
Leonid Barenboim · 2015
Later among the works it cites.
Synchronous counting and computational algorithm design
Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, and Siert Wieringa · 2015
Later among the works it cites.
Exact bounds for distributed graph colouring
Joel Rybicki and Jukka Suomela · 2015
Later among the works it cites.
Leonid Barenboim, Michael Elkin, and Tzalik Maimon · 2016
Later among the works it cites.
Synthesis of self-stabilising and Byzantine-resilient distributed systems
Roderick Bloem, Nicolas Braud-Santoni, and Swen Jacobs · 2016
Later among the works it cites.
A Lower Bound for the Distributed Lovász Local Lemma
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto · 2016
Later among the works it cites.
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie · 2016
Later among the works it cites.
Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski · 2016
Later among the works it cites.
Local Computation: Lower and Upper Bounds
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer · 2016
Later among the works it cites.
A time hierarchy theorem for the LOCAL model, 2017
Yi-Jun Chang and Seth Pettie · 2017
Closest in time.
Distributed degree splitting, edge coloring, and orientations
Mohsen Ghaffari and Hsin-Hao Su · 2017
Closest in time.