{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:15:52Z","timestamp":1743156952827,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_15","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"188-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Advances in\u00a0Rightmost Lempel-Ziv"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3305-6185","authenticated-orcid":false,"given":"Jonas","family":"Ellert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3384-597X","authenticated-orcid":false,"given":"Johannes","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8850-6422","authenticated-orcid":false,"given":"Max Rish\u00f8j","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0190(01)00275-7","volume":"82","author":"A Amir","year":"2002","unstructured":"Amir, A., Landau, G.M., Ukkonen, E.: Online timestamped text indexing. Inf. Process. Lett. 82(5), 253\u2013259 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(01)00275-7","journal-title":"Inf. Process. Lett."},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Bannai, H., Funakoshi, M., Kurita, K., Nakashima, Y., Seto, K., Uno, T.: Optimal LZ-end parsing is hard. In: Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2023.3","DOI":"10.4230\/LIPIcs.CPM.2023.3"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Puglisi, S.J.: Range predecessor and Lempel-Ziv parsing. In: Proceedings of the 27th Annual Symposium on Discrete Algorithms (SODA 2016), pp. 2053\u20132071. Arlington, VA, USA (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch143","DOI":"10.1137\/1.9781611974331.ch143"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bille, P., Cording, P.H., Fischer, J., G\u00f8rtz, I.L.: Lempel-Ziv compression in a sliding window. In: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), pp. 15:1\u201315:11. Warsaw, Poland (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.15","DOI":"10.4230\/LIPIcs.CPM.2017.15"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.20382\/jocg.v9i2a5","volume":"9","author":"TM Chan","year":"2018","unstructured":"Chan, T.M., Tsakalidis, K.: Dynamic orthogonal range searching on the ram, revisited. J. Comput. Geom. 9(2), 45\u201366 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i2a5","journal-title":"J. Comput. Geom."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Langiu, A., Mignosi, F.: The rightmost equal-cost position problem. In: Proceedings of the 2013 Data Compression Conference (DCC 2013), pp. 421\u2013430. Snowbird, UT, USA (2013). https:\/\/doi.org\/10.1109\/DCC.2013.50","DOI":"10.1109\/DCC.2013.50"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(91)90223-5","volume":"38","author":"M Crochemore","year":"1991","unstructured":"Crochemore, M., Rytter, W.: Efficient parallel algorithms to test square-freeness and factorize strings. Inf. Process. Lett. 38(2), 57\u201360 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90223-5","journal-title":"Inf. Process. Lett."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Ellert, J.: Sublinear time Lempel-Ziv (LZ77) factorization. In: Proceedings of the 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023). Pisa, Italy (2023)","DOI":"10.1007\/978-3-031-43980-3_14"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Farach, M., Muthukrishnan, S.: Optimal parallel dictionary matching and compression (extended abstract). In: Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1995), pp. 244\u2013253. Santa Barbara, California, USA (1995). https:\/\/doi.org\/10.1145\/215399.215451","DOI":"10.1145\/215399.215451"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1137\/120869511","volume":"42","author":"P Ferragina","year":"2013","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. SIAM J. Comput. 42(4), 1521\u20131541 (2013). https:\/\/doi.org\/10.1137\/120869511","journal-title":"SIAM J. Comput."},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-19929-0_15","volume-title":"Combinatorial Pattern Matching","author":"J Fischer","year":"2015","unstructured":"Fischer, J., I, T., K\u00f6ppl, D.: Lempel Ziv computation in small space (LZ-CISS). In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 172\u2013184. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_15"},{"issue":"7","key":"15_CR12","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1007\/s00453-017-0333-1","volume":"80","author":"J Fischer","year":"2018","unstructured":"Fischer, J., Tomohiro, I., K\u00f6ppl, D., Sadakane, K.: Lempel-Ziv factorization powered by space efficient suffix trees. Algorithmica 80(7), 2048\u20132081 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0333-1","journal-title":"Algorithmica"},{"issue":"9","key":"15_CR13","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9), 490\u2013499 (1960). https:\/\/doi.org\/10.1145\/367390.367400","journal-title":"Commun. ACM"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Goto, K., Bannai, H.: Simpler and faster Lempel Ziv factorization. In: Proceedings of the 2013 Data Compression Conference (DCC 2013), pp. 133\u2013142. Snowbird, UT, USA (2013). https:\/\/doi.org\/10.1109\/DCC.2013.21","DOI":"10.1109\/DCC.2013.21"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Goto, K., Bannai, H.: Space efficient linear time Lempel-Ziv factorization for small alphabets. In: Proceedings of the 2014 Data Compression Conference (DCC 2014), pp. 163\u2013172. Snowbird, UT, USA (2014). https:\/\/doi.org\/10.1109\/DCC.2014.62","DOI":"10.1109\/DCC.2014.62"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366\u2013398. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028575"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-38527-8_14","volume-title":"Experimental Algorithms","author":"J K\u00e4rkk\u00e4inen","year":"2013","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Lightweight Lempel-Ziv parsing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 139\u2013150. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_14"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-38905-4_19","volume-title":"Combinatorial Pattern Matching","author":"J K\u00e4rkk\u00e4inen","year":"2013","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Linear time Lempel-Ziv factorization: simple, fast, small. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 189\u2013200. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_19"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. In: Proceedings of the 51st Annual Symposium on Theory of Computing (STOC 2019), pp. 756\u2013767. Phoenix, AZ, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316368","DOI":"10.1145\/3313276.3316368"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kosolobov, D.: LZ-end parsing in linear time. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA 2017), pp. 53:1\u201353:14. Vienna, Austria (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.53","DOI":"10.4230\/LIPIcs.ESA.2017.53"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Kempa, D., Saha, B.: An upper bound and linear-space queries on the LZ-end parsing. In: Proceedings of the 33rd Annual Symposium on Discrete Algorithms (SODA 2022), pp. 2847\u20132866. Alexandria, VA, USA (Virtual Conference) (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.111","DOI":"10.1137\/1.9781611977073.111"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-662-48054-0_36","volume-title":"Mathematical Foundations of Computer Science 2015","author":"D Kosolobov","year":"2015","unstructured":"Kosolobov, D.: Faster lightweight Lempel-Ziv parsing. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 432\u2013444. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_36"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Kreft, S., Navarro, G.: LZ77-like compression with fast random access. In: Proceedings of the 2010 Data Compression Conference (DCC 2010), pp. 239\u2013248. Snowbird, UT, USA (2010). https:\/\/doi.org\/10.1109\/DCC.2010.29","DOI":"10.1109\/DCC.2010.29"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","volume":"483","author":"S Kreft","year":"2013","unstructured":"Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theor. Comput. Sci. 483, 115\u2013133 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.02.006","journal-title":"Theor. Comput. Sci."},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Lempel-Ziv parsing in external memory. In: Proceedings of the 2014 Data Compression Conference (DCC 2014), pp. 153\u2013162. Snowbird, UT, USA (2014). https:\/\/doi.org\/10.1109\/DCC.2014.78","DOI":"10.1109\/DCC.2014.78"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"K\u00f6ppl, D., Sadakane, K.: Lempel-Ziv computation in compressed space (LZ-CICS). In: Proceedings of the 2016 Data Compression Conference (DCC 2016), pp. 3\u201312. Snowbird, UT, USA (2016). https:\/\/doi.org\/10.1109\/DCC.2016.38","DOI":"10.1109\/DCC.2016.38"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-07566-2_26","volume-title":"Combinatorial Pattern Matching","author":"NJ Larsson","year":"2014","unstructured":"Larsson, N.J.: Most recent match queries in on-line suffix trees. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 252\u2013261. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_26"},{"issue":"1","key":"15_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Inf. Theory 22(1), 75\u201381 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055501","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"15_CR29","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993). https:\/\/doi.org\/10.1137\/0222058","journal-title":"SIAM J. Comput."},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/3-540-54233-7_179","volume-title":"Automata, Languages and Programming","author":"M Naor","year":"1991","unstructured":"Naor, M.: String matching with preprocessing of text and pattern. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 739\u2013750. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54233-7_179"},{"key":"15_CR31","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press, Cambridge (2016). https:\/\/doi.org\/10.1017\/CBO9781316588284","DOI":"10.1017\/CBO9781316588284"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-21458-5_4","volume-title":"Combinatorial Pattern Matching","author":"E Ohlebusch","year":"2011","unstructured":"Ohlebusch, E., Gog, S.: Lempel-Ziv factorization revisited. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 15\u201326. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21458-5_4"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-540-87744-8_58","volume-title":"Algorithms - ESA 2008","author":"D Okanohara","year":"2008","unstructured":"Okanohara, D., Sadakane, K.: An online algorithm for finding the longest previous factors. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 696\u2013707. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_58"},{"key":"15_CR34","doi-asserted-by":"publisher","unstructured":"Shun, J.: Parallel Lempel-Ziv factorization, chap. 13. Association for Computing Machinery and Morgan & Claypool (2018). https:\/\/doi.org\/10.1145\/3018787.3018801","DOI":"10.1145\/3018787.3018801"},{"key":"15_CR35","doi-asserted-by":"publisher","unstructured":"Shun, J., Zhao, F.: Practical parallel Lempel-Ziv factorization. In: Proceedings of the 2013 Data Compression Conference (DCC 2013). pp. 123\u2013132. Snowbird, UT, USA (2013). https:\/\/doi.org\/10.1109\/DCC.2013.20","DOI":"10.1109\/DCC.2013.20"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-642-32589-2_68","volume-title":"Mathematical Foundations of Computer Science 2012","author":"T Starikovskaya","year":"2012","unstructured":"Starikovskaya, T.: Computing Lempel-Ziv factorization online. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 789\u2013799. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_68"},{"issue":"4","key":"15_CR37","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982). https:\/\/doi.org\/10.1145\/322344.322346","journal-title":"J. ACM"},{"key":"15_CR38","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual Symposium on Switching and Automata Theory (SWAT 1973), pp. 1\u201311. Iowa City, IA, USA (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"},{"key":"15_CR39","doi-asserted-by":"publisher","unstructured":"Yamamoto, J., I, T., Bannai, H., Inenaga, S., Takeda, M.: Faster compact on-line Lempel-Ziv factorization. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 675\u2013686. Lyon, France (2014). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2014.675","DOI":"10.4230\/LIPIcs.STACS.2014.675"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T02:03:10Z","timestamp":1703210590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}