{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:26:41Z","timestamp":1743136001207,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_9","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:16:14Z","timestamp":1740140174000},"page":"127-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating Monotone Circuits on\u00a0Surfaces"],"prefix":"10.1007","author":[{"given":"Samir","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chetan","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00224-009-9172-z","volume":"45","author":"E Allender","year":"2009","unstructured":"Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theory Comput. Syst. 45(4), 675\u2013723 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ic.2003.09.002","volume":"189","author":"E Allender","year":"2004","unstructured":"Allender, E., Mahajan, M.: The complexity of planarity testing. Inf. Comput. 189(1), 117\u2013134 (2004)","journal-title":"Inf. Comput."},{"key":"9_CR3","unstructured":"Barrington, D.A.M., Lu, C., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, 4\u20136 May 1999, p.\u00a024 (1999)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1(1), 4:1\u20134:17 (2009)","DOI":"10.1145\/1490270.1490274"},{"issue":"1\/2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0019-9958(83)80049-7","volume":"56","author":"B von Braunm\u00fchl","year":"1983","unstructured":"von Braunm\u00fchl, B., Cook, S.A., Mehlhorn, K., Verbeek, R.: The recognition of deterministic CFL\u2019s in small time and space. Inf. Control 56(1\/2), 34\u201351 (1983)","journal-title":"Inf. Control"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11944836_8","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"T Chakraborty","year":"2006","unstructured":"Chakraborty, T., Datta, S.: One-input-face MPCVP is hard for L, But in LogDCFL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 57\u201368. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_8"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Deterministic CFL\u2019s are accepted simultaneously in polynomial time and log squared space. In: STOC 1979, 30 April\u20132 May 1979, Atlanta, Georgia, USA, pp. 338\u2013345 (1979)","DOI":"10.1145\/800135.804426"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-20877-5_52","volume-title":"Theory and Applications of Models of Computation","author":"S Datta","year":"2011","unstructured":"Datta, S., Prakriya, G.: Planarity testing revisited. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 540\u2013551. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_52"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/S0097539792226278","volume":"24","author":"AL Delcher","year":"1995","unstructured":"Delcher, A.L., Kosaraju, S.R.: An NC algorithm for evaluating monotone planar circuits. SIAM J. Comput. 24(2), 369\u2013375 (1995)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"5"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(89)90009-6","volume":"80","author":"PW Dymond","year":"1989","unstructured":"Dymond, P.W., Cook, S.A.: Complexity theory of parallel time and hardware. Inf. Comput. 80(3), 205\u2013226 (1989)","journal-title":"Inf. Comput."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/331605.331607","volume":"47","author":"PW Dymond","year":"2000","unstructured":"Dymond, P.W., Ruzzo, W.L.: Parallel rams with owned global memory and deterministic context-free language recognition. J. ACM 47(1), 16\u201345 (2000)","journal-title":"J. ACM"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Kawarabayashi, K.: Embedding and canonizing graphs of bounded genus in logspace. In: STOC 2014, New York, NY, USA, 31 May\u201303 June 2014, pp. 383\u2013392 (2014)","DOI":"10.1145\/2591796.2591865"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"LM Goldschlager","year":"1977","unstructured":"Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. SIGACT News 9(2), 25\u201329 (1977)","journal-title":"SIGACT News"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(80)90117-9","volume":"10","author":"LM Goldschlager","year":"1980","unstructured":"Goldschlager, L.M.: A space efficient algorithm for the monotone planar circuit value problem. Inf. Process. Lett. 10(1), 25\u201327 (1980)","journal-title":"Inf. Process. Lett."},{"key":"9_CR16","unstructured":"Gupta, C., Sharma, V.R., Tewari, R.: Reachability in $$O(\\log {n})$$ genus graphs is in unambiguous logspace. In: STACS, pp. 34:1\u201334:13 (2019)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 869\u2013942. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kyncl, J., Vyskocil, T.: Logspace reduction of directed reachability for bounded genus graphs to the planar case. ACM Trans. Comput. Theory 1(3), 8:1\u20138:11 (2010)","DOI":"10.1145\/1714450.1714451"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00037-009-0265-5","volume":"18","author":"N Limaye","year":"2009","unstructured":"Limaye, N., Mahajan, M., Sarma, J.: Upper bounds for monotone planar circuit value and variants. Comput. Complex. 18(3), 377\u2013412 (2009)","journal-title":"Comput. Complex."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-48686-0_19","volume-title":"Computing and Combinatorics","author":"P McKenzie","year":"1999","unstructured":"McKenzie, P., Reinhardt, K., Vinay, V.: Circuits and context-free languages. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 194\u2013203. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48686-0_19"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S0097539793260775","volume":"25","author":"V Ramachandran","year":"1996","unstructured":"Ramachandran, V., Yang, H.: An efficient parallel algorithm for the general planar monotone circuit value problem. SIAM J. Comput. 25(2), 312\u2013339 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/PL00009162","volume":"18","author":"V Ramachandran","year":"1997","unstructured":"Ramachandran, V., Yang, H.: An efficient parallel algorithm for the layered planar monotone circuit value problem. Algorithmica 18(3), 384\u2013404 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"WL Ruzzo","year":"1981","unstructured":"Ruzzo, W.L.: On uniform circuit complexity. J. Comput. Syst. Sci. 22(3), 365\u2013383 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"LJ Stockmeyer","year":"1984","unstructured":"Stockmeyer, L.J., Vishkin, U.: Simulation of parallel random access machines by circuits. SIAM J. Comput. 13(2), 409\u2013422 (1984)","journal-title":"SIAM J. Comput."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Stolee, D., Bourke, C., Vinodchandran, N.V.: A log-space algorithm for reachability in planar acyclic digraphs with few sources. In: CCC 2010, Cambridge, Massachusetts, USA, 9\u201312 June 2010, pp. 131\u2013138 (2010)","DOI":"10.1109\/CCC.2010.36"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Stolee, D., Vinodchandran, N.V.: Space-efficient algorithms for reachability in surface-embedded graphs. In: CCC 2012, Porto, Portugal, 26\u201329 June 2012, pp. 326\u2013333 (2012)","DOI":"10.1109\/CCC.2012.15"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"IH Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25(3), 405\u2013414 (1978)","journal-title":"J. ACM"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2012.03.002","volume":"215","author":"R Tewari","year":"2012","unstructured":"Tewari, R., Vinodchandran, N.V.: Green\u2019s theorem and isolation in planar graphs. Inf. Comput. 215, 1\u20137 (2012)","journal-title":"Inf. Comput."},{"issue":"3","key":"9_CR29","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00224-009-9188-4","volume":"47","author":"T Thierauf","year":"2010","unstructured":"Thierauf, T., Wagner, F.: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. Theory Comput. Syst. 47(3), 655\u2013673 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9_CR30","unstructured":"Yang, H.: An NC algorithm for the general planar monotone circuit value problem. In: SPDP 1991, 2\u20135 December 1991, Dallas, Texas, USA, pp. 196\u2013203 (1991)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:16:22Z","timestamp":1740140182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}