{"id":"https://openalex.org/W1968428319","doi":"https://doi.org/10.1145/2213977.2214065","title":"Tight time-space tradeoff for mutual exclusion","display_name":"Tight time-space tradeoff for mutual exclusion","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W1968428319","doi":"https://doi.org/10.1145/2213977.2214065","mag":"1968428319"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214065","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of 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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038721025","display_name":"Vibhor Bhatt","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vibhor Bhatt","raw_affiliation_strings":["Microsoft Corporation, Redmon, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, Redmon, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000699482","display_name":"Prasad Jayanti","orcid":"https://orcid.org/0000-0002-8930-3467"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Jayanti","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA","Dartmouth College, Hanover NH, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Dartmouth College, Hanover NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016105675","display_name":"Ranganath Kondapally","orcid":"https://orcid.org/0000-0003-4625-1051"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ranganath Kondapally","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA","Dartmouth College, Hanover NH, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Dartmouth College, Hanover NH, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09254112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"971","last_page":"982"},"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.9912999868392944,"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.9890999794006348,"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.8993106484413147},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6947423219680786},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6071630716323853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5931012034416199},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5804528594017029},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5484755635261536},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5435225367546082},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.47372546792030334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4614250957965851},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4258066713809967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3758634924888611},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36793583631515503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2820950150489807},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2784556746482849},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.20700296759605408}],"concepts":[{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.8993106484413147},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6947423219680786},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6071630716323853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931012034416199},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5804528594017029},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5484755635261536},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5435225367546082},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.47372546792030334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4614250957965851},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4258066713809967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3758634924888611},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36793583631515503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2820950150489807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2784556746482849},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.20700296759605408},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2213977.2214065","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/695e695c-d69b-46be-a73a-3ec2f7cd718b","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/695e695c-d69b-46be-a73a-3ec2f7cd718b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Bhatt, V, Jayanti, P & Kondapally, R 2012, Tight time-space tradeoff for mutual exclusion. in Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12, New York NY, USA, May 19-22, 2012). Association for Computing Machinery, Inc., New York NY, pp. 971-981. https://doi.org/10.1145/2213977.2214065","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:736362","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=736362","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.423.6235","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.6235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~rangak/mutex.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.858.5348","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.858.5348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/%7Enikhil/pubs/mutex-bansal.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:736362","is_oa":false,"landing_page_url":"http://repository.tue.nl/736362","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/695e695c-d69b-46be-a73a-3ec2f7cd718b","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/695e695c-d69b-46be-a73a-3ec2f7cd718b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12, New York NY, USA, May 19-22, 2012), 971 - 981","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.8199999928474426,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320337818","display_name":"Rocky Mountain Research Station","ror":"https://ror.org/04347cr60"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1556276302","https://openalex.org/W1814330927","https://openalex.org/W1839084475","https://openalex.org/W1984883054","https://openalex.org/W1987782288","https://openalex.org/W2001738739","https://openalex.org/W2010418743","https://openalex.org/W2015956262","https://openalex.org/W2022907112","https://openalex.org/W2040637509","https://openalex.org/W2054987727","https://openalex.org/W2069278684","https://openalex.org/W2070908350","https://openalex.org/W2087801709","https://openalex.org/W2112383564","https://openalex.org/W2131910547","https://openalex.org/W2147270269","https://openalex.org/W2147275437","https://openalex.org/W2158583060","https://openalex.org/W2170523074","https://openalex.org/W2703407771","https://openalex.org/W4294549613","https://openalex.org/W6633363887","https://openalex.org/W6664093656"],"related_works":["https://openalex.org/W3046715470","https://openalex.org/W2531084474","https://openalex.org/W2059217922","https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W4288641573","https://openalex.org/W2328371232","https://openalex.org/W1481287275"],"abstract_inverted_index":{"Mutual":[0],"Exclusion":[1],"is":[2,55,64],"a":[3],"fundamental":[4],"problem":[5,11,24],"in":[6],"distributed":[7],"computing,":[8],"and":[9,15,34,60],"the":[10,19,76],"of":[12,22,47,73],"proving":[13],"upper":[14,35],"lower":[16,33],"bounds":[17,36],"on":[18,37],"RMR":[20,39,53,62],"complexity":[21,40,54,63],"this":[23],"has":[25],"been":[26],"extensively":[27],"studied.":[28],"Here,":[29],"we":[30],"give":[31],"matching":[32],"how":[38,74],"trades":[41],"off":[42],"with":[43,57,66],"space.":[44],"Two":[45],"implications":[46],"our":[48],"results":[49],"are":[50],"that":[51],"constant":[52,67],"impossible":[56,65],"subpolynomial":[58,61],"space":[59,68],"for":[69],"cache-coherent":[70],"multiprocessors,":[71],"regardless":[72],"strong":[75],"hardware":[77],"synchronization":[78],"operations":[79],"are.":[80]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}