New bounds for randomized busing

DOI10.1016/j.tcs.2004.09.039zbMath1070.68034OpenAlexW2099330176MaRDI QIDQ1770380

Robert F. Lax, Peter P. Chen, Guoli Ding, Steven S. Seiden, Jian-Hua Chen

Publication date: 6 April 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.039

zbMATH Keywords

Random walkComplete graphAnonymous communicationHitting time\(r\)-partite directed collarRandomized busing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Buses for anonymous message delivery
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Random Walks on Regular and Irregular Graphs
• Cryptographic defense against traffic analysis

This page was built for publication: New bounds for randomized busing