Hash functions for priority queues

DOI10.1016/S0019-9958(84)80015-7zbMath0591.68093DBLPjournals/iandc/AjtaiFK84OpenAlexW2007683581WikidataQ61051136 ScholiaQ61051136MaRDI QIDQ3719870

János Komlós, Michael L. Fredman, Miklós Ajtai

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80015-7

zbMATH Keywords

rank functiondata structureperfect hashingcell probe computational modelcomplexity of priority queue operations

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items (10)

Trans-dichotomous algorithms for minimum spanning trees and shortest paths ⋮ A constant update time finger search tree ⋮ Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) ⋮ An algorithm for finding predecessors in integer sets ⋮ When can we sort in \(o(n\log n)\) time? ⋮ A lower bound for finding predecessors in Yao's cell probe model ⋮ On the cell probe complexity of polynomial evaluation ⋮ Fusion trees can be implemented with \(AC^0\) instructions only ⋮ Surpassing the information theoretic bound with fusion trees ⋮ Optimal bounds for the predecessor problem and related problems

This page was built for publication: Hash functions for priority queues