arXiv (OAI)open access
Improved Bounds for Coin Flipping, Leader Election, and Random Selection
computational complexity, cryptography and security, distributed, parallel, and cluster computing, 68q17, f.0
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 179140
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.