| View Larger Image | An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science) | Hardcoverby J.A. Storer (Author), John C. Cherniavsky (Editor)
| List Price: | $99.00 | | Price: | $79.20 | | You Save: | $19.80 (20%) | | | Available: | Usually ships in 24 hours |
| | Binding: | Hardcover | | Publisher: | Birkhäuser Boston | | Edition: | 1st Edition | | Page Count: | 624 Pages | | Publication Date: | November 09, 2001 | | Sales Rank: | 1,188,504st |
|
ACCESSORIES |
| Guide to Elliptic Curve Cryptography (Springer Professional Computing)
by Darrel Hankerson (Author), Alfred J. Menezes (Author), Scott Vanstone (Author)
A broad-ranging expository guidebook on EEC cryptosystems and technology, written by leading EEC researchers and authorities. All aspects of the topic are clearly presented (accessible technical level, i.e., B.S. degree), with plenty of supporting real-world examples. An essential reference for practitioners or professionals in computer science, computer engineering, network design, and network/data security, as well as a useful self-study resource for researchers.
| 
| Privacy Enhancing Technologies: 6th International Workshop, PET 2006, Cambridge, UK, June 28-30, 2006, Revised Selected Papers (Lecture Notes in Computer Science / Security and Cryptology)
by George Danezis (Editor), Philippe Golle (Editor)
This book constitutes the thoroughly refereed post-proceedings of the 6th International Workshop on Privacy Enhancing Technologies, PET 2006, held in Cambridge, UK, in June 2006 co-located with WEIS 2006, the Workshop on the Economics of Information Security, and WOTE 2006, the IAVoSS Workshop On Trustworthy Elections. The 24 revised full papers presented were carefully selected from 91 submissions during two rounds of reviewing and improvement. The papers both from academia and...
| 
| Advances in Cryptology -- ASIACRYPT 2006: 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, ... Computer Science / Security and Cryptology)
by Xuejia Lai (Editor), Kefei Chen (Editor)
This book constitutes the refereed proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2005, held in Shanghai, China in December 2006. The 30 revised full papers presented were carefully reviewed and selected from 314 submissions. The papers are organized in topical sections on attacks on hash functions, stream ciphers and boolean functions, biometrics and ECC computation, id-based schemes, public-key...
|
|
EDITORIAL REVIEWS |
Product Description
Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1-4. Chapters 1-4. This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A yearlong course may be based on the entire book. Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel architectures will prevail in the future, the idea is to further teachAlthough it is not clear what parallel architectures will prevail in the future, the idea is to further teach fundamental concepts in the design of algorithms by exploring classic models of parallel computation, including the PRAM, generic PRAM simulation, HC/CCC/Butterfly, the mesh, and parallel hardware area-time tradeoffs (with many examples). Apart from classroom use, this book serves as a good reference on the subject of data structures and algorithms. Its page-at-a-time format makes it easy to review material that the reader has studied in the past. |
CUSTOMER REVIEWS (Average Customer Rating: 5.0 based on 1 review)
|
For Serious Developers by W Boudville (Terra, Sol 3)  5 Stars
November 28, 2003
If you have cut your teeth on Donald Knuth's classic three volumes, "The Art of Computer Programming", and you want more detail, at a similar level of complexity, then consider Storer's book.It delves into lists, recursion, trees, graphs, heaps and sets. Like Knuth, Storer thoughtfully supplies an extensive list of questions at the end of each chapter that will greatly deepen your appreciation of the field if you tackle them. Ok, he doesn't give answers, but think of that as greater incentive on your part to solve them. There are almost 400 questions in the book. The teaching style is similar to Knuth, in that it has all the rigour needed by an algorithm designer like yourself, without drowning you in epsilon-delta ultra rigour like a pure maths text.Note that the only code fragments are in pseudocode. This should not be a problem for you. I am assuming you are experienced enough that what you need is understanding of an algorithm, and that manually converting it to code is straightforward and a purely secondary issue.The take home message is that this is excellent for anyone doing serious programming.
| |
SIMILAR PRODUCTS |
| The Algorithm Design Manual
by Steven S. Skiena (Author)
....The most comprehensive guide to designing practical and efficient algorithms!.... The Algorithm Design Manual, Second Edition "...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews "It has all the right ingredients: rich contents,...
| 
| C Programming Language (2nd Edition)
by Brian W. Kernighan (Author), Dennis M. Ritchie (Author)
Presents a complete guide to ANSI standard C language programming. Written by the developers of C, this new version helps readers keep up with the finalized ANSI standard for C while showing how to take advantage of C's rich set of operators, economy of expression, improved control flow, and data structures. This 2nd edition has been completely rewritten with additional examples and problem sets to clarify the implementation of difficult language constructs. 7 x 9 1/4.
| 
| The Design and Analysis of Computer Algorithms
by Alfred V. Aho (Author), John E. Hopcroft (Author), Jeffrey D. Ullman (Author)
| 
| Introduction to the Design and Analysis of Algorithms (2nd Edition)
by Anany V. Levitin (Author)
Based on a Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, "Introduction to the Design and Analysis of Algorithms" presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and...
| 
| Modern Operating Systems (3rd Edition)
by Andrew S. Tanenbaum (Author)
The widely anticipated revision of this worldwide best-seller incorporates the latest developments in operating systems technologies. The Third Edition includes up-to-date materials on relevant operating systems such as Linux, Windows, and embedded real-time and multimedia systems. Includes new and updated coverage of multimedia operating systems, multiprocessors, virtual machines, and antivirus software. Covers internal workings of...
|
|
|
