High Entropy Random Selection Protocols

DOI10.1007/978-3-540-74208-1_27MaRDI QIDQ3603478zbMATH OpenOpenAlexFDO

Authors Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_27

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• High entropy random selection protocols
• Random selection in few rounds
• The Round Complexity of Two-Party Random Selection
• Random Selection with an Adversarial Majority
• Randomness in distribution protocols

Cited in

(4)

• Random Selection with an Adversarial Majority
• Random selection in few rounds
• High entropy random selection protocols
• The Round Complexity of Two-Party Random Selection

This page was built for publication: High Entropy Random Selection Protocols

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