The number of tests required to search an unordered table

DOI10.1016/S0020-0190(03)00260-6zbMath1175.68575OpenAlexW2020674975MaRDI QIDQ1014399

Michael L. Fredman

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00260-6

zbMATH Keywords

computational complexityanalysis of algorithmsdata structuressearching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Cites Work

• The pairing heap: A new form of self-adjusting heap
• A tradeoff between search and update time for the implicit dictionary problem
• Efficient searching using partial ordering
• On the efficiency of pairing heaps and related data structures
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: The number of tests required to search an unordered table