{"id":"https://openalex.org/W2581540022","doi":"https://doi.org/10.1007/s00165-016-0407-x","title":"Tournaments for mutual exclusion: verification and concurrent complexity","display_name":"Tournaments for mutual exclusion: verification and concurrent complexity","publication_year":2017,"publication_date":"2017-01-27","ids":{"openalex":"https://openalex.org/W2581540022","doi":"https://doi.org/10.1007/s00165-016-0407-x","mag":"2581540022"},"language":"lv","primary_location":{"id":"doi:10.1007/s00165-016-0407-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0407-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0407-x.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0407-x.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022758187","display_name":"Wim H. Hesselink","orcid":"https://orcid.org/0000-0002-1413-4320"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Wim H. Hesselink","raw_affiliation_strings":["Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, P.O.Box 407, 9700 AK, Groningen, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1413-4320","affiliations":[{"raw_affiliation_string":"Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, P.O.Box 407, 9700 AK, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022758187"],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":null,"apc_paid":null,"fwci":0.2195,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.55134825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"5","first_page":"833","last_page":"852"},"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.9998999834060669,"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.9998999834060669,"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.9882000088691711,"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.9878000020980835,"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/computer-science","display_name":"Computer science","score":0.623577892780304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5856906771659851},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5340729355812073},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5258272886276245},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.5221979022026062},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5128788948059082},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.41339343786239624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2946966290473938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19492065906524658},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18082460761070251}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.623577892780304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5856906771659851},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5340729355812073},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5258272886276245},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.5221979022026062},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5128788948059082},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.41339343786239624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2946966290473938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19492065906524658},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18082460761070251}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00165-016-0407-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0407-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0407-x.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/58d31e18-f762-4200-a7e0-ae7cc737cbfa","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/58d31e18-f762-4200-a7e0-ae7cc737cbfa","pdf_url":"https://research.rug.nl/files/47419543/Tournaments_for_mutual_exclusion_verification_and_concurrent_complexity.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hesselink, W H 2017, 'Tournaments for mutual exclusion : verification and concurrent complexity', Formal Aspects of Computing, vol. 29, no. 5, pp. 833-852. https://doi.org/10.1007/s00165-016-0407-x","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:publications/58d31e18-f762-4200-a7e0-ae7cc737cbfa","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/58d31e18-f762-4200-a7e0-ae7cc737cbfa","pdf_url":"https://pure.rug.nl/ws/files/47419543/Tournaments_for_mutual_exclusion_verification_and_concurrent_complexity.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hesselink, W H 2017, 'Tournaments for mutual exclusion : verification and concurrent complexity', Formal Aspects of Computing, vol. 29, no. 5, pp. 833-852. https://doi.org/10.1007/s00165-016-0407-x","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00165-016-0407-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0407-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0407-x.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8199999928474426,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2581540022.pdf","grobid_xml":"https://content.openalex.org/works/W2581540022.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W197500586","https://openalex.org/W1481018260","https://openalex.org/W1499148852","https://openalex.org/W1593488045","https://openalex.org/W1857327297","https://openalex.org/W1964727056","https://openalex.org/W1971153585","https://openalex.org/W1972316716","https://openalex.org/W2001738739","https://openalex.org/W2034343921","https://openalex.org/W2036267700","https://openalex.org/W2040637509","https://openalex.org/W2056740525","https://openalex.org/W2060457190","https://openalex.org/W2070908350","https://openalex.org/W2094104092","https://openalex.org/W2113863982","https://openalex.org/W2145662215","https://openalex.org/W2159282193","https://openalex.org/W2164578853","https://openalex.org/W2165821496","https://openalex.org/W2170523074","https://openalex.org/W2322615457","https://openalex.org/W2569787747","https://openalex.org/W4213369217","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W3123786980","https://openalex.org/W4287997709","https://openalex.org/W2994965880","https://openalex.org/W3083287393","https://openalex.org/W3094108612","https://openalex.org/W3125314910","https://openalex.org/W2982074041","https://openalex.org/W2066305403","https://openalex.org/W2032550399","https://openalex.org/W2033140592"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,17,35],"mutual":[3,18],"exclusion":[4,19],"algorithm":[5,20,108],"MXd":[6,95],"for":[7,21],"<mml:math":[8,22],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[9,23],"<mml:mrow>":[10,24],"<mml:mi>d</mml:mi>":[11,27],"<mml:mo>\u2265</mml:mo>":[12],"<mml:mn>2</mml:mn>":[13],"</mml:mrow>":[14,28],"</mml:math>":[15,29],"threads,":[16],"<mml:mi>N</mml:mi>":[25],"<mml:mo>&gt;</mml:mo>":[26],"threads":[30],"can":[31],"be":[32],"built":[33],"in":[34,71,90],"tree":[36,83],"of":[37,50,73,78,105,110],"degree":[38],"d":[39],"with":[40,43],"N":[41,91,112],"leaves,":[42],"the":[44,48,51,65,69,82,86,100,106],"critical":[45],"section":[46],"at":[47],"root":[49],"tree.":[52],"This":[53,114],"tournament":[54,107],"solution":[55],"seems":[56],"obviously":[57],"correct":[58],"and":[59,67],"efficient.":[60],"The":[61],"present":[62],"note":[63],"proves":[64],"correctness,":[66],"formalizes":[68],"efficiency":[70],"terms":[72],"concurrent":[74],"complexity":[75],"by":[76],"means":[77],"Bounded":[79],"Unity.":[80],"If":[81,93],"is":[84,88,109,115],"balanced,":[85],"throughput":[87],"logarithmic":[89],".":[92,113],"moreover":[94],"satisfies":[96],"FCFS":[97],"(first-come":[98],"first-served),":[99],"worst":[101],"case":[102],"individual":[103],"delay":[104],"order":[111],"optimal.":[116]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}