{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":16,"n_cols":5,"rows_kept":16,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[9,2,9,3],[10,2,10,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910967286103321"]
[null,null,"Titolo",null,"Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms, Ottawa, Canada, August 1985 / / edited by Eli Gafni and Nicola Santoro"]
[null,null,"Pubbl/distr/stampa",null,"Ottawa, : Carleton University Press, 1986"]
[null,null,"ISBN",null,"0-7735-7347-X"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (200 p.)"]
[null,null,"Disciplina",null,"004/.36"]
[null,null,"Soggetti",null,"Electronic data processing - Distributed processing"]
[{"$nulls":4},"Algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,null,"Nota di bibliografia","Includes bibliography and index."]
[null,null,"Nota di contenuto",null,"Front Matter -- Contents -- The Bit Complexity of Probabilistic Leader Election on a Unidirectional Ring -- Minimizing a Virtual Control Token Ring -- New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors -- Efficient Algorithmsfor Routing Information in a Multicomputer System -- Lower Bounds on Common Knowledge in Distributed Algorithms -- Scheme for Efficiency-Performance Measures of Distributed and Parallel Algorithms -- Duplicate Routing in Distributed Networks -- Notes on Distributed Algorithms in Unidirectional Rings -- Sense of Direction and Communication Complexity in Distributed Networks -- The Communication Complexity Hierarchy in Distributed Computing -- Simulation of Chaotic Algorithms by Token Algorithms -- A General Distributed Graph Algorithm for Fair Access to Critical Sections -- Addenda -- Open Problems -- A Bibliography of Distributed Algorithms -- Author Index"]
[null,null,null,"Sommario/riassunto","This volume contains papers presented at the First International Workshop on Distributed Algorithms. The papers present solutions to a wide spectrum of problems (leader election, resource allocation, routing, etc.) and focus on a variety of issues that influence communications complexity."]