Algorithms

1. Softpanorama Virtual Library - Section on Algorithms and Data Structures. A compilation of links. www.softpanorama.org Mama
2. Data Structures and Algorithm Analysis in C++ (3rd Edition)

   Data Structures and Algorithm Analysis in C++ (3rd Edition)

   • Book by Mark Allen Weiss.
3. STL Tutorial - Lesson 5 - Generic Algorithms, Part 1 - STL Tutorial - Lesson 5 - Generic Algorithms, Part 1 cplus.about.com Mama
4. IBM algorithms boost b-to-b e-commerce - [CNN] cnn.com Mama
5. Juergen Schmidhuber's home page - Universal Artificial Intelligence - New... - . . What's new? (6 May 2005) Pronounce: Yirgan Shmidhoobuh If you can say Schwarzenegger& Schumacher& Schiffer you can also say Schmidhuber German ON ... www.idsia.ch Mama
6. Game Algorithms - Algorithms, source code and references. www.azillionmonkeys.com Mama
7. STL Tutorial - Lesson 6 - Generic Algorithms, Part 2 - STL Tutorial - Lesson 6 - Generic Algorithms, Part 2 cplus.about.com Mama
8. The LEDA Library - LEDA is a library of the data types and algorithms of combinatorial computing. www.mpi-sb.mpg.de Mama
9. Introduction to Algorithms, Second Edition - In all international markets outside the USA and Canada: Introduction to Algorithms, Second Edition, is published by The MIT Press and is mitpress.mit.edu Mama
10. Andrija Radovic´'s Algorithms - Several unique algorithms for fast and optimal computations with integer numbers and graphics suitable for hardware implementation: dividing, square rooting, line drawing, ellipse drawing, Haiku plot routine. www.andrijar.com Mama
11. Combinatorial Optimization- Algorithms and Complexity

    Combinatorial Optimization

    Algorithms and Complexity:
    • Book by Christos H. Papadimitriou and Kenneth Steiglitz.
12. (USA) Carnegie Mellon University - Algorithms and Computational Complexity group. Members, research projects, courses. www-2.cs.cmu.edu Mama
13. Algorithmics, Inc. - Visit the link for details. www.algorithmics.com Mama
14. STL Tutorial - Lesson 6: Generic Algorithms, Part 2 - This is the sixth lesson in the C++ STL tutorial. It presents and explains the generic algorithms of the STL. Includes, inner_product, max, max_element, merge, min, min_element, mismatch, partition, remove, replace and reverse are discussed. See the entire STL tutorial.... cplus.about.com Mama
15. Algorithms Courses on the WWW - ... Once there, you should search for Algorithms, and then follow the appropriate link. Suggestions for ... Undergraduate and Introductory Graduate Courses Jeff Edmonds' introductory algorithms notes Kirk ... www.cs.pitt.edu Mama
16. STL Tutorial - Lesson 6: Generic Algorithms, Part 2 - This is the sixth lesson in the C++ STL tutorial. It presents and explains the generic algorithms of the STL. cplus.about.com Mama
17. R.Mukundan::Java Applets Center - Illustration computer graphics algorithms, computer vision algorithms, computational geometry algorithms, data structures and algorithms. www.cosc.canterbury.ac.nz Mama
18. Computer Programming Algorithms Directory - Computer Programming Algorithms Directory Welcome to my computer programming algorithms directory. I am hoping to provide a comprehensive directory of web sites that detail algorithms for computer ... www.algosort.com Mama
19. Algorithms to Treat Depression - Algorithms to Treat Depression bipolar.about.com Mama
20. Operations Research- Applications and Algorithms (with CD-ROM and InfoTrac)

    Operations Research

    Applications and Algorithms (with CD-ROM and [InfoTrac]Create?):
    • Book by Wayne L. Winston.
21. Fast Line Algorithms (Computer Graphics Line-Drawing) - edepot World Religion Music Games Money Stores Shoes Search Sitemap Fast Computer Graphics Line-Drawing Algorithms Extremely Fa ... www.edepot.com Mama
22. What Is an Algorithm? - There are five basic classifications of algorithms: ... This set of algorithms is based on probability and statistics. www.tjhsst.edu Mama
23. DDJ - Jump to... Subscribe to DDJ All Access Services Free Content Source Code Articles Columns Newsletters Tools & Services

    ---

    ... www.ddj.com Mama
