Approximate Indexed Lists
- 1 November 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 29 (2) , 256-276
- https://doi.org/10.1006/jagm.1998.0951
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A better heuristic for orthogonal graph drawingsComputational Geometry, 1998
- Making data structures persistentJournal of Computer and System Sciences, 1989
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- Maintaining order in a generalized linked listActa Informatica, 1984
- Maintaining order in a linked listPublished by Association for Computing Machinery (ACM) ,1982
- Spearman's Footrule as a Measure of DisarrayJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976