{"id":"https://openalex.org/W2569957724","doi":"https://doi.org/10.1145/3007748.3007772","title":"A Self-Stabilizing Minimal k-Grouping Algorithm","display_name":"A Self-Stabilizing Minimal k-Grouping Algorithm","publication_year":2017,"publication_date":"2017-01-04","ids":{"openalex":"https://openalex.org/W2569957724","doi":"https://doi.org/10.1145/3007748.3007772","mag":"2569957724"},"language":"en","primary_location":{"id":"doi:10.1145/3007748.3007772","doi":"https://doi.org/10.1145/3007748.3007772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3007748.3007772","pdf_url":null,"source":{"id":"https://openalex.org/S7407088154","display_name":"International Conference on Distributed Computing and Networking (ICDCN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5105985299","display_name":"Ajoy K. Datta","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ajoy K. Datta","raw_affiliation_strings":["University of Nevada, Las, Vegas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nevada, Las, Vegas","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023091847","display_name":"Laurence L. Larmore","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laurence L. Larmore","raw_affiliation_strings":["University of Nevada, Las, Vegas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nevada, Las, Vegas","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075313331","display_name":"Toshimitsu Masuzawa","orcid":"https://orcid.org/0000-0003-4628-6393","observed_orcids":["https://orcid.org/0000-0003-4628-6393"]},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshimitsu Masuzawa","raw_affiliation_strings":["Osaka University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osaka University","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084196039","display_name":"Yuichi Sudo","orcid":"https://orcid.org/0000-0002-4442-1750","observed_orcids":["https://orcid.org/0000-0002-4442-1750"]},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Sudo","raw_affiliation_strings":["Osaka University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osaka University","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7818,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64960556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9804999828338623,"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.9804999828338623,"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.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003599999938160181,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/self-stabilization","display_name":"self-stabilization","score":0.9520000219345093},{"id":"https://openalex.org/keywords/asynchronous-distributed-algorithms","display_name":"asynchronous distributed algorithms","score":0.7609999775886536},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.7990000247955322},{"id":"https://openalex.org/keywords/graph-diameter","display_name":"graph diameter","score":0.5759999752044678},{"id":"https://openalex.org/keywords/time-and-space-complexity","display_name":"time and space complexity","score":0.7509999871253967}],"concepts":[{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.7298660278320312},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5601527690887451},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5495612621307373},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5385531187057495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5033549666404724},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46382132172584534},{"id":"https://openalex.org/C2777253204","wikidata":"https://www.wikidata.org/wiki/Q308980","display_name":"Daemon","level":2,"score":0.4561533033847809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4527367651462555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45141270756721497},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4228164851665497},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4177109897136688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36620450019836426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31495562195777893},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11668208241462708}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3007748.3007772","doi":"https://doi.org/10.1145/3007748.3007772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3007748.3007772","pdf_url":null,"source":{"id":"https://openalex.org/S7407088154","display_name":"International Conference on Distributed Computing and Networking (ICDCN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1598441059","https://openalex.org/W1623587367","https://openalex.org/W1900590961","https://openalex.org/W1970821424","https://openalex.org/W1979758763","https://openalex.org/W1979804118","https://openalex.org/W1986236245","https://openalex.org/W2012987308","https://openalex.org/W2034391053","https://openalex.org/W2072797971","https://openalex.org/W2073927206","https://openalex.org/W2090609166","https://openalex.org/W2111132249","https://openalex.org/W4250494186","https://openalex.org/W4254970788"],"related_works":["https://openalex.org/W100582849","https://openalex.org/W2139085937","https://openalex.org/W1986236245","https://openalex.org/W7099617750","https://openalex.org/W7097045750","https://openalex.org/W2809868749","https://openalex.org/W7096648350","https://openalex.org/W4285609565","https://openalex.org/W2283454896","https://openalex.org/W7099578548"],"abstract_inverted_index":{"We":[0,40,173],"consider":[1],"the":[2,29,52,59,69,76,94,99,104,107,124,135,145,154,161],"minimal":[3],"k-grouping":[4],"problem:":[5],"given":[6],"a":[7,14,42,82,176,182],"graph":[8],"G":[9,18],"=":[10],"(V,":[11],"E)":[12],"and":[13,101],"constant":[15],"k,":[16,26],"partition":[17],"into":[19],"subgraphs":[20,34],"of":[21,31,56,78,85,96,106,112,126,137,148,163],"diameter":[22,36,105],"no":[23],"greater":[24,37],"than":[25,38],"such":[27],"that":[28,131,160],"union":[30],"any":[32,138],"two":[33],"has":[35,61],"k.":[39],"give":[41,175],"silent":[43,183],"self-stabilizing":[44],"asynchronous":[45],"distributed":[46],"algorithm":[47,66,87,158,184],"for":[48],"this":[49],"problem":[50],"in":[51,98,144],"composite":[53],"atomicity":[54],"model":[55],"computation,":[57],"assuming":[58],"network":[60,100],"unique":[62],"process":[63,114,152],"identifiers.":[64],"Our":[65,157],"works":[67],"under":[68],"weakly-fair":[70],"daemon.":[71],"The":[72,109],"time":[73],"complexity":[74,111],"(i.e.":[75],"number":[77,95,125,162],"rounds":[79],"to":[80,180],"reach":[81],"legitimate":[83],"configuration)":[84],"our":[86],"is":[88,93,103,115,123,165],"O":[89],"(nD/k)":[90],"where":[91,121],"n":[92],"processes":[97],"D":[102],"network.":[108],"space":[110],"each":[113],"O((n":[116],"+":[117,169],"nfalse)":[118],"log":[119],"n)":[120],"nfalse":[122],"false":[127],"identifiers,":[128],"i.e.,":[129],"identifiers":[130],"do":[132],"not":[133],"match":[134],"identifier":[136],"process,":[139],"but":[140],"which":[141,186],"are":[142],"stored":[143],"local":[146],"memory":[147],"at":[149,153,166],"least":[150],"one":[151],"initial":[155],"configuration.":[156],"guarantees":[159],"groups":[164],"most":[167],"2n/k":[168],"1":[170],"after":[171],"convergence.":[172],"also":[174],"novel":[177],"composition":[178],"technique":[179],"concatenate":[181],"repeatedly,":[185],"we":[187],"call":[188],"loop":[189],"composition.":[190]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2017-01-13T00:00:00"}