The number of tests required to search an unordered table

Authors:
Michael L. Fredman
Affiliations:
Department of Computer Science, Rutgers University, New Brunswick, NJ
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 0

The pairing heap: a new form of self-adjusting heap

Algorithmica
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A tradeoff between search and update time for the implicit dictionary problem

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On the efficiency of pairing heaps and related data structures

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.89

Visualization

Abstract