{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:21:06Z","timestamp":1729642866295,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/ipdps.2006.1639543","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T15:59:56Z","timestamp":1152547196000},"page":"6 pp.","source":"Crossref","is-referenced-by-count":0,"title":["Optimal map construction of an unknown torus"],"prefix":"10.1109","author":[{"given":"H.","family":"Becha","sequence":"first","affiliation":[]},{"given":"P.","family":"Flocchini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000047"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1043"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s446-002-8029-y"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365703"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276759"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732428X"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1389"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/70.105395"},{"key":"6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","article-title":"Tree exploration with little memory","volume":"51","author":"diks","year":"2004","journal-title":"Journal of Algorithms"},{"key":"5","first-page":"374","article-title":"Optimal graph exploration without good maps","author":"dessmark","year":"2002","journal-title":"Proc 10th European Symp Algorithms (ESA '02)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"8","first-page":"141","article-title":"Collective tree exploration","author":"fraigniaud","year":"2004","journal-title":"Proc 6th Latin American Symposium on Theoretical Informatics (LATIN'04)"}],"event":{"name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","start":{"date-parts":[[2006,4,25]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2006,4,29]]}},"container-title":["Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10917\/34366\/01639543.pdf?arnumber=1639543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T03:23:01Z","timestamp":1497669781000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1639543\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2006.1639543","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}