Markovian hitters and the complexity of blind rendezvous

DOI10.1137/1.9781611974331.CH45MaRDI QIDQ4575623zbMATH OpenOpenAlexFDO

Authors Sixia Chen, Matthew Dippel, Alexander Russell, Abhishek Samanta, Ravi Sundaram

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch45

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
• scientific article; zbMATH DE number 1552336
• Randomized Rendez-Vous with Limited Memory
• Oblivious rendezvous in cognitive radio networks
• Analysis of a randomized rendezvous algorithm

This page was built for publication: Markovian hitters and the complexity of blind rendezvous

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575623)