11.3 Original Research Papers and Survey Articles

1.

G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Soviet Mathematics Monthly, Volume 3, pp.1259-1263, 1962.

2.

R. Bayer. Symmetric binary B-trees: Data Structures and maintenance algorithms, Acta Informatica, Volume 1, pp.290-306, 1972.

3.

R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, Volume 1, Number 3, pp. 173-189, 1972.

4.

Richard Bellman. On a routing problem. Quarterly of Applied Mathematics. Volume 16, Number 1, pp. 87-90, 1958.

5.

Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L Rivest, and Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, Volume 7, Number 4, pp.448-461, 1973.

6.

Mark R. Brown. Implementation and analysis of binomial queue algorithms. SIAM Journal on Computing, Volume 7, Number 3, pp. 298-319, 1978.

7.

Alan Cobham. The intrinsic computational difficulty of functions. In Proceedings of the 1964 Congress for Logic, Methodology, and the Philosophy of Science, pages 24-30, North-Holland, 1964.

8.

D. Comer. The ubiquitous B-tree. ACM Computing Surveys, Volume 11, Number 2, pp 121-137, 1979.

9.

Stephen Cook. The complexity of theorem proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.

10.

E.W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, Volume 1, pp 269-271, 1959.

11.

Jack Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, Volume 17, pp 449-467, 1965.

12.

Robert W Floyd. Algorithm 97 (Shortest Path). Communications of the ACM, Volume 5, Number 6, pp. 345, 1962.

13.

Robert W. Floyd. Algorithm 245 (TreeSort). Communications of the ACM, Volume 7, pp.701, 1964.

14.

Michael L. Fredman and Robert E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, Volume 34, Number 3, pp. 596-615, 1987.

15.

C.A.R. Hoare. Algorithm 63 (Partition) and Algorithm 65 (find). Communications of the ACM, Volume 4, Number 7, pp 321-322, 1961.

16.

C.A.R. Hoare. Quicksort. The Computer Journal, Volume 5, Number 1, pp.10-15, 1962.

17.

John E Hopcroft and Robert E. Tarjan. Efficient algorithms for graph manipulation. Communications of the ACM, Volume 16, Number 6 pp.372-378, 1973.

18.

David A Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the IRE Volume 40, Number 9, pp. 1098-1101, 1952.

19.

Richard M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations. pages 85-103, Plenum Press, 1972.

20.

J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, Volume 7, pp 48-50, 1956.

21.

R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, Volume 36, pp.1389-1401, 1957.

22.

William Pugh. Skip Lists: A probabilistic alternative to balanced trees. Communications of the ACM, Volume 33, Number 6, pp. 668-676, 1990.

23.

Robert Sedgewick. Implementing quicksort programs. Communications of the ACM, Volume 21, Number 10, pp.847-857, 1978.

24.

Daniel D Sleator and Robert E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, Volume 32, Number 3, pp 652-686, 1985.

25.

Robert E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, Volume 1, Number 2, pp.146-160, 1972.

26.

Robert E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, Volume 6, Number 2, pp.306-318, 1985.

27.

Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, Volume 21, Number 4, pp.309-315, 1978.

28.

Stephen Warshall. A theorem on boolean matrices. Journal of the ACM, Volume 9, Number 1, pp.11-12, 1962.

29.

J.W.J. Williams. Algorithm 232 (Heapsort). Communications of the ACM, Volume 7, pp.347-348, 1964.