Skip to main navigation Skip to search Skip to main content

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

  • University of North Texas
  • National Research Council of Italy

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)200-211
Number of pages12
JournalJournal of Parallel and Distributed Computing
Volume48
Issue number2
DOIs
StatePublished - Feb 1 1998
Externally publishedYes

ASJC Scopus Subject Areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'O(log logN) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube'. Together they form a unique fingerprint.

Cite this