Fully dynamic distributed search trees can be balanced in O(lg2 N) time

Author： Barillari F.   Nardelli E.   Pepe M.  

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.62, Iss.11, 2002-11, pp. : 1617-1628

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

Fully dynamic epoch time synchronisation method for distributed supply chain simulation

By Lee Seungho   Zhao Xiaobing   Shendarkar Ameya   Vasudevan Karthik   Son Young-Jun  

International Journal of Computer Applications in Technology, Vol. 31, Iss. 3-4, 2008-05 ,pp. : 249-262

Inderscience Publishers

Access to resources Recommend Favorite

On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time

By Na Joong Chae   Giancarlo Raffaele   Park Kunsoo  

Algorithmica, Vol. 48, Iss. 2, 2007-06 ,pp. : 173-186

Springer Publishing Company

Access to resources Recommend Favorite

Finding a Minimum-depth Embedding of a Planar Graph in O(n 4) Time

By Angelini Patrizio   Battista Giuseppe   Patrignani Maurizio  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 890-937

Springer Publishing Company

Access to resources Recommend Favorite

A Linear Time Algorithm for L(2,1)-Labeling of Trees

By Hasunuma Toru   Ishii Toshimasa   Ono Hirotaka   Uno Yushi  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 654-681

Springer Publishing Company

Access to resources Recommend Favorite

A fully dynamic algorithm for distributed shortest paths

By Cicerone S.   Di Stefano G.   Frigioni D.   Nanni U.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 83-102

Elsevier

Access to resources Recommend Favorite