Implicit dictionaries with O(1) modifications per update and fast search
From MaRDI portal
Publication:3581495
DOI10.1145/1109557.1109603zbMath1192.68176OpenAlexW4230719382MaRDI QIDQ3581495
Gianni Franceschini, J. Ian Munro
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109603
Related Items (9)
Optimal In-place Algorithms for Basic Graph Problems ⋮ Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ A Distribution-Sensitive Dictionary with Low Space Overhead ⋮ A distribution-sensitive dictionary with low space overhead ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Minimal indices for predecessor search ⋮ Computing (and Life) Is All about Tradeoffs ⋮ A Survey on Priority Queues
This page was built for publication: Implicit dictionaries with O(1) modifications per update and fast search