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

ISSN： 0022-0000

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

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

A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

By Gupta S.S. Sinha B.P.

Journal of Parallel and Distributed Computing, Vol. 56, Iss. 2, 1999-02 ,pp. : 144-155

Academic Press

Access to resources Recommend Favorite

A Unified Formulation for Massively Parallel Rigid Multibody Dynamics of O(log₂ n) Computational Complexity

By Jaramillo-Botero A. Lorente A.C.I.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 6, 2002-06 ,pp. : 1001-1020

Academic Press

Access to resources Recommend Favorite

Finding All Isolated Zeros of Polynomial Systems inCⁿvi a Stable Mixed Volumes

By Gao T. Li T.Y. Wang X.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 187-211

Academic Press

Access to resources Recommend Favorite

Weak Wu Stratification in Rⁿ

By Richardson D.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 213-223

Academic Press

Access to resources Recommend Favorite

Curves of Genus 2 with (N, N) Decomposable Jacobians

By Shaska T.

Journal of Symbolic Computation, Vol. 31, Iss. 5, 2001-05 ,pp. : 603-617

Academic Press

Access to resources Recommend Favorite