On-the-fly optimization of data structures
From MaRDI portal
Publication:3668834
DOI10.1145/182.358442zbMath0519.68025OpenAlexW1973610879MaRDI QIDQ3668834
Publication date: 1983
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/182.358442
Related Items
Parallel dictionaries with local rules on AVL and brother trees, Efficient rebalancing of chromatic search trees, Amortization results for chromatic search trees, with an application to priority queues, Relaxed balance through standard rotations, Relaxed avl trees, main-memory databases and concurrency, Skip trees, an alternative data structure to skip lists in a concurrent approach, AVL trees with relaxed balance, Efficient rebalancing of chromatic search trees, VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
