Asynchronous Coordination Under Preferences and Constraints

DOI10.1007/978-3-319-48314-6_8zbMath1482.68054OpenAlexW2547284121MaRDI QIDQ2835020

Eli Gafni, Sergio Rajsbaum, Pierre Fraigniaud, Armando Castañeda, Matthieu Roy

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (1)

The assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• The renaming problem in shared memory systems: an introduction
• Restrictions of graph partition problems. I
• Scheduling with conflicts: Online and offline algorithms
• From adaptive renaming to set agreement
• Mutual exclusion scheduling
• Multicoloring trees.
• Musical Chairs
• Oblivious Collaboration
• Distributed Computing by Mobile Robots: Gathering
• The topological structure of asynchronous computability
• Concurrent Programming: Algorithms, Principles, and Foundations
• Renaming in an asynchronous environment
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Atomic snapshots of shared memory
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Immediate atomic snapshots and fast renaming

This page was built for publication: Asynchronous Coordination Under Preferences and Constraints