|
|
Sold Out
Book Categories |
| Selecting Problems for Algorithm Evaluation | 1 | |
| BSP Algorithms - "Write Once, Run Anywhere" | 12 | |
| Ten Years of LEDA: Some Thoughts | 14 | |
| Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison | 15 | |
| Efficient Implementation of Lazy Suffix Trees | 30 | |
| Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism | 43 | |
| Finding Minimum Congestion Spanning Trees | 60 | |
| Evaluation of an Algorithm for the Transversal Hypergraph Problem | 72 | |
| Construction Heuristics and Domination Analysis for the Asymmetric TSP | 85 | |
| Counting in Mobile Networks: Theory and Experimentation | 95 | |
| Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport | 110 | |
| Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA | 124 | |
| On-Line Zone Construction in Arrangements of Lines in the Plane | 139 | |
| The Design and Implementation of Planar Maps in Cgal | 154 | |
| An Easy to Use Implementation of Linear Perturbations within Cgal | 169 | |
| Analysing Cache Effects in Distribution Sorting | 183 | |
| Fast Regular Expression Search | 198 | |
| An Experimental Evaluation of Hybrid Data Structures for Searching | 213 | |
| LEAD-SM: Extending LEDA to Secondary Memory | 228 | |
| A Priority Queue Transform | 243 | |
| Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All - Optical Networks | 258 | |
| Estimating Large Distances in Phylogenetic Reconstruction | 271 | |
| The Performance of Concurrent Red-Black Tree Algorithms | 286 | |
| Performance Engineering Case Study: Heap Construction | 301 | |
| A Fast and Simple Local Search for Graph Coloring | 316 | |
| BALL: Biochemical Algorithms Library | 330 | |
| An Experimental Study of Priority Queues in External Memory | 345 | |
| Author Index | 361 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Mitchell Goossen
reviewed Algorithm Engineering on February 01, 2008 Algorithm Engineering
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Algorithm Engineering
X
This Item is in Your Inventory
Algorithm Engineering
X
You must be logged in to review the productsX
X
X
Add Algorithm Engineering, , Algorithm Engineering to the inventory that you are selling on WonderClubX
X
Add Algorithm Engineering, , Algorithm Engineering to your collection on WonderClub |
