By Topic

Computing with snakes in directed networks of automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Even, Shimon ; Bellcore, Morristown, NJ, USA ; Litman, A. ; Winkler, P.

Directed, strongly connected networks of finite-state automata, of bounded in- and outdegree but unknown topology and unbounded size n , are considered. Protocols that are quadratic or linear in n and accomplish the following tasks are provided: waking up and reporting when done, constructing smart spanning trees out from the root and in to the root, conducting breadth-first and depth-first searches, sending a message from the endpoint of a (directed) edge to its startpoint, running a slow clock, and solving the firing squad synchronization problem. The protocols are highly parallel and entail the use of sequences of signals called `snakes`'. All the tasks are accomplished in less time than is possible with any previously known techniques

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990