{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:05:46Z","timestamp":1785603946805,"version":"3.56.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030549961","type":"print"},{"value":"9783030549978","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54997-8_27","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"428-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Two-Way Quantum and Classical Automata with Advice for Online Minimization Problems"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aliya","family":"Khadieva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-98355-4_9","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"F Ablayev","year":"2018","unstructured":"Ablayev, F., Ablayev, M., Khadiev, K., Vasiliev, A.: Classical and quantum computations with restricted memory. In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 129\u2013155. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-98355-4_9"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-73117-9_14","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"F Ablayev","year":"2018","unstructured":"Ablayev, F., Ambainis, A., Khadiev, K., Khadieva, A.: Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 197\u2013211. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-73117-9_14"},{"issue":"2","key":"27_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.ic.2005.04.003","volume":"203","author":"F Ablayev","year":"2005","unstructured":"Ablayev, F., Gainutdinova, A., Karpinski, M., Moore, C., Pollett, C.: On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2), 145\u2013162 (2005)","journal-title":"Inf. Comput."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-09704-6_6","volume-title":"Descriptional Complexity of Formal Systems","author":"F Ablayev","year":"2014","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 53\u201364. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-09704-6_6"},{"issue":"3","key":"27_CR5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.3103\/S1066369X13030067","volume":"53","author":"F Ablayev","year":"2013","unstructured":"Ablayev, F., Khadiev, K.: Extension of the hierarchy for k-OBDDs of small width. Russ. Math. 53(3), 46\u201350 (2013)","journal-title":"Russ. Math."},{"issue":"7","key":"27_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ipl.2012.01.001","volume":"112","author":"A Ambainis","year":"2012","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Superiority of exact quantum automata for promise problems. Inf. Process. Lett. 112(7), 289\u2013291 (2012)","journal-title":"Inf. Process. Lett."},{"key":"27_CR7","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing. Technical report 1507.01988, arXiv (2015)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoret. Comput. Sci. 287(1), 299\u2013311 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-02927-1_15","volume-title":"Automata, Languages and Programming","author":"L Becchetti","year":"2009","unstructured":"Becchetti, L., Koutsoupias, E.: Competitive analysis of aggregate max in windowed streaming. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 156\u2013170. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02927-1_15"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-31644-9_2","volume-title":"Languages Alive","author":"H-J B\u00f6ckenhauer","year":"2012","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the power of randomness versus advice in online computation. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 30\u201343. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31644-9_2"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.tcs.2014.06.006","volume":"554","author":"HJ B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.J., Hromkovi\u010d, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theoret. Comput. Sci. 554, 95\u2013108 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"27_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/3056461","volume":"50","author":"J Boyar","year":"2017","unstructured":"Boyar, J., Favrholdt, L., Kudahl, C., Larsen, K., Mikkelsen, J.: Online algorithms with advice: a survey. ACM Comput. Surv. 50(2), 19 (2017)","journal-title":"ACM Comput. Surv."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-03367-4_11","volume-title":"Algorithms and Data Structures","author":"J Boyar","year":"2009","unstructured":"Boyar, J., Irani, S., Larsen, K.S.: A comparison of performance measures for online algorithms. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 119\u2013130. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03367-4_11"},{"issue":"4","key":"27_CR14","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1142\/S0129054115500239","volume":"26","author":"J Boyar","year":"2015","unstructured":"Boyar, J., Larsen, K.S., Maiti, A.: The frequent items problem in online streaming under various performance measures. Int. J. Found. Comput. Sci. 26(4), 413\u2013439 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-10631-6_35"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-77566-9_21","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"S Dobrev","year":"2008","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247\u2013258. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-77566-9_21"},{"issue":"3","key":"27_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/1086649.1086670","volume":"36","author":"R Dorrigiv","year":"2005","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A.: A survey of performance measures for on-line algorithms. SIGACT News 36(3), 67\u201381 (2005)","journal-title":"SIGACT News"},{"issue":"6","key":"27_CR18","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C Dwork","year":"1990","unstructured":"Dwork, C., Stockmeyer, L.J.: A time complexity gap for two-way probabilistic finite-state automata. SIAM J. Comput. 19(6), 1011\u20131123 (1990)","journal-title":"SIAM J. Comput."},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02927-1_36","volume-title":"Automata, Languages and Programming","author":"Y Emek","year":"2009","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 427\u2013438. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02927-1_36"},{"issue":"24","key":"27_CR20","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. Theoret. Comput. Sci. 412(24), 2642\u20132656 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"27_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.3103\/S1066369X15110031","volume":"59","author":"AF Gainutdinova","year":"2015","unstructured":"Gainutdinova, A.F.: Comparative complexity of quantum and classical OBDDs for total and partial functions. Russ. Math. 59(11), 26\u201335 (2015). \n                    https:\/\/doi.org\/10.3103\/S1066369X15110031","journal-title":"Russ. Math."},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-21500-6_20","volume-title":"Developments in Language Theory","author":"A Gainutdinova","year":"2015","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Unary probabilistic and quantum automata on promise problems. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 252\u2013263. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-21500-6_20"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-58747-9_13","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Gainutdinova","year":"2017","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Nondeterministic unitary OBDDs. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 126\u2013140. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58747-9_13"},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1799-0","volume":"17","author":"A Gainutdinova","year":"2017","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. 17(2), 1\u201317 (2017). \n                    https:\/\/doi.org\/10.1007\/s11128-017-1799-0","journal-title":"Quantum Inf. Process."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: STOC 2007, pp. 516\u2013525 (2007)","DOI":"10.1145\/1250790.1250866"},{"key":"27_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2014.09.011","volume":"562","author":"Y Giannakopoulos","year":"2015","unstructured":"Giannakopoulos, Y., Koutsoupias, E.: Competitive analysis of maintaining frequent items of a stream. Theoret. Comput. Sci. 562, 23\u201332 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Hromkovic, J.: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (2005)","DOI":"10.1007\/3-540-27903-2"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. In: 27th Annual Symposium on FOCS 1986, pp. 244\u2013254. IEEE (1986)","DOI":"10.1109\/SFCS.1986.14"},{"issue":"7","key":"27_CR29","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1134\/S1995080218070144","volume":"39","author":"K Khadiev","year":"2018","unstructured":"Khadiev, K., Ibrahimov, R., Yakary\u0131lmaz, A.: New size hierarchies for two way automata. Lobachevskii J. Math. 39(7), 997\u20131009 (2018)","journal-title":"Lobachevskii J. Math."},{"key":"27_CR30","unstructured":"Khadiev, K., Khadieva, A.: Quantum automata for online minimization problems. In: Ninth Workshop on NCMA 2017 Short Papaers, pp. 25\u201333. Institute fur Computersprachen TU Wien (2017)"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-58747-9_16","volume-title":"Computer Science \u2013 Theory and Applications","author":"K Khadiev","year":"2017","unstructured":"Khadiev, K., Khadieva, A.: Reordering method and hierarchies for quantum and classical ordered binary decision diagrams. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 162\u2013175. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58747-9_16"},{"key":"27_CR32","doi-asserted-by":"publisher","unstructured":"Khadiev, K., Khadieva, A.: Quantum online streaming algorithms with logarithmic memory. Int. J. Theor. Phys. (2019). \n                    https:\/\/doi.org\/10.1007\/s10773-019-04209-1","DOI":"10.1007\/s10773-019-04209-1"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Khadieva, A.: Two-way quantum and classical machines with small memory for online minimization problems. In: International Conference on Micro- and Nano-Electronics 2018. Proceedings of SPIE, vol. 11022, p. 110222T (2019)","DOI":"10.1117\/12.2522462"},{"key":"27_CR34","unstructured":"Khadiev, K., Khadieva, A., Kravchenko, D., Rivosh, A., Yamilov, R., Mannapov, I.: Quantum versus classical online streaming algorithms with logarithmic size of memory. Lobachevskii J. Math. (2019). (in print). \n                    arXiv:1710.09595"},{"issue":"9","key":"27_CR35","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1134\/S1995080218090421","volume":"39","author":"K Khadiev","year":"2018","unstructured":"Khadiev, K., Khadieva, A., Mannapov, I.: Quantum online algorithms with respect to space and advice complexity. Lobachevskii J. Math. 39(9), 1210\u20131220 (2018)","journal-title":"Lobachevskii J. Math."},{"key":"27_CR36","unstructured":"Khadiev, K., Ziatdinov, M., Mannapov, I., Khadieva, A., Yamilov, R.: Quantum online streaming algorithms with constant number of advice bits. \n                    arXiv:1802.05134\n                    \n                   (2018)"},{"key":"27_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation: Determinism, Randomization, Advice","author":"D Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation: Determinism, Randomization, Advice. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"key":"27_CR38","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Exponential separation of quantum and classical online space complexity. In: SPAA 2006, pp. 67\u201373. ACM (2006)","DOI":"10.1145\/1148109.1148119"},{"issue":"1","key":"27_CR39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.tcs.2004.12.031","volume":"334","author":"M Sauerhoff","year":"2005","unstructured":"Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. Theoret. Comput. Sci. 334(1), 177\u2013225 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-13350-8_16","volume-title":"Computing with New Resources","author":"ACC Say","year":"2014","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Quantum finite automata: a modern introduction. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 208\u2013222. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-13350-8_16"},{"key":"27_CR41","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"JC Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198\u2013200 (1959)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"27_CR42","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"27_CR43","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams: Theory and Applications","author":"I Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM, Philadelphia (2000)"},{"key":"27_CR44","volume-title":"Introduction to Discrete Mathematics: Textbook for Higher Schools","author":"SV Yablonsky","year":"1989","unstructured":"Yablonsky, S.V.: Introduction to Discrete Mathematics: Textbook for Higher Schools. Mir Publishers, Moscow (1989)"},{"key":"27_CR45","unstructured":"Yuan, Q.: Quantum online algorithms. UC Santa Barbara. Ph.D. thesis (2009)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T19:09:28Z","timestamp":1597345768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}