{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:09:25Z","timestamp":1762459765010},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"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-29007-8_20","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"348-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Transforming Derivational Complexity of Term Rewriting to Runtime Complexity"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Fuhs","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"1\u20132","key":"20_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1\u20132), 133\u2013178 (2000). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(99)00207-8","journal-title":"Theor. Comput. Sci."},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Avanzini, M., Eguchi, N., Moser, G.: A path order for rewrite systems that compute exponential time functions. In: Proceedings of RTA 2011, LIPIcs, vol. 10, pp. 123\u2013138 (2011). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2011.123","DOI":"10.4230\/LIPIcs.RTA.2011.123"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ic.2015.12.007","volume":"248","author":"M Avanzini","year":"2016","unstructured":"Avanzini, M., Moser, G.: A combination framework for complexity. Inf. Comput. 248, 22\u201355 (2016). \n                      https:\/\/doi.org\/10.1016\/j.ic.2015.12.007","journal-title":"Inf. Comput."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-49674-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Avanzini","year":"2016","unstructured":"Avanzini, M., Moser, G., Schaper, M.: TcT: tyrolean complexity tool. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 407\u2013423. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49674-9_24"},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). \n                      https:\/\/dblp.uni-trier.de\/rec\/bibtex\/books\/daglib\/0092409"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2866575","volume":"38","author":"M Brockschmidt","year":"2016","unstructured":"Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., Giesl, J.: Analyzing runtime and size complexity of integer programs. ACM Trans. Program. Lang. Syst. 38(4), 13:1\u201313:50 (2016). \n                      https:\/\/doi.org\/10.1145\/2866575","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Endrullis, J., Hendriks, D.: Transforming outermost into context-sensitive rewriting. Logical Methods Comput. Sci. 6(2) (2010). \n                      https:\/\/doi.org\/10.2168\/lmcs-6(2:5)2010","DOI":"10.2168\/lmcs-6(2:5)2010"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2004.10.005","volume":"93","author":"M-L Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M.-L.: Relaxing monotonicity for innermost termination. Inf. Process. Lett. 93(3), 117\u2013123 (2005). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2004.10.005","journal-title":"Inf. Process. Lett."},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-48685-2_24","volume-title":"Rewriting Techniques and Applications","author":"MCF Ferreira","year":"1999","unstructured":"Ferreira, M.C.F., Ribeiro, A.L.: Context-sensitive AC-rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 286\u2013300. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48685-2_24"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-12736-1_15","volume-title":"Programming Languages and Systems","author":"A Flores-Montoya","year":"2014","unstructured":"Flores-Montoya, A., H\u00e4hnle, R.: Resource analysis of complex programs with cost equations. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 275\u2013295. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-12736-1_15"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-48989-6_16","volume-title":"FM 2016: Formal Methods","author":"A Flores-Montoya","year":"2016","unstructured":"Flores-Montoya, A.: Upper and lower amortized cost bounds of programs expressed as cost relations. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 254\u2013273. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48989-6_16"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Frohn, F., Giesl, J.: Analyzing runtime complexity via innermost runtime complexity. In: Proceedings of LPAR 2017, EPiC, vol. 46, pp. 249\u2013268 (2017). \n                      https:\/\/doi.org\/10.29007\/1nbh","DOI":"10.29007\/1nbh"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10817-016-9397-x","volume":"59","author":"F Frohn","year":"2017","unstructured":"Frohn, F., Giesl, J., Hensel, J., Aschermann, C., Str\u00f6der, T.: Lower bounds for runtime complexity of term rewriting. J. Autom. Reason. 59(1), 121\u2013163 (2017). \n                      https:\/\/doi.org\/10.1007\/s10817-016-9397-x","journal-title":"J. Autom. Reason."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2017","unstructured":"Giesl, J., et al.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reasoning 58, 3\u201331 (2017). \n                      https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1017\/S0956796803004945","volume":"14","author":"J Giesl","year":"2004","unstructured":"Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4), 379\u2013427 (2004). \n                      https:\/\/doi.org\/10.1017\/S0956796803004945","journal-title":"J. Funct. Program."},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-17502-3_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Giesl","year":"2019","unstructured":"Giesl, J., Rubio, A., Sternagel, C., Waldmann, J., Yamada, A.: The termination and complexity competition. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 156\u2013166. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-17502-3_10"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Giesl, J., Str\u00f6der, T., Schneider-Kamp, P., Emmes, F., Fuhs, C.: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. In: Proceedings of PPDP 2012, pp. 1\u201312 (2012). \n                      https:\/\/doi.org\/10.1145\/2370776.2370778","DOI":"10.1145\/2370776.2370778"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 364\u2013379. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71070-7_32"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-08918-8_18","volume-title":"Rewriting and Typed Lambda Calculi","author":"N Hirokawa","year":"2014","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on context-sensitive rewriting. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 257\u2013271. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08918-8_18"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105","author":"D Hofbauer","year":"1992","unstructured":"Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Theor. Comput. Sci. 105(1), 129\u2013140 (1992). \n                      https:\/\/doi.org\/10.1016\/0304-3975(92)90289-R","journal-title":"Theor. Comput. Sci."},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-51081-8_107","volume-title":"Rewriting Techniques and Applications","author":"D Hofbauer","year":"1989","unstructured":"Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167\u2013177. Springer, Heidelberg (1989). \n                      https:\/\/doi.org\/10.1007\/3-540-51081-8_107"},{"issue":"2","key":"20_CR22","first-page":"357","volume":"19","author":"A Koprowski","year":"2009","unstructured":"Koprowski, A., Waldmann, J.: Max\/plus tree automata for termination of term rewriting. Acta Cybern. 19(2), 357\u2013392 (2009)","journal-title":"Acta Cybern."},{"key":"20_CR23","unstructured":"Korp, M., Sternagel, C., Zankl, H.: CaT (complexity and termination). \n                      http:\/\/cl-informatik.uibk.ac.at\/software\/cat\/"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-61440-0_122","volume-title":"Automata, Languages and Programming","author":"S Lucas","year":"1996","unstructured":"Lucas, S.: Termination of context-sensitive rewriting by rewriting. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 122\u2013133. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-61440-0_122"},{"issue":"1","key":"20_CR25","first-page":"1","volume":"1998","author":"S Lucas","year":"1998","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. J. Funct. Logic Program. 1998(1), 1\u201361 (1998)","journal-title":"J. Funct. Logic Program."},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ic.2018.05.007","volume":"261","author":"G Moser","year":"2018","unstructured":"Moser, G., Schaper, M.: From Jinja bytecode to term rewriting: a complexity reflecting transformation. Inf. Comput. 261, 116\u2013143 (2018). \n                      https:\/\/doi.org\/10.1016\/j.ic.2018.05.007","journal-title":"Inf. Comput."},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-70590-1_19","volume-title":"Rewriting Techniques and Applications","author":"G Moser","year":"2008","unstructured":"Moser, G., Schnabl, A.: Proving quadratic derivational complexities using context dependent interpretations. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 276\u2013290. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-70590-1_19"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Moser, G., Schnabl, A., Waldmann, J.: Complexity analysis of term rewriting based on matrix and context dependent interpretations. In: Proceedings of FSTTCS 2008, LIPIcs, vol. 2, pp. 304\u2013315 (2008). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2008.1762","DOI":"10.4230\/LIPIcs.FSTTCS.2008.1762"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-90686-7_14","volume-title":"Functional and Logic Programming","author":"G Moser","year":"2018","unstructured":"Moser, G., Schneckenreither, M.: Automated amortised resource analysis for term rewrite systems. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 214\u2013229. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-90686-7_14"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-66167-4_8","volume-title":"Frontiers of Combining Systems","author":"M Naaf","year":"2017","unstructured":"Naaf, M., Frohn, F., Brockschmidt, M., Fuhs, C., Giesl, J.: Complexity analysis for term rewriting by integer transition systems. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 132\u2013150. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66167-4_8"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-642-16242-8_39","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F Neurauter","year":"2010","unstructured":"Neurauter, F., Zankl, H., Middeldorp, A.: Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 550\u2013564. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16242-8_39"},{"issue":"1","key":"20_CR32","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10817-013-9277-6","volume":"51","author":"L Noschinski","year":"2013","unstructured":"Noschinski, L., Emmes, F., Giesl, J.: Analyzing innermost runtime complexity of term rewriting by dependency pairs. J. Autom. Reason. 51(1), 27\u201356 (2013). \n                      https:\/\/doi.org\/10.1007\/s10817-013-9277-6","journal-title":"J. Autom. Reason."},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-08587-6_28","volume-title":"Automated Reasoning","author":"A Stump","year":"2014","unstructured":"Stump, A., Sutcliffe, G., Tinelli, C.: StarExec: a cross-community infrastructure for logic solving. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 367\u2013373. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08587-6_28"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-25979-4_6","volume-title":"Rewriting Techniques and Applications","author":"J Waldmann","year":"2004","unstructured":"Waldmann, J.: A tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 85\u201394. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-25979-4_6"},{"key":"20_CR35","unstructured":"Wiki: The International Termination Competition (TermComp). \n                      http:\/\/termination-portal.org\/wiki\/Termination_Competition"},{"key":"20_CR36","unstructured":"Wiki: Termination Problems DataBase (TPDB). \n                      http:\/\/termination-portal.org\/wiki\/TPDB"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Zankl, H., Korp, M.: Modular complexity analysis for term rewriting. Logical Methods Comput. Sci. 10(1) (2014). \n                      https:\/\/doi.org\/10.2168\/LMCS-10(1:19)2014","DOI":"10.2168\/LMCS-10(1:19)2014"},{"issue":"1\u20132","key":"20_CR38","doi-asserted-by":"publisher","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24(1\u20132), 89\u2013105 (1995). \n                      https:\/\/doi.org\/10.3233\/FI-1995-24124","journal-title":"Fundamenta Informaticae"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Rewriting Techniques and Applications","author":"H Zantema","year":"1997","unstructured":"Zantema, H.: Termination of context-sensitive rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172\u2013186. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/3-540-62950-5_69"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:13:28Z","timestamp":1566414808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_20","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":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","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":"30","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":"20","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":"67% - 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.1","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)"}}]}}