{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:34:11Z","timestamp":1648766051181},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p> We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n<jats:sup>4<\/jats:sup>) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non leaf node (starting from the same initial state) depending on the behavior of the daemon. The protocol generalizes the result in [1] and at the same time is much simpler and terminates in polynomial number of moves. <\/jats:p>","DOI":"10.1142\/s0129054106003851","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T09:47:03Z","timestamp":1144057623000},"page":"323-335","source":"Crossref","is-referenced-by-count":8,"title":["SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE"],"prefix":"10.1142","volume":"17","author":[{"given":"ZHENYU","family":"XU","sequence":"first","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634-0974, USA"}]},{"given":"PRADIP K.","family":"SRIMANI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634-0974, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0059"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843566"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90020-X"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626491000161"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90103-1"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/10637199408915459"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.588622"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00121-4"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1145\/169683.174161"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1145\/63264.63403"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:28:34Z","timestamp":1565191714000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":11,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1142\/S0129054106003851"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003851","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}