{"product_id":"9783540426059","title":"Distributed Computing : 15th International Conference, Disc 2001,Lisbon, Portugal, October 3-5, 2001, Proceedings (Lecture Notes in Computer Science)","description":"\u003cp\u003eDISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2001 was held on Oct 3 5, 2001, in Lisbon, Portugal. This volume includes 23 contributed papers. It is expected that these papers will be submitted in more polished form to fully refereed scienti?c journals. The extended abstracts of this year s invited lectures, by Gerard LeLann and David Peleg, will appear in next year s proceedings. We received 70 regular submissions. These submissions were read and eval- ted by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to - cept many deserving papers. This year s Best Student Paper award goes to Yong-Jik Kim for the paper A Time Complexity Bound for Adaptive Mutual Exclusion by Yong-Jik Kim and James H. Anderson. October 2001 Jennifer Welch Organizing Committee Chair: Luis Rodrigues (University of Lisbon) Publicity: Paulo Ver ?ssimo (University of Lisbon) Treasurer: Filipe Araujo (University of Lisbon) Web: Alexandre Pinto (University of Lisbon) Registration: Hugo Miranda (University of Lisbon) Steering Committee Faith Fich (U. of Toronto) Michel Raynal (vice-chair) (IRISA) Maurice Herlihy (Brown U. ) Andr e Schiper (chair) (EPF Lausanne) Prasad Jayanti (Dartmouth) Jennifer Welch (Texas A\u0026amp;M U. ) Shay Kutten (Technion) Program Committee Marcos K. Aguilera (Compaq SRC) Mark Moir (Sun Microsystems Laboratories) Lorenzo Alvisi (U. Texas, Austin) Stephane Perennes (CNRS U. A Time Complexity Bound for Adaptive Mutual Exclusion.- Quorum-Based Algorithms for Group Mutual Exclusion.- An Effective Characterization of Computability in Anonymous Networks.- Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System.- Optimal Unconditional Information Diffusion.- Computation Slicing: Techniques and Theory.- A Low-Latency Non-blocking Commit Service.- Stable Leader Election.- Adaptive Long-lived O(k 2)-Renaming with O(k 2) Steps.- A New Synchronous Lower Bound for Set Agreement.- The Complexity of Synchronous Iterative Do-All with Crashes.- Mobile Search for a Black Hole in an Anonymous Ring.- Randomised Mutual Search for k 2 Agents.- Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.- Self Stabilizing Distributed Queuing.- A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings.- Randomized Finite-state Distributed Algorithms As Markov Chains.- The Average Hop Count Measure For Virtual Path Layouts.- Efficient Routing in Networks with Long Range Contacts.- An Efficient Communication Strategy for Ad-hoc Mobile Networks.- A Pragmatic Implementation of Non-blocking Linked-lists.- Stabilizing Replicated Search Trees.- Adding Networks.\u003c\/p\u003e","brand":"Springer Verlag","offers":[{"title":"Default Title","offer_id":49165774586083,"sku":"00000_00000_00000_00000","price":54.99,"currency_code":"USD","in_stock":true}],"url":"https:\/\/usa.kinokuniya.com\/products\/9783540426059","provider":"Books Kinokuniya USA","version":"1.0","type":"link"}