The Design and Analysis of Computer Algorithms

From the Publisher: With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001

[1]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

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

[3]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[4]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[5]  Irving John Good,et al.  The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[6]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[7]  F. Hohn,et al.  Elementary Matrix Algebra , 1959 .

[8]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[9]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[10]  Yuri Petrovich Ofman,et al.  On the Algorithmic Complexity of Discrete Functions , 1962 .

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

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

[13]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

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

[15]  Michael J. Fischer,et al.  An improved equivalence algorithm , 1964, CACM.

[16]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[17]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[18]  Shmuel Winograd,et al.  On the Time Required to Perform Addition , 1965, JACM.

[19]  G. Dantzig,et al.  ALL SHORTEST ROUTES FROM A FIXED ORIGIN IN A GRAPH , 1966 .

[20]  V. Pan.  METHODS OF COMPUTING VALUES OF POLYNOMIALS , 1966 .

[21]  W. M. Gentleman,et al.  Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[22]  Shmuel Winograd,et al.  On the Time Required to Perform Multiplication , 1967, JACM.

[23]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[24]  T. C. Hu.  A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..

[25]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[26]  Bell Telephone,et al.  Regular Expression Search Algorithm , 1968 .

[27]  L. Divieti,et al.  On the Determination of Minimum Feedback Arc and Vertex Sets , 1968 .

[28]  Alfred V. Aho,et al.  Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..

[29]  Mit Press,et al.  A Linear Filtering Approach to the Computation of the Discrete Fourier Transform , 1969 .

[30]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[31]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[32]  Daniel J. Rosenkrantz,et al.  Table Machine Simulation , 1969, SWAT.

[33]  L. R. Kerr,et al.  On Minimizing the Number of Multiplications Necessary for Matrix Multiplication , 1969 .

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

[35]  T. C. Hu,et al.  Optimum Binary Search Trees. , 1970 .

[36]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[37]  S. Winograd.  ON THE ALGEBRAIC COMPLEXITY OF FUNCTIONS , 1970 .

[38]  Richard M. Karp,et al.  A Phenomenon in the Theory of Sorting , 1970, SWAT.

[39]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[40]  J. D. Lipson,et al.  Chinese remainder and interpolation algorithms , 1971, SYMSAC '71.

[41]  Peter J. Nicholson,et al.  Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[42]  Stephen A. Cook,et al.  Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.

[43]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[44]  J. Ian Munro,et al.  Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..

[45]  W. S. Brown.  On Euclid's algorithm and the computation of polynomial greatest common divisors , 1971, SYMSAC '71.

[46]  Ellis Horowitz,et al.  A Fast Method for Interpolation Using Preconditioning , 1972, Information Processing Letters.

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

[48]  Ira Pohl,et al.  A sorting problem and its complexity , 1972, CACM.

[49]  C. L. Liu.  Analysis and Synthesis of Sorting Algorithms , 1972, SIAM J. Comput..

[50]  Stephen A. Cook,et al.  A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..

[51]  David G. Kirkpatrick.  On the additions necessary to compute certain functions , 1972, STOC '72.

[52]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[53]  Clark A. Crane,et al.  Linear Lists and Prorty Queues as Balanced Binary Trees , 1972, Outstanding Dissertations in the Computer Sciences.

[54]  Michael J. Fischer,et al.  Efficiency of Equivalence Algorithms , 1972, Complexity of Computer Computations.

[55]  Ronald V. Book,et al.  On Languages Accepted in Polynomial Time , 1972, SIAM J. Comput..

[56]  M. Rabin,et al.  Fast evaluation of polynomials by rational preparation , 1972 .

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

[58]  W. Gentleman.  Optimal multiplication chains for computing a power of a symbolic polynomial , 1972 .

[59]  Allan Borodin,et al.  Fast Modular Transforms via Division , 1972, SWAT.

[60]  Vaughan R. Pratt,et al.  On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.

[61]  William C. Rounds,et al.  Complexity of Recognition in Intermediate-Level Languages , 1973, SWAT.

[62]  Jacques Morgenstern,et al.  Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.

[63]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[64]  A. R. Meyer,et al.  Refinements of the Nondeterministic Time and Space Hierarchies , 1973, SWAT.

[65]  Robert E. Tarjan.  Testing flow graph reducibility , 1973, STOC '73.

[66]  Robert T. Moenck,et al.  Fast computation of GCDs , 1973, STOC.

[67]  Larry Stockmeyer,et al.  Planar 3-colorability is polynomial complete , 1973, SIGA.

[68]  Philip M. Spira,et al.  A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..

[69]  G. E. Collins.  Computer Algebra of Polynomials and Rational Functions , 1973 .

[70]  Edward M. Reingold,et al.  Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..

[71]  Donald B. Johnson,et al.  Algorithms for Shortest Paths , 1973 .

[72]  Philip M. Spira,et al.  On Finding and Updating Shortest Paths and Spanning Trees , 1973, SWAT.

[73]  Alfred V. Aho,et al.  Currents In The Theory Of Computing , 1973 .

[74]  Jeffrey D. Ullman,et al.  Polynomial complete scheduling problems , 1973, SOSP '73.

[75]  Ravi Sethi,et al.  Complete register allocation problems , 1973, SIAM J. Comput..

[76]  Sadashiva S. Godbole,et al.  On Efficient Computation of Matrix Chain Products , 1973, IEEE Transactions on Computers.

[77]  J. F. Traub.  Symposium on complexity of sequential and parallel numerical algorithms : program and abstracts. , 1973 .

[78]  S. Cook,et al.  On the lengths of proofs in the propositional calculus (Preliminary Version) , 1974, STOC '74.

[79]  David G. Kirkpatrick.  Determining graph properties from matrix representations , 1974, STOC '74.

[80]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[81]  Ronald V. Book,et al.  Comparing Complexity Classes , 1974, J. Comput. Syst. Sci..

[82]  M. Fischer,et al.  AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION , 1974 .

[83]  Vaughan R. Pratt,et al.  The power of negative thinking in multiplying Boolean matrices , 1974, STOC '74.

[84]  Oscar H. Ibarra,et al.  Polynomially Complete Fault Detection Problems , 1975, IEEE Transactions on Computers.

[85]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[86]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[87]  Robert A. Wagner,et al.  A Shortest Path Algorithm for Edge-Sparse Graphs , 1976, J. ACM.

[88]  Allan Borodin,et al.  On the Number of Additions to Compute Specific Polynomials , 1976, SIAM J. Comput..