Leader election in d-dimensional CA in time diam log(diam)

Author： Stratmann M.   Worsch T.  

Publisher： Elsevier

ISSN： 0167-739X

Source： Future Generation Computer Systems, Vol.18, Iss.7, 2002-08, pp. : 939-950

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Perfect Information Leader Election in log* n+O(1) Rounds

By Russell A.   Zuckerman D.  

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 612-626

Academic Press

Access to resources Recommend Favorite

Generating well-shaped d-dimensional Delaunay Meshes

By Li X.-Y.  

Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. : 145-165

Elsevier

Access to resources Recommend Favorite

Randomized leader election

By Ramanathan Murali   Ferreira Ronaldo   Jagannathan Suresh   Grama Ananth   Szpankowski Wojciech  

Distributed Computing, Vol. 19, Iss. 5-6, 2007-04 ,pp. : 403-418

Springer Publishing Company

Access to resources Recommend Favorite

Formal verification of a leader election protocol in process algebra

By Fredlund L.-a.   Groote J.F.   Korver H.  

Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. : 459-486

Elsevier

Access to resources Recommend Favorite

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

By Antonoiu G.   Srimani P.K.  

Journal of Parallel and Distributed Computing, Vol. 34, Iss. 2, 1996-05 ,pp. : 227-232

Academic Press

Access to resources Recommend Favorite