Sorting and searching revisted

DOI10.1007/3-540-61422-2_131zbMath1502.68106OpenAlexW1497730118MaRDI QIDQ5054812

No author found.

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_131

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds for sorting integers on random access machines
• Preserving order in a forest in less than logarithmic time and linear space
• Universal classes of hash functions
• Surpassing the information theoretic bound with fusion trees
• Lower bounds for union-split-find related problems on random access machines
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Design and implementation of an efficient priority queue
• Optimal bounds for decision problems on the CRCW PRAM

This page was built for publication: Sorting and searching revisted