"Distributed Computing Through Combinatorial Topology" describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols.

Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further.
Named a 2013 Notable Computer Book for Computing Methodologies by "Computing Reviews"Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises

This book constitutes the refereed proceedings of the 30th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2023, held in Alcalá de Henares, Spain, during June 6–9, 2023. The 26 full papers presented in this book were carefully reviewed and selected from 48 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication. This is the 30th edition of SIROCCO, and 3 of the 26 papers in this book are devoted to celebrating this fact, plus an additional paper about a recent trend to study special models of computation.

This book constitutes the proceedings of the 15th International Conference on Distributed Computing and Networking, ICDCN 2014, held in Coimbatore, India, in January 2014. The 32 full papers and 8 short papers presented in this volume were carefully reviewed and selected from 110 submissions. They are organized in topical sections named: mutual exclusion, agreement and consensus; parallel and multi-core computing; distributed algorithms; transactional memory; P2P and distributed networks; resource sharing and scheduling; cellular and cognitive radio networks and backbone networks.

This book constitutes the refereed proceedings of the Third Latin-American Symposium on Dependable Computing, LADC 2007, held in Morelia, Mexico, in September 2007.

The 14 revised full papers presented together with 2 invited talks, and outlines of 3 tutorials and 2 panel sessions, were carefully reviewed and selected from 37 submissions. The papers are organized in topical sections on fault-tolerant algorithms, software engineering of dependable systems, networking and mobile computing, experimental dependability evaluation, as well as intrusion tolerance and security.

This book constitutes the refereed proceedings of the 5th International Symposium, Latin American Theoretical Informatics, LATIN 2002, held in Cancun, Mexico, in April 2002.The 44 revised full papers presented together with a tutorial and 7 abstracts of invited contributions were carefully reviewed and selected from a total of 104 submissions. The papers presented are devoted to a broad range of topics from theoretical computer science and mathematical foundations, with a certain focus on algorithmics and computations related to discrete structures.