|
|
Sold Out
Book Categories |
| Replicated File Management in Large-scale Distributed Systems | 1 | |
| Realization of PRAMs: Processor Design | 17 | |
| Factoring | 28 | |
| Primary Partition "Virtually-synchronous Communication" Harder than Consensus | 39 | |
| Secure Distributed Computing: Theory and Practice | 53 | |
| Fast Increment Registers | 74 | |
| Coping with Contention | 89 | |
| Exotic Behaviour of Consensus Numbers | 101 | |
| Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable | 116 | |
| Linear-time Snapshot Using Multi-writer Multi-reader Registers | 130 | |
| Fast, Long-lived Renaming | 141 | |
| Anomalies in the Wait-free Hierarchy | 156 | |
| Finding the Extrema of a Distributed Multiset | 164 | |
| The Level of Handshake Required for Establishing a Connection | 179 | |
| Local Labeling and Resource Allocation Using Preprocessing | 194 | |
| A Scalable Approach to Routing in ATM Networks | 200 | |
| Low Complexity Network Synchronization | 223 | |
| An Incremental Distributed Algorithm for Computing Biconnected Components | 238 | |
| Reaching (and Maintaining) Agreement in the Presence of Mobile Faults | 253 | |
| Uniform Deterministic Self-stabilizing Ring-orientation on Odd-length Rings | 265 | |
| Using Failure Detectors to Solve Consensus in Asynchronous Shared-memory Systems | 280 | |
| An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem | 296 | |
| Average and Randomized Complexity of Distributed Problems | 311 | |
| Self-stabilization by Local Checking and Global Reset | 326 | |
| Breakpoints and Time in Distributed Computations | 340 | |
| Cheaper Matrix Clocks | 355 | |
| Author Index | 370 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Mohamad Imran
reviewed Distributed Algorithms on May 13, 2018
Distributed Algorithms
I read this on the advice of Dr. Eiselt, Dean (at that time) of the College of Computing, after asking him via email "alright, I'm taking classes and whatnot, but I want the Stygian deep; I want to go down as far as I can; I want and need to read those books which have shaped the great computer scientists before me, the real thing." Having probed the shelves of computer science and mathematics since, I remain convinced he could have given no better advice to a precocious freshman. Used for several decades at MIT, this second edition is more than thorough enough for an introduction to computer science anywhere. Taught using the Scheme system (with its close bindings to the type-free λ-calculus), this canonical work covers register machines, logic programming, nondeterministic evaluation, the relations of recursion to iteration, and a wealth of carefully-woven-in jewels from number theory and discrete mathematics. Every programmer thinking himself the real deal owes it to himself to read through this grand work, epic in scope and breathtaking in sudden illuminations.
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
Distributed Algorithms
X
This Item is in Your Inventory
Distributed Algorithms
X
You must be logged in to review the productsX
X
X
Add Distributed Algorithms, This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994. Besides the 23 research papers carefully selected by the program commit, Distributed Algorithms to the inventory that you are selling on WonderClubX
X
Add Distributed Algorithms, This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994. Besides the 23 research papers carefully selected by the program commit, Distributed Algorithms to your collection on WonderClub |