{"id":"https://openalex.org/W4380881059","doi":"https://doi.org/10.1145/3583668.3594602","title":"Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds","display_name":"Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380881059","doi":"https://doi.org/10.1145/3583668.3594602"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594602","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3583668.3594602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5063151150","display_name":"A.H. Tran","orcid":"https://orcid.org/0009-0006-2546-9202"},"institutions":[{"id":"https://openalex.org/I131221577","display_name":"Bucknell University","ror":"https://ror.org/00fc1qt65","country_code":"US","type":"education","lineage":["https://openalex.org/I131221577"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anh Tran","raw_affiliation_strings":["Bucknell University, Lewisburg, PA, USA"],"raw_orcid":"https://orcid.org/0009-0006-2546-9202","affiliations":[{"raw_affiliation_string":"Bucknell University, Lewisburg, PA, USA","institution_ids":["https://openalex.org/I131221577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043782618","display_name":"Edward Talmage","orcid":"https://orcid.org/0009-0001-9108-6190"},"institutions":[{"id":"https://openalex.org/I131221577","display_name":"Bucknell University","ror":"https://ror.org/00fc1qt65","country_code":"US","type":"education","lineage":["https://openalex.org/I131221577"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edward Talmage","raw_affiliation_strings":["Bucknell University, Lewisburg, PA, United States of America"],"raw_orcid":"https://orcid.org/0009-0001-9108-6190","affiliations":[{"raw_affiliation_string":"Bucknell University, Lewisburg, PA, United States of America","institution_ids":["https://openalex.org/I131221577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063151150"],"corresponding_institution_ids":["https://openalex.org/I131221577"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0708798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":null,"first_page":"370","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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":1.0,"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/T10142","display_name":"Formal Methods in Verification","score":0.9939000010490417,"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/T12288","display_name":"Optimization and Search Problems","score":0.9879999756813049,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7735611796379089},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6389366984367371},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6375036239624023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5711960196495056},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.48617810010910034},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.4636152386665344},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.44323208928108215},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.389661967754364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32424020767211914}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7735611796379089},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6389366984367371},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6375036239624023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5711960196495056},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.48617810010910034},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.4636152386665344},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.44323208928108215},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.389661967754364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32424020767211914},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3583668.3594602","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3583668.3594602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.bucknell.edu:fac_conf-1083","is_oa":false,"landing_page_url":"https://digitalcommons.bucknell.edu/fac_conf/74","pdf_url":null,"source":{"id":"https://openalex.org/S4377196650","display_name":"Bucknell Digital Commons (Bucknell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I131221577","host_organization_name":"Bucknell University","host_organization_lineage":["https://openalex.org/I131221577"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Conference Papers and Presentations","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2035918100","https://openalex.org/W2065180040","https://openalex.org/W2082679906","https://openalex.org/W2254089943","https://openalex.org/W2296665256","https://openalex.org/W2342859886","https://openalex.org/W2889895855","https://openalex.org/W2944186964","https://openalex.org/W3128673518","https://openalex.org/W4285182826","https://openalex.org/W4377299732"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"A":[0],"multiplicity":[1,57],"queue":[2,16],"is":[3,127,207],"a":[4,13,105,144],"concurrently-defined":[5],"data":[6],"type":[7],"which":[8,126,167,190],"relaxes":[9],"the":[10,24,64,96,117,130,198,213],"conditions":[11],"of":[12,186,201,212],"linearizable":[14],"FIFO":[15],"by":[17],"allowing":[18],"concurrent":[19,49],"Dequeue":[20,121],"instances":[21],"to":[22,42,46,85,120,129,147,193],"return":[23],"same":[25],"value.":[26],"It":[27],"would":[28],"seem":[29],"that":[30,56,72,116,149,155],"this":[31,87],"should":[32,39],"allow":[33,173,191],"faster":[34],"message-passing":[35],"implementations,":[36],"as":[37,44,216],"processes":[38],"not":[40],"need":[41],"wait":[43],"long":[45],"learn":[47],"about":[48],"operations":[50],"and":[51,91],"previous":[52],"work":[53,69],"has":[54,70],"shown":[55,71],"queues":[58],"are":[59,152],"computationally":[60],"less":[61],"complex":[62],"than":[63,177],"unrelaxed":[65,82,135],"version.":[66],"Intriguingly,":[67],"recent":[68],"there":[73],"is,":[74],"in":[75,184,227],"fact,":[76],"little":[77],"possible":[78],"speedup":[79],"versus":[80],"an":[81,134,140,208],"queue.":[83],"Seeking":[84],"understand":[86],"difference":[88],"between":[89],"intuition":[90],"real":[92],"behavior,":[93],"we":[94,103,162],"increase":[95],"lower":[97,113,160,175,219],"bound":[98,142,220],"for":[99,110,133,143],"uniform":[100],"algorithms.":[101],"Further,":[102],"outline":[104],"path":[106],"toward":[107],"building":[108],"proofs":[109,189,196],"even":[111],"higher":[112],"bounds,":[114,161],"hypothesizing":[115],"worst-case":[118],"time":[119,131],"approaches":[122],"maximum":[123],"message":[124],"delay,":[125],"similar":[128],"required":[132],"Dequeue.":[136],"We":[137,181],"also":[138],"give":[139],"upper":[141],"special":[145],"case":[146],"show":[148],"our":[150,159,195],"bounds":[151,176],"tight":[153],"at":[154],"point.":[156],"To":[157],"achieve":[158],"use":[163,182],"extended":[164],"shifting":[165,179,202],"arguments,":[166],"have":[168,224],"been":[169],"rarely":[170],"used":[171],"but":[172],"larger":[174],"traditional":[178],"arguments.":[180,203],"these":[183],"series":[185],"inductive":[187],"indistinguishability":[188],"us":[192],"extend":[194],"beyond":[197],"usual":[199],"limitations":[200],"This":[204],"proof":[205,221],"structure":[206],"interesting":[209],"contribution":[210],"independently":[211],"main":[214],"result,":[215],"developing":[217],"new":[218],"techniques":[222],"may":[223],"many":[225],"uses":[226],"future":[228],"work.":[229]},"counts_by_year":[],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}