Abstract
The BIRS-CMO workshop on Complexity and Analysis of Distributed Algorithms ran from November 27 to December 2, 2016, and was organized by Hagit Attiya, Sergio Rajsbaum, and Philipp Woelfel. The objective of the workshop was to bring together researchers to exchange ideas on how to advance the design and analysis of algorithms for problems in distributed systems. Topics covered included theory of shared memory algorithms, networks and message-passing systems, applications of combinatorics and topology to concurrency. The attendees were a mix of theoreticians and systems researchers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
