The round complexity of two-party random selection

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Saurabh Sanghvi Harvard University, Cambridge, MA
Salil Vadhan Harvard University, Cambridge, MA
Published in:
· Proceeding
STOC '05 Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pages 338-347
ACM New York, NY, USA ©2005
table of contents ISBN:1-58113-960-8 doi>10.1145/1060590.1060641
The round complexity of two-party random selection Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 10
· Downloads (cumulative): 244
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder