scientific article
From MaRDI portal
Publication:2768341
zbMath0987.68023MaRDI QIDQ2768341
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
A unified access bound on comparison-based dynamic dictionaries ⋮ A Distribution-Sensitive Dictionary with Low Space Overhead ⋮ Skip-Splay: Toward Achieving the Unified Bound in the BST Model ⋮ Proximate point searching ⋮ The splay-list: a distribution-adaptive concurrent skip-list ⋮ The cost of offline binary search tree algorithms and the complexity of the request sequence ⋮ Confluently persistent tries for efficient version control ⋮ Belga B-trees ⋮ Multi-Finger Binary Search Trees ⋮ Parameterized analysis of paging and list update algorithms
This page was built for publication: