{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:05Z","timestamp":1742913785455,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_4","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"56-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Complexity of Expansion"],"prefix":"10.1007","author":[{"given":"Samir","family":"Datta","sequence":"first","affiliation":[]},{"given":"Anuj","family":"Tawari","sequence":"additional","affiliation":[]},{"given":"Yadu","family":"Vasudev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44465-8_2","volume-title":"Mathematical Foundations of Computer Science 2014","author":"E Allender","year":"2014","unstructured":"Allender, E., Balaji, N., Datta, S.: Low-depth uniform threshold circuits and the bit-complexity of straight line programs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 13\u201324. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_2"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Barcel\u00f3, P., Romero, M., Zeume, T.: A more general theory of static approximations for conjunctive queries. In: 21st International Conference on Database Theory, ICDT 2018, Vienna, Austria, March 26\u201329, 2018), pp. 7:1\u20137:22 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2018.7","DOI":"10.4230\/LIPIcs.ICDT.2018.7"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DAM Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within nc$${^1}$$. J. Comput. Syst. Sci. 41(3), 274\u2013306 (1990). https:\/\/doi.org\/10.1016\/0022-0000(90)90022-D","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-54458-7_16","volume-title":"Foundations of Software Science and Computation Structures","author":"P Bouyer","year":"2017","unstructured":"Bouyer, P., Jug\u00e9, V.: Dynamic complexity of the dyck reachability. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 265\u2013280. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_16"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Chen, X., Oliveira, I.C., Servedio, R.A., Tan, L.: Near-optimal small-depth lower bounds for small distance connectivity. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18\u201321, 2016, pp. 612\u2013625. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897534","DOI":"10.1145\/2897518.2897534"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"SA Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8(3), 385\u2013394 (1987). https:\/\/doi.org\/10.1016\/0196-6774(87)90018-6","journal-title":"J. Algorithms"},{"issue":"5\u20136","key":"4_CR7","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1017\/S096354831000012X","volume":"19","author":"A Czumaj","year":"2010","unstructured":"Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. Comb. Probab. Comput. 19(5\u20136), 693\u2013709 (2010). https:\/\/doi.org\/10.1017\/S096354831000012X","journal-title":"Comb. Probab. Comput."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-662-43948-7_30","volume-title":"Automata, Languages, and Programming","author":"S Datta","year":"2014","unstructured":"Datta, S., Hesse, W., Kulkarni, R.: Dynamic complexity of directed reachability and other problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 356\u2013367. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_30"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/3212685","volume":"65","author":"S Datta","year":"2018","unstructured":"Datta, S., Kulkarni, R., Mukherjee, A., Schwentick, T., Zeume, T.: Reachability is in dynfo. J. ACM 65(5), 33:1\u201333:24 (2018). https:\/\/doi.org\/10.1145\/3212685","journal-title":"J. ACM"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Datta, S., Kumar, P., Mukherjee, A., Tawari, A., Vortmeier, N., Zeume, T.: Dynamic complexity of reachability: How many changes can we handle? In: Czumaj, A., Dawar, A., Merelli, E. (eds.) In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbr\u00fccken, Germany, July 8\u201311, 2020, (Virtual Conference). LIPIcs, vol. 168, pp. 122:1\u2013122:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.122","DOI":"10.4230\/LIPIcs.ICALP.2020.122"},{"issue":"2","key":"4_CR11","first-page":"1","volume":"15","author":"S Datta","year":"2019","unstructured":"Datta, S., Mukherjee, A., Schwentick, T., Vortmeier, N., Zeume, T.: A strategy for dynamic programs: start over and muddle through. Log. Methods Comput. Sci. 15(2), 1\u201314 (2019). https:\/\/lmcs.episciences.org\/5442","journal-title":"Log. Methods Comput. Sci."},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Datta, S., Mukherjee, A., Vortmeier, N., Zeume, T.: Reachability and distances under multiple changes. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9\u201313, 2018. LIPIcs, vol. 107. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.120","DOI":"10.4230\/LIPIcs.ICALP.2018.120"},{"key":"4_CR13","unstructured":"Datta, S., Mukherjee, A., Vortmeier, N., Zeume, T.: Reachability and distances under multiple changes. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9\u201313, 2018, pp. 120:1\u2013120:14 (2018)"},{"issue":"2\u20134","key":"4_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01530820","volume":"14","author":"G Dong","year":"1995","unstructured":"Dong, G., Su, J., Topor, R.W.: Nonrecursive incremental evaluation of datalog queries. Ann. Math. Artif. Intell. 14(2\u20134), 187\u2013223 (1995). https:\/\/doi.org\/10.1007\/BF01530820","journal-title":"Ann. Math. Artif. Intell."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-22670-0_9","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 68\u201375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_9"},{"key":"4_CR16","unstructured":"Goranci, G.: Dynamic graph algorithms and graph sparsification: new techniques and connections. CoRR abs\/1909.06413 (2019). http:\/\/arxiv.org\/abs\/1909.06413"},{"key":"4_CR17","unstructured":"Goranci, G., R\u00e4cke, H., Saranurak, T., Tan, Z.: The expander hierarchy and its applications to dynamic graph algorithms. CoRR abs\/2005.02369 (2020). https:\/\/arxiv.org\/abs\/2005.02369"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/11672142_55","volume-title":"STACS 2006","author":"A Healy","year":"2006","unstructured":"Healy, A., Viola, E.: Constant-depth circuits for arithmetic in finite fields of characteristic two. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 672\u2013683. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_55"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(02)00740-5","volume":"296","author":"W Hesse","year":"2003","unstructured":"Hesse, W.: The dynamic complexity of transitive closure is in dyntc$${}^{\\text{0 }}$$. Theor. Comput. Sci. 296(3), 473\u2013485 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00740-5","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4), 695\u2013716 (2002). https:\/\/doi.org\/10.1016\/S0022-0000(02)00025-9","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR21","volume-title":"Linear algebra","author":"K Hoffman","year":"1971","unstructured":"Hoffman, K., Kunze, R.: Linear algebra. Englewood Cliffs, New Jersey (1971)"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N Immerman","year":"1989","unstructured":"Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18(3), 625\u2013638 (1989). https:\/\/doi.org\/10.1137\/0218043","journal-title":"SIAM J. Comput."},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1137\/100802980","volume":"40","author":"S Kale","year":"2011","unstructured":"Kale, S., Seshadhri, C.: An expansion tester for bounded degree graphs. SIAM J. Comput. 40(3), 709\u2013720 (2011). https:\/\/doi.org\/10.1137\/100802980","journal-title":"SIAM J. Comput."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, P., Vortmeier, N., Zeume, T.: Dynamic graph queries. In: 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France (March 15\u201318, 2016), pp. 14:1\u201314:18 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2016.14","DOI":"10.4230\/LIPIcs.ICDT.2016.14"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. J. Comput. Syst. Sci. 55(2), 199\u2013209 (1997). https:\/\/doi.org\/10.1006\/jcss.1997.1520","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Schmidt, J., Schwentick, T., Vortmeier, N., Zeume, T., Kokkinis, I.: Dynamic complexity meets parameterised algorithms. In: 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, Barcelona, Spain, January 13\u201316, 2020, pp. 36:1\u201336:17 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.36","DOI":"10.4230\/LIPIcs.CSL.2020.36"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3241040","volume":"43","author":"T Schwentick","year":"2018","unstructured":"Schwentick, T., Vortmeier, N., Zeume, T.: Dynamic complexity under definable changes. ACM Trans. Database Syst. 43(3), 12:1\u201312:38 (2018). https:\/\/doi.org\/10.1145\/3241040","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"4_CR28","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3442322.3442325","volume":"49","author":"T Schwentick","year":"2020","unstructured":"Schwentick, T., Vortmeier, N., Zeume, T.: Sketches of dynamic complexity. SIGMOD Rec. 49(2), 18\u201329 (2020). https:\/\/doi.org\/10.1145\/3442322.3442325","journal-title":"SIGMOD Rec."},{"key":"4_CR29","series-title":"An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03927-4"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ic.2017.04.005","volume":"256","author":"T Zeume","year":"2017","unstructured":"Zeume, T.: The dynamic descriptive complexity of k-clique. Inf. Comput. 256, 9\u201322 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.04.005","journal-title":"Inf. Comput."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ic.2014.09.011","volume":"240","author":"T Zeume","year":"2015","unstructured":"Zeume, T., Schwentick, T.: On the quantifier-free dynamic complexity of reachability. Inf. Comput. 240, 108\u2013129 (2015). https:\/\/doi.org\/10.1016\/j.ic.2014.09.011","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:20:41Z","timestamp":1623972041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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":"9.2","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)"}}]}}