{"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":17,"n_cols":5,"rows_kept":17,"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],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3],[12,2,12,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910861988203321"]
[null,null,"Autore",null,"Malkhi Dahlia"]
[null,null,"Titolo",null,"Concurrency"]
[null,null,"Pubbl/distr/stampa",null,"San Rafael : , : Morgan & Claypool Publishers, , 2019"]
[{"$nulls":4},"©2019"]
[null,null,"ISBN",null,"1-4503-7273-2"]
[null,null,"Descrizione fisica",null,"1 online resource (367 pages)"]
[null,null,"Disciplina",null,"004.36"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer algorithms"]
[{"$nulls":4},"Computer scientists"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- Contents -- Preface -- Photo and Text Credits -- Introduction -- The Computer Science of Concurrency: The Early Years -- PART I. TECHNICAL PERSPECTIVES ON LAMPORT'SWORK -- 1. Shared Memory and the Bakery Algorithm -- 2. The Notions of Time and Global State in a Distributed System -- 3. Byzantine Faults -- 4. State Machine Replication with Benign Failures -- 5. Formal Specification and Verification -- 6. Biography -- PART II. SELECTED PAPERS -- A New Solution of Dijkstra's Concurrent Programming Problem -- Clocks, and the Ordering of Events in a Distributed System -- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs -- The Byzantine Generals Problem -- The Mutual Exclusion Problem: Part I-A Theory of Interprocess Communication -- The Mutual Exclusion Problem: Part II-Statement and Solutions -- The Part-Time Parliament -- References -- Index -- Biographies -- Blank Page."]
[null,null,null,"Sommario/riassunto","This book is a celebration of Leslie Lamport's work on concurrency, interwoven in four-and-a-half decades of an evolving industry: from the introduction of the first personal computer to an era when parallel and distributed multiprocessors are abundant. His works lay formal foundations for concurrent computations executed by interconnected computers. Some of the algorithms have become standard engineering practice for fault tolerant distributed computing - distributed systems that continue to function correctly despite failures of individual components. He also developed a substantial body of work on the formal specification and verification of concurrent systems, and has "]
[{"$nulls":4},"contributed to the development of automated tools applying these methods."]