Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The round complexity of two-party random selection - MaRDI portal

The round complexity of two-party random selection

From MaRDI portal

Publication:3581433

Jump to:navigation, search

DOI10.1145/1060590.1060641zbMath1192.68281OpenAlexW2067378208MaRDI QIDQ3581433

Saurabh Sanghvi, Salil P. Vadhan

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467487

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12)

Related Items (1)

High entropy random selection protocols

This page was built for publication: The round complexity of two-party random selection

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3581433&oldid=16987671"