--- _id: '15006' abstract: - lang: eng text: Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to economics and biology. Yet, even though an agent’s payoff only depends on the actions of their direct neighbors in graphical games, computing the Nash equilibria and making statements about the convergence time of "natural" local dynamics in particular can be highly challenging. In this work, we present a novel approach for classifying complexity of Nash equilibria in graphical games by establishing a connection to local graph algorithms, a subfield of distributed computing. In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with constant-round local algorithms. This connection allows us to derive novel lower bounds on the convergence time to equilibrium of best-response dynamics in graphical games. Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of "time-constrained" inefficiency of best responses. We exemplify how our results can be used in the implementation of mechanisms that ensure convergence of best responses to a Nash equilibrium. Our results thus also give insight into the convergence of strategy-proof algorithms for graphical games, which is still not well understood. acknowledgement: This work was partially funded by the Academy of Finland, grant 314888, the European Research Council CoG 863818 (ForM-SMArt), and the Austrian Science Fund (FWF) project I 4800-N (ADVISE). LS was supported by the Stochastic Analysis and Application Research Center (SAARC) under National Research Foundation of Korea grant NRF-2019R1A5A1028324. alternative_title: - LIPIcs article_number: '11' article_processing_charge: No author: - first_name: Juho full_name: Hirvonen, Juho last_name: Hirvonen - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.11' apa: 'Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11' chicago: 'Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.' ieee: 'J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.' ista: 'Hirvonen J, Schmid L, Chatterjee K, Schmid S. 2024. On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 11.' mla: 'Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” 27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11.' short: J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. conference: end_date: 2023-12-08 location: Tokyo, Japan name: 'OPODIS: Conference on Principles of Distributed Systems' start_date: 2023-12-06 date_created: 2024-02-18T23:01:01Z date_published: 2024-01-18T00:00:00Z date_updated: 2024-02-26T09:16:12Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.OPODIS.2023.11 ec_funded: 1 external_id: arxiv: - '2102.13457' file: - access_level: open_access checksum: 4fc7eea6e4ba140b904781fc7df868ec content_type: application/pdf creator: dernst date_created: 2024-02-26T09:04:58Z date_updated: 2024-02-26T09:04:58Z file_id: '15028' file_name: 2024_LIPICs_Hirvonen.pdf file_size: 867363 relation: main_file success: 1 file_date_updated: 2024-02-26T09:04:58Z has_accepted_license: '1' intvolume: ' 286' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '01' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: 27th International Conference on Principles of Distributed Systems publication_identifier: isbn: - '9783959773089' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'On the convergence time in graphical games: A locality-sensitive approach' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 286 year: '2024' ... --- _id: '15001' abstract: - lang: eng text: "Self-replication of amyloid fibrils via secondary nucleation is an intriguing physicochemical phenomenon in which existing fibrils catalyze the formation of their own copies. The molecular events behind this fibril surface-mediated process remain largely inaccessible to current structural and imaging techniques. Using statistical mechanics, computer modeling, and chemical kinetics, we show that the catalytic structure of the fibril surface can be inferred from the aggregation behavior in the presence and absence of a fibril-binding inhibitor. We apply our approach to the case of Alzheimer’s A\r\n amyloid fibrils formed in the presence of proSP-C Brichos inhibitors. We find that self-replication of A\r\n fibrils occurs on small catalytic sites on the fibril surface, which are far apart from each other, and each of which can be covered by a single Brichos inhibitor." acknowledgement: We acknowledge support from the Erasmus programme and the University College London Institute for the Physics of Living Systems (S.C., T.C.T.M., A.Š.), the Biotechnology and Biological Sciences Research Council (T.P.J.K.), the Engineering and Physical Sciences Research Council (D.F.), the European Research Council (T.P.J.K., S.L., D.F., and A.Š.), the Frances and Augustus Newman Foundation (T.P.J.K.), the Academy of Medical Sciences and Wellcome Trust (A.Š.), and the Royal Society (S.C. and A.Š.). article_number: e2220075121 article_processing_charge: Yes article_type: original author: - first_name: Samo full_name: Curk, Samo id: 031eff0d-d481-11ee-8508-cd12a7a86e5b last_name: Curk orcid: 0000-0001-6160-9766 - first_name: Johannes full_name: Krausser, Johannes last_name: Krausser - first_name: Georg full_name: Meisl, Georg last_name: Meisl - first_name: Daan full_name: Frenkel, Daan last_name: Frenkel - first_name: Sara full_name: Linse, Sara last_name: Linse - first_name: Thomas C.T. full_name: Michaels, Thomas C.T. last_name: Michaels - first_name: Tuomas P.J. full_name: Knowles, Tuomas P.J. last_name: Knowles - first_name: Anđela full_name: Šarić, Anđela id: bf63d406-f056-11eb-b41d-f263a6566d8b last_name: Šarić orcid: 0000-0002-7854-2139 citation: ama: Curk S, Krausser J, Meisl G, et al. Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(7). doi:10.1073/pnas.2220075121 apa: Curk, S., Krausser, J., Meisl, G., Frenkel, D., Linse, S., Michaels, T. C. T., … Šarić, A. (2024). Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites. Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2220075121 chicago: Curk, Samo, Johannes Krausser, Georg Meisl, Daan Frenkel, Sara Linse, Thomas C.T. Michaels, Tuomas P.J. Knowles, and Anđela Šarić. “Self-Replication of Aβ42 Aggregates Occurs on Small and Isolated Fibril Sites.” Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2220075121. ieee: S. Curk et al., “Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 7. Proceedings of the National Academy of Sciences, 2024. ista: Curk S, Krausser J, Meisl G, Frenkel D, Linse S, Michaels TCT, Knowles TPJ, Šarić A. 2024. Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites. Proceedings of the National Academy of Sciences of the United States of America. 121(7), e2220075121. mla: Curk, Samo, et al. “Self-Replication of Aβ42 Aggregates Occurs on Small and Isolated Fibril Sites.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 7, e2220075121, Proceedings of the National Academy of Sciences, 2024, doi:10.1073/pnas.2220075121. short: S. Curk, J. Krausser, G. Meisl, D. Frenkel, S. Linse, T.C.T. Michaels, T.P.J. Knowles, A. Šarić, Proceedings of the National Academy of Sciences of the United States of America 121 (2024). date_created: 2024-02-18T23:01:00Z date_published: 2024-02-13T00:00:00Z date_updated: 2024-02-26T08:45:56Z day: '13' ddc: - '570' department: - _id: AnSa doi: 10.1073/pnas.2220075121 ec_funded: 1 external_id: pmid: - '38335256' file: - access_level: open_access checksum: 5aeb65bcc0dd829b1f9ab307c5031d4b content_type: application/pdf creator: dernst date_created: 2024-02-26T08:20:00Z date_updated: 2024-02-26T08:20:00Z file_id: '15026' file_name: 2024_PNAS_Curk.pdf file_size: 7699487 relation: main_file success: 1 file_date_updated: 2024-02-26T08:20:00Z has_accepted_license: '1' intvolume: ' 121' issue: '7' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '02' oa: 1 oa_version: Published Version pmid: 1 project: - _id: eba2549b-77a9-11ec-83b8-a81e493eae4e call_identifier: H2020 grant_number: '802960' name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines' publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: Proceedings of the National Academy of Sciences quality_controlled: '1' related_material: record: - id: '15027' relation: research_data status: public scopus_import: '1' status: public title: Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 121 year: '2024' ... --- _id: '15002' abstract: - lang: eng text: "The lattice Schwinger model, the discrete version of QED in \r\n1\r\n+\r\n1\r\n dimensions, is a well-studied test bench for lattice gauge theories. Here, we study the fractal properties of this model. We reveal the self-similarity of the ground state, which allows us to develop a recurrent procedure for finding the ground-state wave functions and predicting ground-state energies. We present the results of recurrently calculating ground-state wave functions using the fractal Ansatz and automized software package for fractal image processing. In certain parameter regimes, just a few terms are enough for our recurrent procedure to predict ground-state energies close to the exact ones for several hundreds of sites. Our findings pave the way to understanding the complexity of calculating many-body wave functions in terms of their fractal properties as well as finding new links between condensed matter and high-energy lattice models." acknowledgement: "We thank A. Bargov, I. Khaymovich, and V. Tiunova for fruitful discussions and for useful comments. M. C. B. thanks S. Kühn for discussions about the phase structure of the model. A. K. F. thanks V. Gritsev and A. Garkun for insightful comments. E. V. P., E. S. T., and A. K. F. are\r\nsupported by the RSF Grant No. 20-42-05002 (studying the fractal Ansatz) and the Roadmap on Quantum Computing (Contract No. 868-1.3-15/15-2021, October 5, 2021; calculating on GS energies). A. K. F. thanks the Priority 2030 program at the NIST “MISIS” under the project No. K1-2022-027. M. C. B. was partly funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111–390814868." article_number: '050401' article_processing_charge: No article_type: original author: - first_name: Elena full_name: Petrova, Elena id: 0ac84990-897b-11ed-a09c-f5abb56a4ede last_name: Petrova - first_name: Egor S. full_name: Tiunov, Egor S. last_name: Tiunov - first_name: Mari Carmen full_name: Bañuls, Mari Carmen last_name: Bañuls - first_name: Aleksey K. full_name: Fedorov, Aleksey K. last_name: Fedorov citation: ama: Petrova E, Tiunov ES, Bañuls MC, Fedorov AK. Fractal states of the Schwinger model. Physical Review Letters. 2024;132(5). doi:10.1103/PhysRevLett.132.050401 apa: Petrova, E., Tiunov, E. S., Bañuls, M. C., & Fedorov, A. K. (2024). Fractal states of the Schwinger model. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.132.050401 chicago: Petrova, Elena, Egor S. Tiunov, Mari Carmen Bañuls, and Aleksey K. Fedorov. “Fractal States of the Schwinger Model.” Physical Review Letters. American Physical Society, 2024. https://doi.org/10.1103/PhysRevLett.132.050401. ieee: E. Petrova, E. S. Tiunov, M. C. Bañuls, and A. K. Fedorov, “Fractal states of the Schwinger model,” Physical Review Letters, vol. 132, no. 5. American Physical Society, 2024. ista: Petrova E, Tiunov ES, Bañuls MC, Fedorov AK. 2024. Fractal states of the Schwinger model. Physical Review Letters. 132(5), 050401. mla: Petrova, Elena, et al. “Fractal States of the Schwinger Model.” Physical Review Letters, vol. 132, no. 5, 050401, American Physical Society, 2024, doi:10.1103/PhysRevLett.132.050401. short: E. Petrova, E.S. Tiunov, M.C. Bañuls, A.K. Fedorov, Physical Review Letters 132 (2024). date_created: 2024-02-18T23:01:00Z date_published: 2024-01-30T00:00:00Z date_updated: 2024-02-26T08:03:31Z day: '30' department: - _id: MaSe doi: 10.1103/PhysRevLett.132.050401 external_id: arxiv: - '2201.10220' intvolume: ' 132' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2201.10220 month: '01' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: eissn: - 1079-7114 issn: - 0031-9007 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Fractal states of the Schwinger model type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 132 year: '2024' ... --- _id: '12485' abstract: - lang: eng text: In this paper we introduce the critical variational setting for parabolic stochastic evolution equations of quasi- or semi-linear type. Our results improve many of the abstract results in the classical variational setting. In particular, we are able to replace the usual weak or local monotonicity condition by a more flexible local Lipschitz condition. Moreover, the usual growth conditions on the multiplicative noise are weakened considerably. Our new setting provides general conditions under which local and global existence and uniqueness hold. Moreover, we prove continuous dependence on the initial data. We show that many classical SPDEs, which could not be covered by the classical variational setting, do fit in the critical variational setting. In particular, this is the case for the Cahn-Hilliard equations, tamed Navier-Stokes equations, and Allen-Cahn equation. acknowledgement: The first author has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819) . The second author is supported by the VICI subsidy VI.C.212.027 of the Netherlands Organisation for Scientific Research (NWO). article_processing_charge: No article_type: original author: - first_name: Antonio full_name: Agresti, Antonio id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72 last_name: Agresti orcid: 0000-0002-9573-2962 - first_name: Mark full_name: Veraar, Mark last_name: Veraar citation: ama: Agresti A, Veraar M. The critical variational setting for stochastic evolution equations. Probability Theory and Related Fields. 2024. doi:10.1007/s00440-023-01249-x apa: Agresti, A., & Veraar, M. (2024). The critical variational setting for stochastic evolution equations. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-023-01249-x chicago: Agresti, Antonio, and Mark Veraar. “The Critical Variational Setting for Stochastic Evolution Equations.” Probability Theory and Related Fields. Springer Nature, 2024. https://doi.org/10.1007/s00440-023-01249-x. ieee: A. Agresti and M. Veraar, “The critical variational setting for stochastic evolution equations,” Probability Theory and Related Fields. Springer Nature, 2024. ista: Agresti A, Veraar M. 2024. The critical variational setting for stochastic evolution equations. Probability Theory and Related Fields. mla: Agresti, Antonio, and Mark Veraar. “The Critical Variational Setting for Stochastic Evolution Equations.” Probability Theory and Related Fields, Springer Nature, 2024, doi:10.1007/s00440-023-01249-x. short: A. Agresti, M. Veraar, Probability Theory and Related Fields (2024). date_created: 2023-02-02T10:45:15Z date_published: 2024-02-02T00:00:00Z date_updated: 2024-02-26T09:39:07Z day: '02' department: - _id: JuFi doi: 10.1007/s00440-023-01249-x ec_funded: 1 external_id: arxiv: - '2206.00230' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/s00440-023-01249-x month: '02' oa: 1 oa_version: Preprint project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: Probability Theory and Related Fields publication_identifier: eissn: - 1432-2064 issn: - 0178-8051 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: The critical variational setting for stochastic evolution equations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- _id: '15008' abstract: - lang: eng text: "Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. \r\nIn this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth." acknowledgement: "Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project Z\r\n422-N, project I 5982-N, and project P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke: Research supported by German Research Foundation (DFG), grant 470029389\r\n(FlexNets), 2021-2024.\r\nSushant Sachdeva: SS’s work is supported by an Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Grant RGPIN-2018-06398 and a Sloan Research Fellowship." alternative_title: - LIPIcs article_number: '55' article_processing_charge: No author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Sushant full_name: Sachdeva, Sushant last_name: Sachdeva - first_name: A. R. full_name: Sricharan, A. R. last_name: Sricharan citation: ama: 'Goranci G, Henzinger MH, Räcke H, Sachdeva S, Sricharan AR. Electrical flows for polylogarithmic competitive oblivious routing. In: 15th Innovations in Theoretical Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ITCS.2024.55' apa: 'Goranci, G., Henzinger, M. H., Räcke, H., Sachdeva, S., & Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.55' chicago: Goranci, Gramoz, Monika H Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” In 15th Innovations in Theoretical Computer Science Conference, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.55. ieee: G. Goranci, M. H. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287. ista: 'Goranci G, Henzinger MH, Räcke H, Sachdeva S, Sricharan AR. 2024. Electrical flows for polylogarithmic competitive oblivious routing. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 287, 55.' mla: Goranci, Gramoz, et al. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” 15th Innovations in Theoretical Computer Science Conference, vol. 287, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ITCS.2024.55. short: G. Goranci, M.H. Henzinger, H. Räcke, S. Sachdeva, A.R. Sricharan, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. conference: end_date: 2024-02-02 location: Berkeley, CA, United States name: 'ITCS: Innovations in Theoretical Computer Science Conference' start_date: 2024-01-30 date_created: 2024-02-18T23:01:02Z date_published: 2024-01-24T00:00:00Z date_updated: 2024-02-26T10:12:19Z day: '24' ddc: - '000' department: - _id: MoHe doi: 10.4230/LIPIcs.ITCS.2024.55 ec_funded: 1 external_id: arxiv: - '2303.02491' file: - access_level: open_access checksum: b89716aae6a5599f187897e39de1e53a content_type: application/pdf creator: dernst date_created: 2024-02-26T10:10:48Z date_updated: 2024-02-26T10:10:48Z file_id: '15030' file_name: 2024_LIPICs_Goranci.pdf file_size: 1054754 relation: main_file success: 1 file_date_updated: 2024-02-26T10:10:48Z has_accepted_license: '1' intvolume: ' 287' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Wittgenstein Award - Monika Henzinger - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: 'P33775 ' name: Fast Algorithms for a Reactive Network Layer publication: 15th Innovations in Theoretical Computer Science Conference publication_identifier: isbn: - '9783959773096' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Electrical flows for polylogarithmic competitive oblivious routing tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 287 year: '2024' ...