Sorting and searching revisted
From MaRDI portal
Recommendations
Cites work
- Design and implementation of an efficient priority queue
- scientific article; zbMATH DE number 3757704 (Why is no real title available?)
- scientific article; zbMATH DE number 1263219 (Why is no real title available?)
- scientific article; zbMATH DE number 1306898 (Why is no real title available?)
- scientific article; zbMATH DE number 742994 (Why is no real title available?)
- scientific article; zbMATH DE number 767429 (Why is no real title available?)
- scientific article; zbMATH DE number 871900 (Why is no real title available?)
- Lower bounds for union-split-find related problems on random access machines
- Optimal bounds for decision problems on the CRCW PRAM
- Preserving order in a forest in less than logarithmic time and linear space
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Surpassing the information theoretic bound with fusion trees
- Universal classes of hash functions
- Upper bounds for sorting integers on random access machines
Cited in
(5)
This page was built for publication: Sorting and searching revisted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054812)