{"id":"https://openalex.org/W2034325394","doi":"https://doi.org/10.1145/2108242.2108244","title":"Polylogarithmic concurrent data structures from monotone circuits","display_name":"Polylogarithmic concurrent data structures from monotone circuits","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2034325394","doi":"https://doi.org/10.1145/2108242.2108244","mag":"2034325394"},"language":"en","primary_location":{"id":"doi:10.1145/2108242.2108244","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2108242.2108244","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5036421091","display_name":"James Aspnes","orcid":"https://orcid.org/0000-0001-6188-1663"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James Aspnes","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029333678","display_name":"Hagit Attiya","orcid":"https://orcid.org/0000-0002-8017-6457"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Hagit Attiya","raw_affiliation_strings":["Technion, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036421091"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":6.44357553,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.96534997,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"59","issue":"1","first_page":"1","last_page":"24"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9848999977111816,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9491000175476074,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/binary-logarithm","display_name":"Binary logarithm","score":0.620373010635376},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.601384162902832},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5822871327400208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5560184717178345},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5356656312942505},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5080883502960205},{"id":"https://openalex.org/keywords/linearizability","display_name":"Linearizability","score":0.47757962346076965},{"id":"https://openalex.org/keywords/shift-register","display_name":"Shift register","score":0.4429454505443573},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4394069314002991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4280347228050232},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4200458824634552},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4134269654750824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37664687633514404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32571133971214294}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.620373010635376},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.601384162902832},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5822871327400208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5560184717178345},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5356656312942505},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5080883502960205},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.47757962346076965},{"id":"https://openalex.org/C49654631","wikidata":"https://www.wikidata.org/wiki/Q746165","display_name":"Shift register","level":3,"score":0.4429454505443573},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4394069314002991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4280347228050232},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4200458824634552},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4134269654750824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37664687633514404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32571133971214294},{"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/C165005293","wikidata":"https://www.wikidata.org/wiki/Q1074500","display_name":"Chip","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2108242.2108244","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2108242.2108244","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7133081940","display_name":null,"funder_award_id":"CNS-0435201","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"},{"id":"https://openalex.org/G7902483704","display_name":null,"funder_award_id":"953/06","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1490307003","https://openalex.org/W1526359699","https://openalex.org/W1599934884","https://openalex.org/W1948887950","https://openalex.org/W1975489634","https://openalex.org/W1993805917","https://openalex.org/W1997124359","https://openalex.org/W1999787317","https://openalex.org/W2021625445","https://openalex.org/W2023146810","https://openalex.org/W2030205622","https://openalex.org/W2030333832","https://openalex.org/W2086231977","https://openalex.org/W2101939036","https://openalex.org/W2128777897","https://openalex.org/W2147270269","https://openalex.org/W2911618284","https://openalex.org/W4251986490","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672"],"abstract_inverted_index":{"This":[0,27],"article":[1],"presents":[2],"constructions":[3],"of":[4,23,44,53,114,182,203,233,256,359,386,389,392,405,431],"useful":[5],"concurrent":[6,76,161],"data":[7,77,162],"structures,":[8],"including":[9],"max":[10,70,102,129,318,409],"registers":[11,110,150],"and":[12,84,174,216,264,335,415],"counters,":[13],"with":[14,133,200,411,424],"step":[15,36,60,429,448],"complexity":[16,37,312,430],"that":[17,38,79,88,164,178,277,287],"is":[18,39,64,104,131,194,229,275,285,305,321,351,367,376,435],"sublinear":[19],"in":[20,41,61,371,400,422],"the":[21,42,46,51,90,169,172,180,183,186,230,234,250,278,310,325,356,390,427,443],"number":[22,43,52,391],"processes,":[24],"n":[25,139,206,210,221,244,259,267,303,332,337,407,437,440],".":[26,148],"result":[28],"avoids":[29],"a":[30,65,69,73,81,85,112,145,159,175,195,201,225,306,352,368,373,380,401,432],"well-known":[31],"lower":[32,307,353],"bound":[33,308,327,354],"by":[34],"having":[35],"polylogarithmic":[40,447],"values":[45,189],"object":[47],"can":[48],"take":[49],"or":[50,125,143],"operations":[54,122,167,394,445],"applied":[55],"to":[56,141,153,171,212,223,297,324,378],"it.":[57,397],"The":[58],"key":[59],"these":[62],"implementations":[63],"method":[66],"for":[67,261,270,288,313,328,355],"constructing":[68],"register":[71,103,121,130,410],",":[72,98,138,209,220,334],"linearizable,":[74,197],"wait-free":[75,160,198],"structure":[78,163],"supports":[80],"write":[82,124,144,166,444],"operation":[83,87,177,358,375,434],"read":[86,142,176,357,374,433],"returns":[89,179],"largest":[91,187],"value":[92,146,181,232,381],"previously":[93,190,252],"written.":[94],"For":[95,236],"fixed":[96],"m":[97,100,118,301,315,329,341,346,361],"an":[99,214,246,314,360,383,406,412],"-valued":[101,316,362,408],"constructed":[105,132],"from":[106],"one-bit":[107],"multi-writer":[108],"multi-reader":[109],"at":[111,115],"cost":[113,134,202],"most":[116],"\u2308log":[117],"\u2309":[119,342,347],"atomic":[120],"per":[123],"read.":[126],"An":[127],"unbounded":[128],"O":[135,204,217,241,257,265],"(min(log":[136,205,218],"v":[137,147,208,219,228],"))":[140,211,222,350],"Max":[149],"are":[151,281,294],"used":[152],"transform":[154],"any":[155],"monotone":[156],"circuit":[157,173,184],"into":[158],"provides":[165],"setting":[168],"inputs":[170],"on":[185,249,309],"input":[188],"supplied.":[191],"One":[192],"application":[193],"simple,":[196],"counter":[199,370],"log":[207,340,345,439],"perform":[213,224],"increment":[215,393],"read,":[226],"where":[227],"current":[231],"counter.":[235],"polynomially-many":[237],"increments,":[238],"this":[239],"becomes":[240],"(log":[242],"2":[243,331],"),":[245],"exponential":[247],"improvement":[248],"best":[251],"known":[253],"upper":[254,279,326],"bounds":[255,280],"(":[258,266],")":[260,269,441],"exact":[262],"counting":[263],"4/5+\u03f5":[268],"approximate":[271],"counting.":[272],"Finally,":[273],"it":[274],"shown":[276,286],"almost":[282],"optimal.":[283],"It":[284],"deterministic":[289],"implementations,":[290],"even":[291,399],"if":[292,442],"they":[293],"only":[295],"required":[296],"satisfy":[298],"solo-termination,":[299],"min(\u2308log":[300],"\u2309,":[302],"-1)":[304],"worst-case":[311,428],"bounded":[317,369],"register,":[319],"which":[320,366,372],"exactly":[322],"equal":[323],"\u2264":[330],"-1":[333],"min(":[336],"-1,":[338],"\u2308":[339],"-":[343],"log(\u2308":[344],"+":[348],"k":[349,363,388],"-additive-accurate":[364],"counter,":[365],"allowed":[377],"return":[379],"within":[382],"additive":[384],"error":[385],"\u00b1":[387],"linearized":[395],"before":[396],"Furthermore,":[398],"solo-terminating":[402],"randomized":[403],"implementation":[404],"oblivious":[413],"adversary":[414],"global":[416],"coins,":[417],"there":[418],"exist":[419],"simple":[420],"schedules":[421],"which,":[423],"high":[425],"probability,":[426],"\u03a9(log":[436],"/log":[438],"have":[446],"complexity.":[449]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}