Randomized rendezvous with limited memory

From MaRDI portal

Revision as of 22:00, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3189017

Jump to:navigation, search

DOI10.1145/1978782.1978789zbMath1295.68050OpenAlexW2086702855MaRDI QIDQ3189017

Pat Morin, Danny Krizanc, Evangelos Kranakis

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

rendezvous distributed computing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Related Items (4)

Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Anonymous meeting in networks

This page was built for publication: Randomized rendezvous with limited memory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3189017&oldid=16337692"