Markovian Hitters and the Complexity of Blind Rendezvous
DOI10.1137/1.9781611974331.ch45zbMath1410.68157OpenAlexW4233569423MaRDI QIDQ4575623
Abhishek Samanta, Matthew Dippel, Ravi Sundaram, Sixia Chen, Alexander Russell
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
This page was built for publication: Markovian Hitters and the Complexity of Blind Rendezvous
