{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:23Z","timestamp":1740099263802,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030055288"},{"type":"electronic","value":"9783030055295"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05529-5_5","type":"book-chapter","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:54:08Z","timestamp":1546638848000},"page":"67-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complete Visibility for Oblivious Robots in $$\\mathcal{O}(N)$$ Time"],"prefix":"10.1007","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[]},{"given":"Supratik","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,5]]},"reference":[{"key":"5_CR1","unstructured":"Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: CCCG (2014)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: PODC, pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: ISIC, pp. 453\u2013460, August 1995","DOI":"10.1109\/ISIC.1995.525098"},{"key":"5_CR4","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-27796-5_8","volume-title":"Structural Information and Communication Complexity","author":"R Cohen","year":"2004","unstructured":"Cohen, R., Peleg, D.: Robot convergence via center-of-gravity algorithms. In: Kr\u00e1lovic\u0306, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 79\u201388. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27796-5_8"},{"issue":"1\u20132","key":"5_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2008.02.007","volume":"399","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1\u20132), 71\u201382 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-18381-2_15","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., et al.: Collisionless gathering of robots with an extent. In: \u010cern\u00e1, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178\u2013189. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18381-2_15"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-642-22012-8_52","volume-title":"Automata, Languages and Programming","author":"A Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., et al.: A new approach for analyzing convergence algorithms for mobile robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 650\u2013661. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_52"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: SPAA, pp. 301\u2013312 (2016)","DOI":"10.1145\/2935764.2935789"},{"issue":"6\u20137","key":"5_CR10","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6\u20137), 481\u2013499 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"5_CR12","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local o(n$${}^{\\text{2}}$$) gathering algorithm. In: SPAA, pp. 217\u2013223 (2010)"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Luna Di","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"issue":"2","key":"5_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume":"3","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theory 3(2), 1\u2013185 (2012)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"issue":"4","key":"5_CR15","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TPDS.2012.212","volume":"24","author":"T Izumi","year":"2013","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Feasibility of polynomial-time randomized gathering for oblivious mobile robots. IEEE Trans. Parallel Distrib. Syst. 24(4), 716\u2013723 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"5_CR16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s00446-015-0248-5","volume":"28","author":"L Pagli","year":"2015","unstructured":"Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333\u2013349 (2015)","journal-title":"Distrib. Comput."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11603771_1","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"D Peleg","year":"2005","unstructured":"Peleg, D.: Distributed coordination algorithms for mobile robot swarms: new directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603771_1"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Sharma, G., Alsaedi, R., Busch, C., Mukhopadhyay, S.: The complete visibility problem for fat robots with lights. In: ICDCN, pp. 21:1\u201321:4 (2018)","DOI":"10.1145\/3154273.3154319"},{"key":"5_CR19","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms. In: CCCG, pp. 268\u2013274 (2015)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-28472-9_15","volume-title":"Algorithms for Sensor Systems","author":"Gokarna Sharma","year":"2015","unstructured":"Sharma, Gokarna, Busch, Costas, Mukhopadhyay, Supratik: Mutual visibility with an optimal number of colors. In: Bose, Prosenjit, Gasieniec, L., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 196\u2013210. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28472-9_15"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Brief announcement: complete visibility for oblivious robots in linear time. In: SPAA, pp. 325\u2013327 (2017)","DOI":"10.1145\/3087556.3087591"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-69084-1_18","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Sharma","year":"2017","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L.: Constant-time complete visibility for asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 265\u2013281. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_18"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-49259-9_26","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Sharma","year":"2016","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: Complete visibility for robots with lights in O(1) time. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 327\u2013345. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_26"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: Logarithmic-time complete visibility for asynchronous robots with lights. In: IPDPS, pp. 513\u2013522 (2017)","DOI":"10.1109\/IPDPS.2017.51"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Vaidyanathan, R., Busch, C., Trahan, J.L., Sharma, G., Rai, S.: Logarithmic-time complete visibility for robots with lights. In: IPDPS.,pp. 375\u2013384 (2015)","DOI":"10.1109\/IPDPS.2015.52"},{"issue":"26\u201328","key":"5_CR26","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26\u201328), 2433\u20132453 (2010)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05529-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T11:42:13Z","timestamp":1573645333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05529-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030055288","9783030055295"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05529-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Essaouira","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/history\/netys2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}