39 citations · 89 across the 17 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2006
Self-stabilization of Circular Arrays of Automata
Leonid A. Levin
[Gacs, Kurdiumov, Levin, 78] proposed simple one-dimensional cellular automata with 2 states. In an infinite array they are self-stabilizing: if all but a finite minority of automa…
cs.DC2005
Flat Holonomies on Automata Networks
Gene Itkis, Leonid A. Levin
We consider asynchronous networks of identical finite (independent of network's size or topology) automata. Our automata drive any network from any initial configuration of states,…
cs.DC2000★ 4 cited
Byzantine Agreement with Faulty Majority using Bounded Broadcast
Jeffrey Considine, Leonid A. Levin, David Metcalf
Byzantine Agreement introduced in [Pease, Shostak, Lamport, 80] is a widely used building block of reliable distributed protocols. It simulates broadcast despite the presence of fa…