乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:44:49Z","timestamp":1732038289269},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181253"},{"type":"electronic","value":"9783030181260"}],"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"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18126-0_13","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"144-155","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Mutual Visibility by Robots with Persistent Memory"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Bhagat","sequence":"first","affiliation":[]},{"given":"Krishnendu","family":"Mukhopadhyaya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: The power of lights: synchronizing asynchronous robots using visible bits. In: Proceedings of 32nd International Conference on Distributed Computing Systems (ICDCS), pp. 506\u2013515 (2012)","key":"13_CR1","DOI":"10.1109\/ICDCS.2012.71"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-30139-6_7","volume-title":"WALCOM: Algorithms and Computation","author":"S Bhagat","year":"2016","unstructured":"Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Formation of general position by asynchronous mobile robots under one-axis agreement. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 80\u201391. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30139-6_7"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafael (2012)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-03578-9_16","volume-title":"Structural Information and Communication Complexity","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189\u2013200. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03578-9_16"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.15803\/ijnc.8.1_32","volume":"8","author":"A Aljohani","year":"2018","unstructured":"Aljohani, A., Sharma, G.: Complete visibility for mobile robots with lights tolerating faults. Int. J. Netw. Comput. 8(1), 32\u201352 (2018)","journal-title":"Int. J. Netw. Comput."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-75172-6_15","volume-title":"WALCOM: Algorithms and Computation","author":"A Aljohani","year":"2018","unstructured":"Aljohani, A., Poudel, P., Sharma, G.: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 169\u2013182. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75172-6_15"},{"doi-asserted-by":"crossref","unstructured":"Sharma, G., Alsaedi, R., Busch, C., Mukhopadhyay, S.: The complete visibility problem for fat robots with lights. In: Proceedings of 19th International Conference on Distributed Computing and Networking (ICDCN 2018), p. 21 (2018)","key":"13_CR7","DOI":"10.1145\/3154273.3154319"},{"key":"13_CR8","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":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-69084-1_24","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Bhagat","year":"2017","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Optimum algorithm for mutual visibility among asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 341\u2013355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_24"},{"key":"13_CR10","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":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Mutual visibility with an optimal number of colors. In: Bose, P., G\u0105sieniec, L.A., 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"},{"unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms. In: Proceedings of 27th Canadian Conference on Computational Geometry (CCCG 2015) (2015)","key":"13_CR11"},{"doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. In: Information and Computation, vol. 254, pp. 392\u2013418 (2017)","key":"13_CR12","DOI":"10.1016\/j.ic.2016.09.005"},{"unstructured":"Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings of 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)","key":"13_CR13"},{"doi-asserted-by":"crossref","unstructured":"Sharma, G.: Mutual visibility for robots with lights tolerating light faults. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 829\u2013836 (2018)","key":"13_CR14","DOI":"10.1109\/IPDPSW.2018.00130"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:19:00Z","timestamp":1709817540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_13","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":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}