How to meet when you forget

DOI10.1145/1835698.1835801zbMath1315.68199OpenAlexW2083418734MaRDI QIDQ5176220

Andrzej Pelc, Adrian Kosowski, Jurek Czyzowicz

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835801

zbMATH Keywords

rendezvousexplorationcompact data structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (4)

Drawing maps with advice ⋮ How much memory is needed for leader election ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Unnamed Item

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: How to meet when you forget