Gafni, Eli. <br/><br/>
Distributed Algorithms on Graphs. 

 - 1st ed. 
 - 1 online resource (203 pages) 
<br/><br/>Cover -- Title -- Copyright -- Preface -- Table of Contents -- Contributors -- 1. The bit complexity of probabilistic leader election on a unidirectional ring -- 2. Minimizing a virtual control token ring -- 3. New upperbounds for decentralized extrema-finding in a ring of processors -- 4. Efficient algorithms for routing information in a multicomputer system -- 5. Lower bounds on common knowledge in distributed algorithms -- 6. Scheme for efficiency-performance measures of distributed and parallel algorithms -- 7. Duplicate routing in distributed networks -- 8. Notes on distributed algorithms in unidirectional rings -- 9. Sense of direction and communication complexity in distributed networks -- 10. The communication complexity hierarchy in distributed computing -- 11. Simulation of chaotic algorithms by token algorithms -- 12. A general distributed graph algorithm for fair access to critical sections -- ADDENDA -- a. Open Problems -- b. A bibliography of distributed algorithms (1985) -- c. Author Index. 
<br/><br/> No detailed description available for "Distributed Algorithms on Graphs". 
<br/><br/><label>ISBN: </label>9780773573475 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Electronic data processing-Distributed processing-Congresses.<br/>Algorithms.
<br/><br/><label>Index Terms--Genre/Form: </label><br/>Electronic books.
<br/><br/><label>LC Class. No.: </label>QA76.9.D5 I67 1986 
<br/><br/><label>Dewey Class. No.: </label>004/.36