Data Structures and Algorithms

From the Publisher: This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal.

[1]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[4]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[5]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[6]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[7]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[8]  David J. Farber,et al.  SNOBOL , A String Manipulation Language , 1964, JACM.

[9]  Kenneth C. Knowlton,et al.  A fast storage allocator , 1965, CACM.

[10]  Jean E. Sammet,et al.  Programming languages - history and fundamentals , 1969, Prentice-Hall series in automatic computation.

[11]  W. Donald Frazer,et al.  Samplesort: A Sampling Approach to Minimal Storage Tree Sorting , 1970, JACM.

[12]  R. Bayer,et al.  Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[13]  Vincent Y. Lum,et al.  Multi-attribute retrieval with combined indexes , 1970, Commun. ACM.

[14]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[15]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .

[16]  Donald L. Shell.  Optimizing the polyphase sort , 1971, CACM.

[17]  Edward M. Reingold,et al.  On the Optimality of Some Set Algorithms , 1972, JACM.

[18]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[19]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[20]  Niklaus Wirth,et al.  Systematic Programming: An Introduction , 1974 .

[21]  John Michael Robson,et al.  Bounds for Some Functions Concerning Dynamic Storage Allocation , 1974, JACM.

[22]  John E. Nicholls,et al.  The Structure and Design of Programming Languages , 1975 .

[23]  Donald B. Johnson,et al.  Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[24]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[25]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[26]  Mary Shaw,et al.  Abstraction and verification in Alphard: Defining and specifying iteration and generators , 1977 .

[27]  F. Lockwood Morris,et al.  A time- and space-efficient garbage compaction algorithm , 1978, CACM.

[28]  Leo R. Gotlieb,et al.  Data types and structures , 1978 .

[29]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[30]  Douglas Stott Parker,et al.  Conditions for Optimality of the Huffman Algorithm , 1998, SIAM J. Comput..

[31]  W. Wulf,et al.  Fundamental Structures of Computer Science , 1980 .

[32]  Ehud Gudes,et al.  Experiments with B-tree reorganization , 1980, SIGMOD '80.

[33]  George S. Lueker,et al.  Some Techniques for Solving Recurrences , 1980, CSUR.

[34]  Bjarne Stroustrup.  Classes: an abstract data type facility for the C language , 1982, SIGP.

[35]  R. Furuta,et al.  TEX and METAFONT, new directions in typesetting , 1983, Proceedings of the IEEE.