{"id":"https://openalex.org/W1984298275","doi":"https://doi.org/10.1137/050641715","title":"The Round Complexity of Two-Party Random Selection","display_name":"The Round Complexity of Two-Party Random Selection","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1984298275","doi":"https://doi.org/10.1137/050641715","mag":"1984298275"},"language":"en","primary_location":{"id":"doi:10.1137/050641715","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050641715","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dash.harvard.edu/bitstream/1/41467487/1/86379%20randsel-eccc.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043007739","display_name":"Saurabh Sanghvi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134579","display_name":"Dana-Farber/Harvard Cancer Center","ror":"https://ror.org/03pvyf116","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I136199984","https://openalex.org/I4210117453","https://openalex.org/I4210134579"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saurabh Sanghvi","raw_affiliation_strings":["ssanghvi@post.harvard.edu and salil@eecs.harvard.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ssanghvi@post.harvard.edu and salil@eecs.harvard.edu#TAB#","institution_ids":["https://openalex.org/I4210134579"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["Division of Engineering & Applied Sciences Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Engineering & Applied Sciences Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6894,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91238305,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"38","issue":"2","first_page":"523","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7438000440597534},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.7422879934310913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.66148841381073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6145957112312317},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6110128164291382},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6074402928352356},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5963851809501648},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5963137745857239},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.481948584318161},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4793044626712799},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4625721573829651},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.44951677322387695},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42253488302230835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20360669493675232},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.18263357877731323}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7438000440597534},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7422879934310913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.66148841381073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6145957112312317},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6110128164291382},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6074402928352356},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5963851809501648},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5963137745857239},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.481948584318161},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4793044626712799},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4625721573829651},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.44951677322387695},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42253488302230835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20360669493675232},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.18263357877731323},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/050641715","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050641715","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dash.harvard.edu:1/41467487","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467487","pdf_url":"https://dash.harvard.edu/bitstream/1/41467487/1/86379%20randsel-eccc.pdf","source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/41467487","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467487","pdf_url":"https://dash.harvard.edu/bitstream/1/41467487/1/86379%20randsel-eccc.pdf","source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G286214036","display_name":"CAREER: A Unified Theory of Pseudorandomness","funder_award_id":"0133096","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5027236504","display_name":"New Complexity-Theoretic Techniques in Cryptography","funder_award_id":"0430336","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6550371215","display_name":null,"funder_award_id":"N00014-04-1-0478","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309622","display_name":"Harvard University","ror":"https://ror.org/03vek6s52"},{"id":"https://openalex.org/F4320332388","display_name":"Radcliffe Institute for Advanced Study, Harvard University","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1984298275.pdf","grobid_xml":"https://content.openalex.org/works/W1984298275.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1980985945","https://openalex.org/W1994659270","https://openalex.org/W2036095420","https://openalex.org/W2049198367","https://openalex.org/W2080556744","https://openalex.org/W2089592270","https://openalex.org/W2115000186","https://openalex.org/W2118642652","https://openalex.org/W2130960476","https://openalex.org/W3030428504"],"related_works":["https://openalex.org/W4318195686","https://openalex.org/W2975999359","https://openalex.org/W4287173569","https://openalex.org/W2796561647","https://openalex.org/W1629966990","https://openalex.org/W1983915440","https://openalex.org/W1488969083","https://openalex.org/W2949391255","https://openalex.org/W2089439745","https://openalex.org/W3095925971"],"abstract_inverted_index":{"We":[0,62,130,158],"study":[1],"the":[2,16,28,33,44,49,67,91,103,164,167,173,183],"round":[3],"complexity":[4],"of":[5,27,83,112,185],"two-party":[6],"protocols":[7],"for":[8,66,163],"generating":[9],"a":[10,57,64,79,98,133,179,186],"random":[11],"n-bit":[12],"string":[13],"such":[14],"that":[15,43,70,102,139],"output":[17,104],"is":[18,54,170],"guaranteed":[19],"to":[20],"have":[21],"bounded":[22,55,143],"\u201cbias,\u201d":[23],"even":[24],"if":[25],"one":[26],"two":[29],"parties":[30],"deviates":[31],"from":[32,48],"protocol":[34,65,82,95,141],"(possibly":[35],"using":[36],"unlimited":[37],"computational":[38],"resources).":[39],"Specifically,":[40],"we":[41],"require":[42],"output's":[45,168],"statistical":[46,144],"difference":[47,145],"uniform":[50],"distribution":[51],"on":[52],"$\\{0,1\\}^n$":[53],"by":[56,172,177],"constant":[58],"less":[59],"than":[60],"1.":[61],"present":[63],"above":[68],"problem":[69],"has":[71],"$2":[72],"\\log^*":[73,152,153],"n":[74,150,154],"+":[75,120],"O(1)$":[76,156],"rounds,":[77],"improving":[78],"previous":[80],"$2n$-round":[81],"Goldreich,":[84],"Goldwasser,":[85],"and":[86],"Linial":[87],"(FOCS":[88],"'91).":[89],"Like":[90],"GGL":[92],"Protocol,":[93],"our":[94],"actually":[96],"provides":[97],"stronger":[99],"guarantee,":[100],"ensuring":[101],"lands":[105],"in":[106],"any":[107,140],"set":[108,187],"$T":[109,188],"\\subseteq":[110,189],"\\{0,1\\}^n$":[111],"density":[113],"$\\mu$":[114],"with":[115],"probability":[116,184],"at":[117,147],"most":[118],"$O(\\sqrt{\\mu":[119],"\\delta})$,":[121],"where":[122],"$\\delta$":[123],"may":[124],"be":[125],"an":[126],"arbitrarily":[127],"small":[128],"constant.":[129],"then":[131],"prove":[132,160],"nearly":[134],"matching":[135],"lower":[136],"bound,":[137],"showing":[138],"guaranteeing":[142],"requires":[146],"least":[148],"$\\log^*":[149],"-":[151,155],"rounds.":[157],"also":[159],"several":[161],"results":[162],"case":[165],"when":[166],"bias":[169],"measured":[171],"maximum":[174],"multiplicative":[175],"factor":[176],"which":[178],"party":[180],"can":[181],"increase":[182],"\\{0,1\\}^n$.":[190]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-02T14:50:37.381335","created_date":"2025-10-10T00:00:00"}