Approximate Indexed Lists

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 256-276

  Andersson, Arne ^a   Petersson, Ola ^b  

^a LUND UNIVERSITY   (Sweden)

^b Prodigy   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000963030     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0951     Document Type: Article

References (14)

1. A. Andersson, Improving partial rebuilding by using simple balance criteria, in "Proc. Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 382, pp. 393-402, Springer-Verlag, Berlin/New York, 1989.
2. T. Biedl and G. Kant, A better heuristic for orthogonal graph drawing, in "Proc. 2nd European Symp. on Algorithms," Lecture Notes in Computer Science, Vol. 855, pp. 24-35, Springer-Verlag, Berlin/New York, 1994.
3. P. Diaconis and R. L. Graham, Spearman's footrule as a measure of disarray, J. Roy. Statist. Soc. Ser. B, 39 (1977), 262-268.
4. P. F. Dietz, Maintaining order in a linked list, in "Proc. 14th ACM Symp. on the Theory of Computing," pp. 122-127, 1982.
5. P. F. Dietz, Optimal algorithms for list indexing and subset rank, in "Proc. 1989 Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 382, pp. 131-142, Springer-Verlag, Berlin/New York, 1994.
6. P. F. Dietz, J. I. Seiferas, and J. Zhang, A tight lower bound for on-line monotonie list labeling," in "Proc. 4th Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 824, pp. 131-142, Springer-Verlag, Berlin/New York, 1994.
7. P. F. Dietz and D. D. Sleator, Two algorithms for maintaining order in a list, J. Comput. System Sci., to appear. (Preliminary version in "Proc. 19th ACM Symp. on the Theory of Computing," pp. 365-372, 1987.)
8. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, Making data structures persistent, J. Comput. System Sci. 38 (1989), 86-124.
9. P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), 99-127.
10. M. L. Fredman and M. E. Saks, The cell probe complexity of dynamic data structures, in "Proc. 21st ACM Symp. on the Theory of Computing," pp. 345-354, 1989.
11. A. Itai, A. G. Konheim, and M. Rodeh, A sparse table implementation of priority queues, in "Proc. 8th Internat. Colloquium on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 115, pp. 417-431, Springer-Verlag, Berlin/New York, 1981.
12. D. E. Knuth, "The Art of Computer Programming," Vol. 3, "Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
13. Y. Matias, J. S. Vitter, and N. E. Young, Approximate data structures with applications, in "Proc. 5th ACM-SIAM Symp. on Discrete Algorithms," pp. 187-194, 1994.
14. A. K. Tsakalidis, Maintaining order in a generalized linked list, Acta Inform. 21 (1984), 101-112.