The number of tests required to search an unordered table

DOI10.1016/S0020-0190(03)00260-6MaRDI QIDQ1014399zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmscomputational complexitydata structuressearching

Mathematics Subject Classification ID

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

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014399)