{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:44:54Z","timestamp":1710269094968},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0020-0190(97)00091-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"23-31","source":"Crossref","is-referenced-by-count":24,"title":["On the impact of sense of direction on message complexity"],"prefix":"10.1016","volume":"63","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00091-4_BIB1","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"82","article-title":"Local and global properties in networks of processors","author":"Angluin","year":"1980"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01553900","article-title":"Efficient elections in chordal ring networks","volume":"4","author":"Attiya","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB3","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TSE.1983.234958","article-title":"Graph traversal techniques and the maximum flow problem in distributed computation","volume":"9","author":"Cheung","year":"1983","journal-title":"IEEE Trans. Software Engineering"},{"issue":"1","key":"10.1016\/S0020-0190(97)00091-4_BIB4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1006\/jpdc.1996.0026","article-title":"Optimal election in labeled hypercubes","volume":"33","author":"Flocchini","year":"1996","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB5","series-title":"Proc. 9th Internat. Symp. on Computer and Information Sciences","first-page":"196","article-title":"Distributed traversal and broadcasting in arbitrary network with distance sense of direction","author":"Flocchini","year":"1994"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB6","series-title":"Proc. 1st Coll. on Structural Information and Communication Complexity","first-page":"9","article-title":"Sense of direction: formal definition and properties","volume":"Vol. 1","author":"Flocchini","year":"1994"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB7","series-title":"Proc. 3rd Coll. on Structural Information and Communication Complexity","first-page":"32","article-title":"Computing on anonymous networks with sense of direction","volume":"Vol. 6","author":"Flocchini","year":"1996"},{"issue":"1","key":"10.1016\/S0020-0190(97)00091-4_BIB8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum spanning tree","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB9","series-title":"Proc. Conf. on Algorithms and Complexity","first-page":"167","article-title":"Time-message trade-offs for the weak unison problem","volume":"Vol. 778","author":"Israeli","year":"1994"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(91)90069-T","article-title":"Towards optimal distributed election on chordal rings","volume":"38","author":"Kalamboukis","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(97)00091-4_BIB11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/77606.77610","article-title":"A modular technique for the design of efficient distributed leader finding algorithms","volume":"12","author":"Korach","year":"1990","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB12","series-title":"Proc. 3rd Symp. on Principles of Distributed Computing","first-page":"199","article-title":"Tight lower and upper bounds for a class of distributed algorithms for a complete network of processors","author":"Korach","year":"1984"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(86)90043-8","article-title":"A fully distributed (minimal) spanning tree algorithm","volume":"23","author":"Lavall\u00e9e","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB14_1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","article-title":"Election in complete networks with a sense of direction","volume":"22","author":"Loui","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB14_2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(88)90181-0","volume":"28","author":"Loui","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB15","series-title":"Proc. 3rd Internat. Coll. on Structural Information and Communication Complexity","first-page":"17","article-title":"Optimal distributed algorithms in unlabeled tori and chordal rings","volume":"Vol. 6","author":"Mans","year":"1996"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB16","series-title":"Proc. 14th Internat. Conf. on Distributed Computing Systems","first-page":"258","article-title":"On the impact of sense of direction in arbitrary networks","author":"Mans","year":"1994"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB17","first-page":"1627","article-title":"Effect of preprocessing on election in a complete network with a sense of direction","volume":"Vol. 3","author":"Masapati","year":"1991"},{"issue":"12","key":"10.1016\/S0020-0190(97)00091-4_BIB18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/scj.4690221202","article-title":"A fault-tolerant algorithm for election in complete networks with a sense of direction","volume":"22","author":"Masuzawa","year":"1991","journal-title":"Systems and Computers in Japan"},{"issue":"3\u20134","key":"10.1016\/S0020-0190(97)00091-4_BIB19","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00207169108804012","article-title":"An improved election algorithm in chordal ring networks","volume":"40","author":"Pan","year":"1991","journal-title":"Internat. J. Computer Math."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB20","series-title":"Proc. Internat. Conf. on Databases, Parallel Architectures and their Applications","first-page":"469","article-title":"Choosing a leader on a hypercube","author":"Robbins","year":"1990"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00979869","article-title":"On the message complexity of distributed problems","volume":"13","author":"Santoro","year":"1984","journal-title":"J. Comput. Inform. Sci."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB22_1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","article-title":"An efficient distributed depth-first-search algorithm","volume":"32","author":"Sharma","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB22_2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(90)90175-W","volume":"35","author":"Sharma","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00091-4_BIB23","series-title":"Proc. 11th Symp. on Principles of Distributed Computing","first-page":"179","article-title":"Leader election in complete networks","author":"Singh","year":"1992"},{"key":"10.1016\/S0020-0190(97)00091-4_BIB24","series-title":"Theory and Practice of Informatics","first-page":"50","article-title":"Sense of direction in processor networks","volume":"Vol. 1012","author":"Tel","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000914?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000914?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:26:01Z","timestamp":1556043961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0020019097000914"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00091-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}