9783540426059 - Distributed Computing: 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings: 2180 (Lecture Notes in Computer Science, 2180) de... (16 resultados)

X, 341 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2180. Sprache: Englisch.

paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Condición: Good. Used - Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre.' Ex-library, but has been well cared for. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Condición: As New. Unread book in perfect condition.

Condición: New. In.

PF. Condición: New.

Paperback. Condición: New. 2001 ed. DISC, 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 AandM 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.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - DISC, 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&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.

Taschenbuch. Condición: Neu. Distributed Computing | 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings | Jennifer L. Welch | Taschenbuch | x | Englisch | 2001 | Springer | EAN 9783540426059 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condición: New. 2001st.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -DISC, 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&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. 360 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 F.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 360 pp. Englisch.