Almost optimal algorithms for token collision in anonymous networks

DOI10.1016/J.TCS.2026.116244MaRDI QIDQ7396354zbMATH OpenFDO

Authors Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng

Publication date 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116244

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An information statistics approach to data stream and communication complexity
• Beyond set disjointness: the communication complexity of finding the intersection
• Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
• Distributed Computing: A Locality-Sensitive Approach
• scientific article; zbMATH DE number 1256781 (Why is no real title available?)
• scientific article; zbMATH DE number 7788511 (Why is no real title available?)
• Introduction to Distributed Algorithms
• Locality in Distributed Graph Algorithms
• Network Orientation
• On the distributional complexity of disjointness
• Quantum Algorithms for Element Distinctness
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum Walk Algorithm for Element Distinctness
• Simplifying Itai-Rodeh leader election for anonymous rings
• Symmetry breaking in distributed networks
• The Probabilistic Communication Complexity of Set Intersection
• The randomized communication complexity of set disjointness

This page was built for publication: Almost optimal algorithms for token collision in anonymous networks

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