{"id":"https://openalex.org/W2144077075","doi":"https://doi.org/10.1137/0219032","title":"Flipping Persuasively in Constant Time","display_name":"Flipping Persuasively in Constant Time","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2144077075","doi":"https://doi.org/10.1137/0219032","mag":"2144077075"},"language":"en","primary_location":{"id":"doi:10.1137/0219032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219032","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011820318","display_name":"Cynthia Dwork","orcid":"https://orcid.org/0000-0001-7177-3738"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia Dwork","raw_affiliation_strings":["IBM Research Divisions, San Jose, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research Divisions, San Jose, CA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030030349","display_name":"David B. Shmoys","orcid":"https://orcid.org/0000-0003-3882-901X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Shmoys","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111558966","display_name":"Larry Stockmeyer","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Larry Stockmeyer","raw_affiliation_strings":["Cornell University (Ithaca, NY);"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9776,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81560766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"3","first_page":"472","last_page":"499"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9980999827384949,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9794999957084656,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7592799663543701},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7370812892913818},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.630813479423523},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.596733570098877},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5595457553863525},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5267364978790283},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5225164890289307},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.511751651763916},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4999573230743408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45231738686561584},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.451028972864151},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.44997793436050415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43853816390037537},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4193720519542694},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11651113629341125}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7592799663543701},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7370812892913818},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.630813479423523},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.596733570098877},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5595457553863525},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5267364978790283},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5225164890289307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.511751651763916},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4999573230743408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45231738686561584},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.451028972864151},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.44997793436050415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43853816390037537},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4193720519542694},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11651113629341125},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0219032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219032","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W193706516","https://openalex.org/W1964052655","https://openalex.org/W1999522397","https://openalex.org/W2014772227","https://openalex.org/W2034791526","https://openalex.org/W2035362408","https://openalex.org/W2039164882","https://openalex.org/W2125856931","https://openalex.org/W2126924915","https://openalex.org/W2141420453","https://openalex.org/W2751862591","https://openalex.org/W4210300416"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2899261484","https://openalex.org/W1525123833","https://openalex.org/W2036758175","https://openalex.org/W1552026372","https://openalex.org/W2962985337","https://openalex.org/W3184929353","https://openalex.org/W1972433940"],"abstract_inverted_index":{"A":[0],"persuasive":[1,26],"coin":[2,27],"is":[3,21,47,100,131],"a":[4,16,25,76,84,105,108,112],"sufficiently":[5,12],"unbiased":[6],"source":[7],"of":[8,31,39,41,50,54,64,70,80,107,110,118],"randomness":[9],"visible":[10],"to":[11],"many":[13],"processors":[14,46,55,72],"in":[15,28,56,96],"distributed":[17],"system.":[18],"An":[19],"algorithm":[20],"described":[22],"for":[23,92],"achieving":[24],"the":[29,37,45,51,57,62,67],"presence":[30],"an":[32,86],"extremely":[33],"powerful":[34],"adversary":[35],"where":[36],"number":[38,52,63,69],"rounds":[40],"message":[42],"exchange":[43],"among":[44],"constant,":[48],"independent":[49],"n":[53],"system":[58],"as":[59,61],"well":[60],"faults,":[65],"provided":[66],"total":[68],"faulty":[71],"does":[73],"not":[74],"exceed":[75],"certain":[77],"constant":[78,97],"multiple":[79],"$n/\\log":[81],"n$.":[82],"As":[83],"corollary":[85],"$\\Omega":[87],"(n/\\log":[88],"n)$-resilient":[89],"probabilistic":[90,113],"protocol":[91,116],"Byzantine":[93,114],"agreement":[94,115],"running":[95,129],"expected":[98,128],"time":[99,130],"obtained.":[101,132],"Combining":[102],"this":[103],"with":[104,124],"generalization":[106],"technique":[109],"Bracha,":[111],"tolerant":[117],"almost":[119],"${n":[120],"/":[121],"4}$":[122],"failures":[123],"$O(\\log":[125],"\\log":[126],"n)$":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}