Distributed Computing 22nd International Symposium, DISC 2008, Arcachon, France, - gebrauchtes Buch

EAN (ISBN-13): 9783540877783
ISBN (ISBN-10): 3540877789
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2008
Herausgeber: Springer Berlin
522 Seiten
Gewicht: 0,821 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-12-15T17:51:56+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-08-27T03:18:57+02:00 (Berlin)
ISBN/EAN: 9783540877783

ISBN - alternative Schreibweisen:
3-540-87778-9, 978-3-540-87778-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fra, gadi taub
Titel des Buches: distributed computing, arcachon, disc, france, symposium, gadi, september 2008

---

Daten vom Verlag:

Autor/in: Gadi Taubenfeld
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Distributed Computing - 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings
Verlag: Springer; Springer Berlin
522 Seiten
Erscheinungsjahr: 2008-09-10
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Contact supplier
XVI, 522 p.

BC; Hardcover, Softcover / Informatik, EDV/Datenkommunikation, Netzwerke; Netzwerk-Hardware; Verstehen; Informatik; Byzantine processes; Routing; Switch; ad-hoc networks; algorithms; approximation algorithms; autonomous robots; broadcasting; complexity; concurrent programming; distributed algorithms; distributed applications; distributed computing; distributed objects; distributed systems; algorithm analysis and problem complexity; Computer Communication Networks; Algorithms; Programming Techniques; Theory of Computation; Operating Systems; Algorithmen und Datenstrukturen; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; Betriebssysteme; EA

Regular Papers.- The Mailbox Problem.- Matrix Signatures: From MACs to Digital Signatures in Distributed Systems.- How to Solve Consensus in the Smallest Window of Synchrony.- Local Terminations and Distributed Computability in Anonymous Networks.- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.- Fast Distributed Approximations in Planar Graphs.- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion.- The Weakest Failure Detector for Message Passing Set-Agreement.- Local Maps: New Insights into Mobile Agent Algorithms.- r 3: Resilient Random Regular Graphs.- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics.- Constant-Space Localized Byzantine Consensus.- Optimistic Erasure-Coded Distributed Storage.- On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing.- On Radio Broadcasting in Random Geometric Graphs.- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.- Deterministic Rendezvous in Trees with Little Memory.- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory.- Permissiveness in Transactional Memories.- The Synchronization Power of Coalesced Memory Accesses.- Optimizing Threshold Protocols in Adversarial Structures.- Hopscotch Hashing.- Computing Lightweight Spanners Locally.- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.- Leveraging Linial’s Locality Limit.- Continuous Consensus with Failures and Recoveries.- No Double Discount: Condition-Based Simultaneity Yields Limited Gain.- Bosco: One-Step ByzantineAsynchronous Consensus.- A Limit to the Power of Multiple Nucleation in Self-assembly.- Using Bounded Model Checking to Verify Consensus Algorithms.- Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks.- Brief Announcements.- Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.- The Dynamics of Probabilistic Population Protocols.- A Distributed Algorithm for Computing and Updating the Process Number of a Forest.- Brief Announcment: Corruption Resilient Fountain Codes.- Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.- Easy Consensus Algorithms for the Crash-Recovery Model.- Evaluating the Quality of a Network Topology through Random Walks.- Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems.- Data Failures.- Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network.- Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model.