|
|
Sold Out
Book Categories |
| Derandomization Via Small Sample Spaces | 1 | |
| The Randomized Complexity of Maintaining the Minimum | 4 | |
| Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning | 16 | |
| Service-Constrained Network Design Problems | 28 | |
| Approximate Hypergraph Coloring | 41 | |
| Facility Dispersion and Remote Subgraphs | 53 | |
| The Constrained Minimum Spanning Tree Problem | 66 | |
| Randomized Approximation of the Constraint Satisfaction Problem | 76 | |
| On the Hardness of Global and Local Approximation | 88 | |
| Approximation Algorithms for the Maximum Satisfiability Problem | 100 | |
| On the Hardness of Approximating the Minimum Consistent OBDD Problem | 112 | |
| Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time | 124 | |
| Greedily Finding a Dense Subgraph | 136 | |
| Using Sparsification for Parametric Minimum Spanning Tree Problems | 149 | |
| Vertex Partitioning Problems On Partial k-Trees | 161 | |
| Making an Arbitrary Filled Graph Minimal by Removing Fill Edges | 173 | |
| Sorting and Searching Revisited | 185 | |
| Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching | 198 | |
| Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees | 212 | |
| Neighborhood Graphs and Distributed [Delta] + 1-Coloring | 223 | |
| Communication Complexity of Gossiping by Packets | 234 | |
| Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm | 246 | |
| A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees | 259 | |
| Linear-Time Heuristics for Minimum Weight Rectangulation | 271 | |
| Visibility with Multiple Reflections | 284 | |
| A Fast Heuristic for Approximating the Minimum Weight Triangulation | 296 | |
| Neighbours on a Grid | 309 | |
| On Two Dimensional Packing | 321 | |
| Optimal Orthogonal Drawings of Triconnected Plane Graphs | 333 | |
| Walking Streets Faster | 345 | |
| Safe and Efficient Traffic Laws for Mobile Robots | 357 | |
| Progress in Selection | 368 | |
| Probabilistic Ancestral Sequences and Multiple Alignments | 380 | |
| Efficient Algorithms for Lempel-Ziv Encoding | 392 | |
| The Deterministic Complexity of Parallel Multisearch | 404 | |
| Priority Queues on Parallell Machines | 416 | |
| Binary Search Trees: How Low Can You Go? | 428 | |
| Boolean Analysis of Incomplete Examples | 440 | |
| Author Index | 453 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Paige McKiernan
reviewed Algorithm Theory - SWAT '96, Vol. 109 on June 08, 2012
Algorithm Theory - SWAT '96, Vol. 109
This has to be the best book I have ever read on beginning programming. It actually teaches you as if you have never done programming before, what a new concept for a beginning programming book right? Every other beginners book I have read seemed to think that people just learning, where born writing If Then statement, counting in binary and turning their shopping lists into arrays.
I hate to break it to authors, but the average beginner doesn't even know what I just said. (This are just programming techniques and word, that you really don't need to know about unless you are learning programming, for all those unfortunate people like myself who where not born with this knowledge).
So if you want to learn programming, and didn't grow up fixing bugs on Windows yourself, this is the book to read.
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 Theory - SWAT '96, Vol. 109
X
This Item is in Your Inventory
Algorithm Theory - SWAT '96, Vol. 109
X
You must be logged in to review the productsX
X
X
Add Algorithm Theory - SWAT '96, Vol. 109, , Algorithm Theory - SWAT '96, Vol. 109 to the inventory that you are selling on WonderClubX
X
Add Algorithm Theory - SWAT '96, Vol. 109, , Algorithm Theory - SWAT '96, Vol. 109 to your collection on WonderClub |
