A practical introduction to data structures and algorithm analysis prentice hall

From the Publisher: Clifford A. Shaffer provides a treatment of fundamental data structures and the principles of algorithm analysis understandable by sophomore and junior level students in Computer Science and related fields. The author focuses on teaching students and practitioners to understand the principles required to select or design the data structure that will best solve his/her problem.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Frederick P. Brooks,et al.  The Mythical Man-Month: Essays on Softw , 1978 .

[3]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[4]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[5]  Clifford A. Shaffer,et al.  Generalized comparison of quadtree and bintree storage requirements , 1993, Image Vis. Comput..

[6]  Clifford A. Shaffer,et al.  A Paging Scheme for Pointer-Based Quadtrees , 1993, SSD.

[7]  Daniel Solow,et al.  How to read and do proofs , 1982 .

[8]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[9]  Dominic J. A. Welsh,et al.  Codes and cryptography , 1988 .

[10]  Robert E. Tarjan,et al.  A Locally Adaptive Data , 1986 .

[11]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[12]  Ricardo Baeza-Yates,et al.  Information Retrieval: Data Structures and Algorithms , 1992 .

[13]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[14]  Eric S. Roberts,et al.  Thinking recursively , 1986 .

[15]  Venkata Subramaniam,et al.  Information Retrieval: Data Structures & Algorithms , 1992 .

[16]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[17]  Richard J. Enbody,et al.  Dynamic hashing schemes , 1988, CSUR.

[18]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[19]  L BentleyJon,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985 .

[20]  William Stallings,et al.  Operating Systems: Internals and Design Principles , 1991 .

[21]  Matthias Felleisen,et al.  The Little Schemer , 1986 .

[22]  Ken Arnold,et al.  The Java Programming Language , 1996 .

[23]  M. Levine,et al.  Effective Problem Solving , 1988 .

[24]  Daniel P. Friedman,et al.  The little LISPer , 1974 .

[25]  Pete Thomas,et al.  Abstract data types: their specification, representation, and use , 1988 .

[26]  Arthur Whimbey,et al.  Problem Solving & Comprehension , 1991 .

[27]  John R. Gilbert,et al.  Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..

[28]  Edward A. Fox,et al.  Practical minimal perfect hash functions for large databases , 1992, CACM.

[29]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[30]  Zvi Galil,et al.  Data structures and algorithms for disjoint set union problems , 1991, CSUR.

[31]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[32]  Fred S. Roberts,et al.  Applied Combinatorics , 1984 .

[33]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[34]  Ian H. Witten,et al.  Managing gigabytes , 1994 .

[35]  Derick Wood,et al.  A survey of adaptive sorting algorithms , 1992, CSUR.

[36]  Andrew S. Tanenbaum,et al.  Structured Computer Organization , 1976 .

[37]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[38]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[39]  Murali Sitaraman,et al.  Special feature: component-based software using resolve , 1994 .

[40]  C.A. Shaffer,et al.  A real-time robot arm collision avoidance system , 1992, IEEE Trans. Robotics Autom..

[41]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[42]  P. Kidwell,et al.  The mythical man-month: Essays on software engineering , 1996, IEEE Annals of the History of Computing.

[43]  Paul J. Deitel,et al.  C how to program , 1994 .

[44]  Richard M. Stallman,et al.  Gnu Emacs Manual , 1996 .

[45]  James Gleick.  Complexities of Feynman. (Book Reviews: Genius. The Life and Science of Richard Feynman.) , 1992 .

[46]  Jon Louis Bentley,et al.  Writing efficient programs , 1982 .

[47]  Arthur J. Riel,et al.  Object-Oriented Design Heuristics , 1996 .

[48]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[49]  Gilles Brassard,et al.  Fundamentals of Algorithmics , 1995 .

[50]  J. Jaynes.  The Origin of Consciousness in the Breakdown of the Bicameral Mind , 1976 .

[51]  Betty Salzberg,et al.  File Structures: An Analytic Approach , 1988 .

[52]  Daniel Solow,et al.  How to Read and Do Proofs : An Introduction to mathematical Thought Processes/Daniel Solow , 1982 .

[53]  H. Scott Fogler,et al.  Strategies for Creative Problem Solving , 1994 .

[54]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[55]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[56]  Jeffrey C. Lagarias,et al.  The 3x + 1 Problem and its Generalizations , 1985 .

[57]  BentleyJon Louis.  Multidimensional binary search trees used for associative searching , 1975 .

[58]  James L. Hein,et al.  Discrete structures, logic, and computability , 1994 .

[59]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[60]  Gregory J. E. Rawlins.  Compared to what? - an introduction to the analysis of algorithms , 1992, Principles of computer science series.

[61]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[62]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[63]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[64]  Lonnie R. Welch,et al.  On Specification of Reusable Software Components , 1993, Int. J. Softw. Eng. Knowl. Eng..

[65]  David Flanagan,et al.  Java in a Nutshell , 1996 .

[66]  Jon Louis Bentley.  Programming pearls: the back of the envelope , 1984, CACM.

[67]  Fred P. Brooks,et al.  The Mythical Man-Month , 1975, Reliable Software.

[68]  Bjarne Stroustrup,et al.  The Annotated C++ Reference Manual , 1990 .

[69]  Stanley C. Eisenstat,et al.  Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination , 1981 .

[70]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[71]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[72]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[73]  Jon Louis Bentley,et al.  More programming pearls - confessions of a coder , 1988 .

[74]  Jon L. Bentley,et al.  Programming pearls: the envelope is back , 1986, CACM.