This comprehensive compendium of algorithms and data structures covers many theoretical issues from a practical perspective. Chapters include information on finite precision issues as well as discussions on specific algorithms where algorithmic techniques are of special importance - for example, algorithms for drawing graphs, algorithms for robotics, and algorithms for forming a VLSI chip. Unique coverage includes graph algorithms, cryptography, parallelism, computational geometry, combinatorial optimization, and computability and complexity theory.
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||
|
There is a newer edition of this item:
|
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5 of 7 people found the following review helpful:
5.0 out of 5 stars
The Art of Computer Programming 40 Years Later,
By
This review is from: Algorithms and Theory of Computation Handbook (Chapman & Hall/CRC Applied Algorithms and Data Structures series) (Hardcover)
Knuth's Art of Computer Programming summarized the state-of-the-art in research into algorithms in the seventies and set bar formidably high both in breadth and depth of presentation. Atallah's Handbook is one of the better attempts to survery the present, much wider scope of research in the field, even if it's lacking in Knuth's profundity. It most certainly makes an interesting read if you have the time it takes. If you enjoyed reading Knuth, you will enjoy browsing through Atallah as well.
1 of 5 people found the following review helpful:
5.0 out of 5 stars
Confirm: Excellent Resource,
By Douglas Cameron (Wellesley, MA) - See all my reviews
This review is from: Algorithms and Theory of Computation Handbook (Chapman & Hall/CRC Applied Algorithms and Data Structures series) (Hardcover)
Just bought the book and it has been useful already. If you are serious enough about computer science to want to know what is in the professional literature this is full of wonderful summaries.
1 of 5 people found the following review helpful:
5.0 out of 5 stars
Excellent Computer Science Resource,
By Ben Peterson (USA) - See all my reviews
This review is from: Algorithms and Theory of Computation Handbook (Chapman & Hall/CRC Applied Algorithms and Data Structures series) (Hardcover)
This book is an incredible resource for all people interested in software engineering and AI. I've used numerous ideas in from this book in current research projects, and I'm sure that my copy will become well worn with time! -Ben Peterson, Computer Science student
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
paying device, sparsification tree, canonical complexity classes, array access structure, approximating polynomial zeros, blind signature issuing protocol, historical cryptosystems, representing electronic cash, set union data structures, exact string searching, ski rental problem, electronic cash design, example electronic cash system, semifree path, multiprefix operation, set union problem, horizontal visibility map, memory machine model, null locator, fat node method, blinding paradigm, union stack, dense structured matrices, catenable lists, channel intersection graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory of Computing, John Wiley, Englewood Cliffs, International Conference, Information Processing Letters, Prentice Hall, Journal of Algorithms, Cambridge University Press, Machine Intelligence, Morgan Kaufmann, Monte Carlo, Symbolic Algebraic Comput, Computing Surveys, International Symposium, Journal of Cryptology, National Science Foundation, The Art of Computer Programming, Emde Boas, Boca Raton, Oxford University Press, Acta Informatica, International Colloquium, Las Vegas, Management Science New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
paying device, sparsification tree, canonical complexity classes, array access structure, approximating polynomial zeros, blind signature issuing protocol, historical cryptosystems, representing electronic cash, set union data structures, exact string searching, ski rental problem, electronic cash design, example electronic cash system, semifree path, multiprefix operation, set union problem, horizontal visibility map, memory machine model, null locator, fat node method, blinding paradigm, union stack, dense structured matrices, catenable lists, channel intersection graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory of Computing, John Wiley, Englewood Cliffs, International Conference, Information Processing Letters, Prentice Hall, Journal of Algorithms, Cambridge University Press, Machine Intelligence, Morgan Kaufmann, Monte Carlo, Symbolic Algebraic Comput, Computing Surveys, International Symposium, Journal of Cryptology, National Science Foundation, The Art of Computer Programming, Emde Boas, Boca Raton, Oxford University Press, Acta Informatica, International Colloquium, Las Vegas, Management Science New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
21
books
cite this book:
See all 21 books citing this book
- Average Case Analysis of Algorithms on Sequences (Wiley Series in Discrete Mathematics and Optimization) by Wojciech Szpankowski in Back Matter
- Distributed Computing: 14th International Conference, DISC 2000 Toledo, Spain, October 4-6, 2000 Proceedings (Lecture Notes in Computer Science) by Maurice Herlihy on page 25
- Multikriterielle Ablaufplanung (Produktion und Logistik) (German Edition) by Martin Josef Geiger in Back Matter
- Membrane Computing: International Workshop, WMC 2003, Tarragona, Spain, July 17-22, 2003, Revised Papers (Lecture Notes in Computer Science) by Carlos Martín-Vide on page 122
- Algorithm Design: Foundations, Analysis, and Internet Examples by Michael T. Goodrich in Back Matter
See all 21 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Theory of Computing
- Books > Computers & Technology > Programming > Algorithms
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
