New Tight Bounds on Uniquely Represented Dictionaries

DOI10.1137/S0097539792241102MaRDI QIDQ4857597zbMATH OpenOpenAlexFDO

Authors

Publication date 16 April 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792241102

zbMATH Keywords

dictionary problembinary search tree

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 4155862
• scientific article; zbMATH DE number 4062630
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 2038723
• A tradeoff between search and update time for the implicit dictionary problem

Cited in

(4)

• Bounded ordered dictionaries in O(log log N) time and O(n) space
• scientific article; zbMATH DE number 4155862 (Why is no real title available?)
• Representation transformations of ordered lists
• A unified access bound on comparison-based dynamic dictionaries

This page was built for publication: New Tight Bounds on Uniquely Represented Dictionaries

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