A unifying look at data structures

Communications of the ACM

Volumn 23, Issue 4, 1980, Pages 229-239

  Vuillemin, Jean ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

analysis of algorithms; data structures; dictionaries; linear list; merge; permutations; search

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0019002089     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/358841.358852     Document Type: Article

References (16)

1. Aho, A.V., Hopcroft, J., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Brown, M.R., and Tarjan, R.E. A representation for linear lists with movable fingers. In Proc. 10th Ann. ACM Symp. Theory of Comptg., 1978, pp. 19-29.
3. Comtet, L. Advanced Combinatorics. D. Reided Pub. Co., Boston, Mass., 1974.
4. Burge, W.H. An analysis of a tree sorting method and some properties of a set of trees. In Proc. 1st USA-Japan Comptr. Conf., 1972, pp. 372-378.
5. Flajolet, P., Francon, J., Viennot, G., and Vuillemin, J. Algorithmique et combinatoire des arbres et permutations. To appear (1981).
6. Flajolet, P., Francon, J., and Vuillemin, J. Sequence of operation analysis for dynamic data structures. J. Algorithms. To appear (1980).
7. Foata, D., and Schutzenberger, M.P. Theorie géométrigue des polynomes Euleriens. Lecture Notes in Mathematics, No. 138, Springer-Verlag, Berlin, 1970.
8. Foata, D., and Strehl, V. Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers. Math. Zamet. 137 (1974), 256-264.
9. Francon, J. Arbres binaires de recherche, propriétés combinatoires et applications. RAIRO Informatique Théorique 10 (1976), 35-50.
10. Francon, J., Viennot, G., and Vuillemin, J. Description et analyse d'une representation performante des files de priorité. Rep. 12, Lab. d’Informatique, Orsay, France; also in Proc. 19th Ann. ACM Symp. on Foundations of Comptr. Sci., 1978, pp. 1-7.
11. Guibas, L., Creight, E.M.M., Plass, M.F., and Roberts, J.R. A new representation for linear lists. In Proc. 9th Ann. ACM Symp. Theory of Comptg., 1977, pp. 49-60.
12. Hoare, C.A.R. Quicksort. Comptr. J. 5, 1 (1962), 10-15.
13. Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
14. Sedgewick, R. Quicksort. Rep. STAN-CS-75-492, Dept. Comptr. Sci., Stanford Univ., Stanford, Calif, May 1975.
15. Stephenson, C.J. A method for constructing binary search trees by making insertions at the root. Rep. RC 6298, IBM Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y., 1976.
16. Viennot, G. Quelques algorithmes de permutations. Astérique 38-39, Societé Mathématique de France, 1976, pp. 275-293.