@Book{595129331,
title="Distributed algorithms: 3rd international workshop, Nice, France, September 26 - 28, 1989 ; proceedings",
series="Lecture notes in computer science 392",
year="1989",
publisher="Springer",
address="Berlin [u.a.]",
keywords="Electronic data processing; Distributed processing; Congresses; Computer algorithms; Computer Communication Networks; Computer software; Computer science; Operating systems (Computers); Computer networks; Computer systems; Algorithms; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Operating Systems",
abstract="Random leaders and random spanning trees -- Fault-tolerant critical section management in asynchronous networks -- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection -- Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm -- Combinatorics and geometry of consistent cuts : Application to concurrency theory -- Distributed fairness algorithms for local area networks with concurrent transmissions -- An efficient reliable ring protocol -- An efficient solution to the drinking philosophers problem and its extensions -- Highly concurrent logically synchronous multicast -- Reliable broadcast in synchronous and asynchronous environments (preliminary version) -- Observing global states of asynchronous distributed applications -- Building a global time on parallel machines -- Functional dependencies of variables in wait-free programs -- Two strategies for solving the vertex cover problem on a transputer network -- Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction -- Simple and efficient election algorithms for anonymous networks -- A distributed solution for detecting deadlock in distributed nested transaction systems -- Distributed deadlock detection and resolution with probes -- A new algorithm to implement causal ordering -- Symmetry breaking in asynchronous rings with o(n) messages -- Designing distributed algorithms by means of formal sequentially phased reasoning -- Possibility and impossibility results in a shared memory environment -- Communication heuristics in distributed combinatorial search algorithms -- The role of inhibition in asynchronous consistent-cut protocols -- How to construct an atomic variable (extended abstract) -- Electing a leader when processor identity numbers are not distinct (extended abstract).",
note="J.-C. Bermond ... (eds.)",
note="Literaturangaben",
note="Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive |2006||||||||||",
isbn="9783540467502",
doi="10.1007/3-540-51687-5",
url="http://www.springerlink.com/content/hw75870q6685",
url="http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-51687-3",
url="https://doi.org/10.1007/3-540-51687-5",
language="English"
}