{"id":"https://openalex.org/W3033558270","doi":"https://doi.org/10.1145/3386164.3386182","title":"Naming Anonymous Processes with Test-and-Set Registers","display_name":"Naming Anonymous Processes with Test-and-Set Registers","publication_year":2019,"publication_date":"2019-09-25","ids":{"openalex":"https://openalex.org/W3033558270","doi":"https://doi.org/10.1145/3386164.3386182","mag":"3033558270"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3386164.3386182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5072835212","display_name":"Layla S. Aldawsari","orcid":"https://orcid.org/0009-0008-5425-415X"},"institutions":[{"id":"https://openalex.org/I921990950","display_name":"University of Colorado Denver","ror":"https://ror.org/02hh7en24","country_code":"US","type":"education","lineage":["https://openalex.org/I921990950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Layla S. Aldawsari","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Colorado Denver and College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Colorado Denver and College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University","institution_ids":["https://openalex.org/I921990950"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072835212"],"corresponding_institution_ids":["https://openalex.org/I921990950"],"apc_list":null,"apc_paid":null,"fwci":0.15,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.508821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":61,"max":69},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997,"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.9997,"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.998,"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/T10237","display_name":"Cryptography and Data Security","score":0.9975,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/randomized-algorithm","display_name":"Randomized Algorithm","score":0.42891958}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.75662196},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7458267},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6705065},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6315033},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.51440173},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.50580144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.502012},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42891958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42393798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15261224},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3386164.3386182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1595409123","https://openalex.org/W164544547","https://openalex.org/W1795399553","https://openalex.org/W1966074520","https://openalex.org/W1968191405","https://openalex.org/W2047846644","https://openalex.org/W2054439685","https://openalex.org/W2071226137","https://openalex.org/W2079376185","https://openalex.org/W2080862022","https://openalex.org/W2089155578","https://openalex.org/W2143754788","https://openalex.org/W2295428206","https://openalex.org/W2567788443","https://openalex.org/W2619218210","https://openalex.org/W2888877993","https://openalex.org/W2899702797","https://openalex.org/W3103028663","https://openalex.org/W4231916799"],"related_works":["https://openalex.org/W4391009474","https://openalex.org/W4313227037","https://openalex.org/W4307416302","https://openalex.org/W4286663615","https://openalex.org/W4234010763","https://openalex.org/W339301305","https://openalex.org/W2947276586","https://openalex.org/W2913308506","https://openalex.org/W2565109825","https://openalex.org/W2091573779"],"abstract_inverted_index":{"A":[0],"system":[1],"of":[2,36,53,69,76,79,130,147,153,156,165,172,195],"anonymous":[3,54,96],"processes":[4,22,46,55,173],"that":[5,90],"have":[6],"no":[7],"names":[8,43,94],"assigned":[9],"to":[10,40,44,95,186,192],"them":[11],"is":[12,39,56,99,104,122,139,160,174],"considered":[13],"in":[14,58,111,197],"both":[15],"synchronous":[16],"and":[17,26,73,101,114],"asynchronous":[18],"communication":[19],"models.":[20],"The":[21,34,51,106,117,176],"are":[23,88,109],"fault":[24],"free":[25],"can":[27,91],"only":[28],"communicate":[29],"using":[30,47],"test-and-set":[31],"(TAS)":[32],"registers.":[33,200],"aim":[35],"the":[37,67,74,77,102,134,154,166,170,187,193],"paper":[38],"assign":[41,92],"unique":[42,93],"all":[45,163],"a":[48,123,127,140,144,181],"distributed":[49,85],"algorithm.":[50],"naming":[52,86,158],"studied":[57],"eight":[59],"new":[60],"problem":[61,167],"models":[62],"based":[63],"on":[64],"two":[65,84],"categories;":[66],"number":[68,78,171],"TAS":[70,199],"registers":[71],"available,":[72],"knowledge":[75],"processes.":[80,97],"In":[81],"this":[82],"paper,":[83],"algorithms":[87,108],"developed":[89,107],"One":[98],"deterministic":[100,124],"other":[103],"randomized.":[105],"optimal":[110],"time":[112,128,145,183],"complexity":[113,129,146,184],"namespace":[115],"size.":[116],"Sequential":[118,188],"Lookup":[119,136,178,189],"algorithm,":[120,125,137,142],"which":[121,138],"has":[126,143,180],"0(n2)":[131],"steps,":[132],"whereas":[133],"Random":[135,177],"randomized":[141],"0(n":[148],"log":[149],"n)":[150],"steps.":[151],"Proof":[152],"correctness":[155],"each":[157],"algorithm":[159,179,190],"presented":[161],"for":[162],"categories":[164],"model":[168],"where":[169],"known.":[175],"better":[182],"compared":[185],"due":[191],"use":[194],"randomness":[196],"accessing":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3033558270","counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2024-12-17T16:59:46.601734","created_date":"2020-06-12"}