5 citations · 15 across the 23 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DC2011
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
Florent Becker, Adrian Kosowski, Nicolas Nisse +2
In this work we study the computational power of graph-based models of distributed computing in which each node additionally has access to a global whiteboard. A node can read the…
cs.FL2011
Traced communication complexity of cellular automata
Eric Goles, Pierre Guillon, Ivan Rapaport
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of…