O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.48, Iss.2, 1998-02, pp. : 200-211

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

On-Line Construction of Two-Dimensional Suffix Trees in O(n² 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

O(log*n) algorithms on a Sum-CRCW PRAM

By Eisenstat S.

Computing, Vol. 79, Iss. 1, 2007-02 ,pp. : 93-97

Springer Publishing Company

Access to resources Recommend Favorite

Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

By Vilím Petr Barták Roman Čepek Ondřej

Constraints, Vol. 10, Iss. 4, 2005-10 ,pp. : 403-425

Springer Publishing Company

Access to resources Recommend Favorite

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

Addition in log 2 n + O(1) steps on average A simple analysis

By Beigel R. Gasarch B. Ming L. Louxin Z.

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 245-248

Elsevier

Access to resources Recommend Favorite