24. Cormen/Leiserson/Rivest/Stein: Introduction to Algorithms - Here is a recent version of the known bug list (in Postscript). ... Introduction to Algorithms (Second Edition) ... theory.lcs.mit.edu Mama
25. PARALLEL ALGORITHMS AND SCIENTIFIC COMPUTING - PARALLEL ALGORITHMS AND SCIENTIFIC COMPUTING Next: The Input/Output Complexity of Up: Jeff Vitter's Recent Papers Previous: CAMEL: Concept Annotated iMagE ... www.cs.duke.edu Mama
26. CastleCops - Algorithms - Encoding/Decoding Ciphertext - Promoting education and health in online security and privacy. New User? Need help? Click here to register for free! Register ... castlecops.com Mama
27. No Title. - Visit the link for details. www.nag.co.uk:70 Mama
28. Review: The Tomes of Delphi: Algorithms & Data Structures - Featuring a wealth of code examples appropriate for practicing developers, this advanced-level guide provides comprehensive coverage of such topics as arrays, binary trees, data compression. The CD includes the author's freeware library, EZDSL, along with the code from the book. delphi.about.com Mama
29. Digital Signal Processing- Principles, Algorithms and Applications (3rd Edition)

    Digital Signal Processing

    Principles, Algorithms and Applications (3rd Edition):

• Book by John G. Proakis and Dimitris K Manolakis.

Data Structures and Algorithm Analysis in C++ (3rd Edition)

Data Structures and Algorithm Analysis in C++ (3rd Edition)

• Review:: 'Concepts explained well. I thought that this book did its job in explaining the data structures under consideration effectively, but I did not like the author's coding style, and this is nothing more than taste. The book's goal is the teaching of data structures and it did this. Overall, though, this book is a good reference.
• Review:: 'This is a great book. Made for REAL programmers. I had the luxury of having Dr. Weiss at Florida International University. He was a great professor and as a result I bought this book expecting a great book. The book turned out to be better than expected. If you hate math and cannot program in C++, then this is not the book for you. However, if you desire to learn data structures effectively then you have found the book you have been looking for.
• Review:: 'Poorly Written, No Answers to Exercises, Avoid purchase. Another drab computer science book written by someone who likes to complicate the obvious and oversimplify the complicated. It is obviously geared toward dry mathematical types, and if you're one of those it might possibly be partially stimulating. The mathematical notation is unfortunately quite poor, many letters (which seem to represent constants and sometimes variables?) are ambiguously defined. Not to mention how half assed the "proofs" are. My linear algebra and differential equations teacher would roll over in her proverbial grave. The code examples are halfway decent, however using one letter variable names is something a beginner quickly learns to stop doing. Why does this guy do it? The one thing that I like is his use of line up curley braces. Requiring readers to visit some website to obtain portions of missing code defeats the purpose of writing a book. Why don't I just read a bunch of webpages instead of buying this flavorless thing. Code "snipits" are another big mistake, they're only understood if their context is explained well, which this shabby author cannot do. He seems to assume we have some clairvoyant abilities. A hint of color might at least keep me awake, but I guess that would have required putting some thought into the book's layout. The hash table chapter is a wonderful example of how this author is a detached weirdo who can't put himself in the place of his readers. Saying "in the above example" in reference to an example that was FOUR pages ago is thoroughly idiotic and unnecessarily confusing. Several "examples" appeared after the one he referred to. Naming the page number would only take a few more letters i.e. "in the above example(p.54)" And saying "using the same hash function" after showing us 3 different hash functions has the same perplexing effect. How about "again using h(x) = x%10," it would use less ink and make more sense. The true reason I hate this book though, is that its exercises have no answers, not even to the odd questions or just some selected questions. Nothing. Thus, the exercises are completely useless. In order to prepare for my exam I've had to check out other books because this one doesn't cut it. I even found a much older edition of this book and by its similarity it's clear he's just recycling it for financial gain. Again Exercises and no solutions. How do I know if I'm doing them correctly?! As with physical exercise, exerting yourself the wrong way can be quite detrimental! This author needs to take a communication 101 class or read some of Deitel & Deitel's books. Avoid purchasing this book unless you have to!
• Review:: 'Read description: for ADVANCED data structures course Many people on here have complained that this book goes way over the head of students not already familiar with some C++ and data structures. To these comments, I refer you to the product description (or editorial review, whichever) that specifically says this is an advanced text. I apologize to those whose professors ordered this book for intro data structures--I can understand why this book would go past the scope of that class. However, if you know any Object Oriented programming (Java or C++ preferably) and know some basic algorithms and structures (matrices, sorts, recursion, trees, queues, etc.) this book will take you far. I don't even mean that you must be proficient in these structures, just have some basic understanding of how they work. For example, you should know what a tree is (root, leaves, implemented with pointers and nodes) and book will tell you how to use trees (B-Trees, Binary trees, etc.). By the point you are using this book, hopefully you'll have taken the math and programming classes needed to comprehend this text. Otherwise, do not blame the text for being targeted to an advanced audience.
• Review:: 'Useless textbook I am a senior and a 4.0 student and this is one of the worst textbooks I have had as an undergraduate. I agree both with the reviewers who criticized this book (You WILL need to find a different book to help you pass your tests, because this one is incomprehensible) and with those who praise the book (This book is comprehensible and to the point IF you already know most of the material and have a very strong base in C++). Not a good textbook!! If you are an instructor, please don't use it in your class.

