{"id":"https://openalex.org/W2037274096","doi":"https://doi.org/10.1080/01495730108935263","title":"SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS","display_name":"SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2037274096","doi":"https://doi.org/10.1080/01495730108935263","mag":"2037274096"},"language":"en","primary_location":{"id":"doi:10.1080/01495730108935263","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935263","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5105985299","display_name":"Ajoy K. Datta","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"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":["FR","US"],"is_corresponding":true,"raw_author_name":"AJOY K. DATTA","raw_affiliation_strings":["Department of Computer Science , University of Nevada Las Vegas , UMR CNRS, 8623, France"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Nevada Las Vegas , UMR CNRS, 8623, France","institution_ids":["https://openalex.org/I133999245","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073883755","display_name":"S\u00e9bastien Tixeuil","orcid":"https://orcid.org/0000-0002-0948-7172"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S\u00c9BASTIEN TIXEUIL","raw_affiliation_strings":["Laboratoire de Recherche en Informatique, Universite de Paris-Sud , UMR CNRS, 8623, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique, Universite de Paris-Sud , UMR CNRS, 8623, France","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105985299"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I133999245"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.1883677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"15"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9603000283241272,"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.9258999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/self-stabilization","display_name":"Self-stabilization","score":0.7937154769897461},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6741661429405212},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6050998568534851},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5906618237495422},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.5583728551864624},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5525835752487183},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5414682626724243},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.512507438659668},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5058157444000244},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.4819628894329071},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4795777201652527},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.47946345806121826},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.45355847477912903},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4121393859386444},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.3827793598175049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34164875745773315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33891743421554565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3056339919567108},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2715691030025482},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.23779195547103882},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20289692282676697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1730383038520813},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.14954033493995667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14781856536865234},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14737114310264587},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.100894033908844}],"concepts":[{"id":"https://openalex.org/C71112949","wikidata":"https://www.wikidata.org/wiki/Q2873036","display_name":"Self-stabilization","level":3,"score":0.7937154769897461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6741661429405212},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6050998568534851},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5906618237495422},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.5583728551864624},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5525835752487183},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5414682626724243},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.512507438659668},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5058157444000244},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4819628894329071},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4795777201652527},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.47946345806121826},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.45355847477912903},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4121393859386444},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.3827793598175049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34164875745773315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33891743421554565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3056339919567108},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2715691030025482},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.23779195547103882},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20289692282676697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1730383038520813},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.14954033493995667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14781856536865234},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14737114310264587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.100894033908844},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":1,"locations":[{"id":"doi:10.1080/01495730108935263","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935263","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310017","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W123648985","https://openalex.org/W1951113730","https://openalex.org/W2005348527","https://openalex.org/W2008146034","https://openalex.org/W2016240806","https://openalex.org/W2063615214","https://openalex.org/W2111132249","https://openalex.org/W2293301713","https://openalex.org/W2294012738","https://openalex.org/W4241563943"],"related_works":["https://openalex.org/W4378651134","https://openalex.org/W2379764279","https://openalex.org/W4252684102","https://openalex.org/W2360924501","https://openalex.org/W2352307597","https://openalex.org/W1566333620","https://openalex.org/W2136884623","https://openalex.org/W2137031274","https://openalex.org/W2568250882","https://openalex.org/W2037274096"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,25,37,43,69,112,132],"self-stabilizing":[4,98],"distributed":[5,12,48],"sorting":[6,13],"algorithm":[7],"for":[8,120],"tree":[9,139,170],"networks.":[10],"The":[11,52,82],"problem":[14],"can":[15],"be":[16],"informally":[17],"described":[18],"as":[19],"follows:":[20],"Nodes":[21],"cooperate":[22],"to":[23,87,111,141],"reach":[24],"global":[26],"configuration":[27,67],"where":[28,163],"every":[29],"node,":[30],"depending":[31],"on":[32,131],"its":[33,65],"identifier,":[34],"is":[35,90,129,165,173],"assigned":[36],"specific":[38],"final":[39,66],"value":[40],"taken":[41],"from":[42],"set":[44,113],"of":[45,95,101,114,168,176],"input":[46,53,74,89],"values":[47,54,75],"across":[49],"all":[50],"nodes.":[51],"may":[55],"change":[56],"in":[57,68,108,147],"time.":[58],"In":[59],"our":[60],"solution,":[61],"the":[62,73,79,85,102,118,138,143,148,166,169,174,177],"system":[63,104],"reaches":[64],"finite":[70,109],"time":[71,110,154],"after":[72],"are":[76],"stable":[77],"and":[78,84,156,171],"faults":[80],"cease.":[81],"fault-tolerance":[83],"adaptivity":[86],"changing":[88],"achieved":[91],"using":[92],"Dijkstra's":[93],"paradigm":[94],"self-stabilization.":[96],"A":[97],"algorithm,":[99],"regardless":[100],"initial":[103],"state,":[105],"will":[106],"converge":[107],"legitimate":[115],"states":[116],"without":[117],"need":[119],"explicit":[121],"exception":[122],"handlers":[123],"or":[124],"backward":[125],"recovery.":[126],"Our":[127],"solution":[128],"based":[130],"continuous":[133],"broadcast":[134],"with":[135],"acknowledgment":[136],"along":[137],"edges":[140],"achieve":[142],"synchronization":[144],"among":[145],"processes":[146],"system.":[149],"It":[150],"has":[151],"0(n":[152],"\u00d7h)":[153],"complexity":[155],"only":[157],"0(log(n)":[158],"\u00d7":[159],")":[160],"memory":[161],"requirement":[162],"h":[164,172],"degree":[167],"height":[175],"tree.":[178]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}