Skip to content

Distributed Computing 14th International Conference, DISC 2000, Toledo, Spain, October 2000 - Proceedings

Spend $50 to get a free movie!

ISBN-10: 3540411437

ISBN-13: 9783540411437

Edition: 2000

Authors: Maurice Herlihy

List price: $109.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $109.00
Copyright year: 2000
Publisher: Springer Berlin / Heidelberg
Publication date: 9/20/2000
Binding: Paperback
Pages: 392
Size: 6.10" wide x 9.17" long x 0.37" tall
Weight: 2.750

Maurice Herlihy received an A.B. in Mathematics from Harvard University, and a Ph.D. in Computer Science from M.I.T. He has served on the faculty of Carnegie Mellon University, on the staff of DEC Cambridge Research Lab, and is currently a Professor in the Computer Science Department at Brown University. Maurice Herlihy is an ACM Fellow, and is the recipient of the 2003 Dijkstra Prize in Distributed Computing. He shared the 2004 G�del Prize with Nir Shavit, the highest award in theoretical computer science. In 2012 he shared the Edsger W. Dijkstra Prize In Distributed Computing with Nir Shavit.

Lower Bounds in Distributed Computing
Adaptive Mutual Exclusion with Local Spinning
Bounds for Mutual Exclusion with only Processor Consistency
Even Better DCAS-Based Concurrent Deques
Distributed Algorithms for English Auctions
A Probabilistically Correct Leader Election Protocol for Large Groups
Approximation Algorithms for Survivable Optical Networks
Distributed Cooperation During the Absence of Communication
On the Importance of Having an Identity or is Consensus Really Universal?134
Polynomial and Adaptive Long-Lived (2k - 1)-Renaming
Computing with Infinitely Many Processes
Establishing Business Rules for Inter-Enterprise Electronic Commerce
Metering Schemes with Pricing
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
Gossip versus Deterministically Constrained Flooding on Small Networks
Thrifty Generic Broadcast
Locating Information with Uncertainty in Fully Interconnected Networks
Optimistic Replication for Internet Data Services
Scalable Replication in Database Clusters
Disk Paxos
Objects Shared by Byzantine Processes
Short Headers Suffice for Communication in a DAG with Link Failures
Consistency Conditions for a CORBA Caching Service
Author Index