• Similar books:
• Operating System Concepts
• File Structures- An Object-Oriented Approach with C++ (3rd Edition)
• The C++ Standard Library- A Tutorial and Reference
• Computer System Architecture (3rd Edition)
• Introduction to Algorithms, Second Edition

Combinatorial Optimization- Algorithms and Complexity

Combinatorial Optimization

Algorithms and Complexity:

• Review:: 'a great bargain It is my favorite book on combinatorial optimization. The last 5 chapters 15-19 are the most interesting and useful to me because my job is write heuristics for NP hard problems in transportation. Chatpers 15 and 16 on NP complete problems are well explained and covered in depth. Chapter 17 on approximation algorithms is easy to understand and fun to read. Chapters 18 (branch-and-bound and dynamic programming) and 19 (local search) are very practical stuff, which I read many times. The rest of the book is a good reference for topics like linear programming, max-flow, matching, etc. There are mostly independent of the last 5 chapters and can be skipped on a first read. My experience is that I don't need detailed knowledge of simplex algorithms because I use CPlex.
• Review:: 'Well written and accessible A couple of years ago I used this book to prepare for my PhD comprehensive exam and recently I picked it up again. While a lot has happened in OR since the book was written, the basics are covered in fine detail and in beautiful style. It could also be used as a graduate textbook or a course supplement. A very useful book for anyone interested in combinatorial optimization. What missing is the wealth of Artificial Intelligence techniques successfully used to tackle NP-hard optimization problems. But this is not a negative comment, just for your information. That belongs to another book. Linear Programming, Duality, Spanning Trees, Flows, Matching and introduction into NP-completeness are finely covered. A truly great job for an amazingly low price (see the text book prices with similar titles).
• Review:: 'It was Good!! This is a Good Book for whom want to learn the concept of combinatorial Optimaization. The only disadvantage is that there is no solution manual for excercises. So, I couldn't check if my answer was right or not.
• Review:: 'Combinatorial Optimization This is a book for mathematic nerds. There are no practical analytical problems in the book to make it useful for those of us involved in quick solutions to solve problems such as payoffs for investments beginning with forces of nature and then going through probability factors to get to real numbers of what can happen to various investment opportunities. I did recognize the value of the book for those who are on the front lines of determining how many and where ISPs might be on a route from Edmonton to Washington but one can use other methods of project controls. The math in this book was of no value --- even a wee bit. When I came across the TSP or Travelling Salesman Problem, it reminded me of how I used to name physics problems for students. But, I always thought the TSP was really the Farmer's Daughter problem. Apparently it ain't so. JR.
• Review:: 'A masterpiece This book is a classic. Besides, it's a bargain. I read it more than 10 years ago as an undergrad and, even then, could grasp all the concepts. So, it's really accessible.

• Similar books:
• Combinatorial Optimization- Networks and Matroids
• Computers and Intractability- A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
• Approximation Algorithms
• Randomized Algorithms (Cambridge International Series on Parallel Computation)
• Network Flows- Theory, Algorithms, and Applications