{"id":"https://openalex.org/W2703407771","doi":"https://doi.org/10.1007/s00446-002-0084-2","title":"An improved lower bound for the time complexity of mutual exclusion","display_name":"An improved lower bound for the time complexity of mutual exclusion","publication_year":2002,"publication_date":"2002-12-01","ids":{"openalex":"https://openalex.org/W2703407771","doi":"https://doi.org/10.1007/s00446-002-0084-2","mag":"2703407771"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-002-0084-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-002-0084-2","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed 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/A5038005371","display_name":"James H. Anderson","orcid":"https://orcid.org/0000-0002-3518-7341"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James H. Anderson","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel Hill, 27599-3175 Chapel Hill, NC, USA (e-mail: {anderson,kimy}@cs.unc.edu)\n, , , , , , US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, 27599-3175 Chapel Hill, NC, USA (e-mail: {anderson,kimy}@cs.unc.edu)\n, , , , , , US","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028005384","display_name":"Yong-Jik Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yong-Jik Kim","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel Hill, 27599-3175 Chapel Hill, NC, USA (e-mail: {anderson,kimy}@cs.unc.edu)\n, , , , , , US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, 27599-3175 Chapel Hill, NC, USA (e-mail: {anderson,kimy}@cs.unc.edu)\n, , , , , , US","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038005371"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":2.7764,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.92789847,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"4","first_page":"221","last_page":"253"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9965000152587891,"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.9944999814033508,"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/mutual-exclusion","display_name":"Mutual exclusion","score":0.8159540891647339},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7616591453552246},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7393224239349365},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6682629585266113},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6091583967208862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5627801418304443},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5242800116539001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4719369113445282},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.4638490676879883},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45590701699256897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.379564106464386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30140143632888794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2548311948776245}],"concepts":[{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.8159540891647339},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7616591453552246},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7393224239349365},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6682629585266113},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6091583967208862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5627801418304443},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5242800116539001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4719369113445282},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.4638490676879883},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45590701699256897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.379564106464386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30140143632888794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2548311948776245},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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.1007/s00446-002-0084-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-002-0084-2","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1555114151","https://openalex.org/W1567646530","https://openalex.org/W1576501033","https://openalex.org/W1814330927","https://openalex.org/W1979464238","https://openalex.org/W1983421343","https://openalex.org/W1990090334","https://openalex.org/W2001342371","https://openalex.org/W2001738739","https://openalex.org/W2010418743","https://openalex.org/W2011256599","https://openalex.org/W2024412809","https://openalex.org/W2024559175","https://openalex.org/W2026219473","https://openalex.org/W2069278684","https://openalex.org/W2070993796","https://openalex.org/W2105132338","https://openalex.org/W2124129198","https://openalex.org/W2147275437","https://openalex.org/W2170523074","https://openalex.org/W2220375753"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W3183901574","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}