[{"quality_controlled":"1","abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over p parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the p cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an 𝒪(p) approximation algorithm for the problem with p parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to 𝒪(√p). We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network."}],"department":[{"_id":"KrCh"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Křišťan, Jan Matyáš","last_name":"Křišťan","first_name":"Jan Matyáš"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","first_name":"Jakub","last_name":"Svoboda"},{"last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X","orcid":"0009-0001-3676-4809","full_name":"Yeo, Michelle X"}],"title":"Boosting payment channel network liquidity with topology optimization and transaction selection","main_file_link":[{"url":"https://eprint.iacr.org/2025/1484.pdf","open_access":"1"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774024"]},"arxiv":1,"license":"https://creativecommons.org/licenses/by/4.0/","type":"conference","date_published":"2025-10-22T00:00:00Z","article_number":"23","_id":"21412","intvolume":"       356","alternative_title":["LIPIcs"],"scopus_import":"1","OA_place":"publisher","date_created":"2026-03-08T23:01:46Z","acknowledgement":"Chatterjee, Krishnendu: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nKřišťan, Jan Matyáš: Czech Science Foundation Grant no. 24-12046S.\r\nSchmid, Stefan: German Research Foundation (DFG) project ReNO (SPP 2378) from 2023-2027.\r\nSvoboda, Jakub: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nYeo, Michelle: MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms).","language":[{"iso":"eng"}],"conference":{"end_date":"2025-10-31","location":"Berlin, Germany","name":"DISC: Symposium on Distributed Computing","start_date":"2025-10-27"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"22","article_processing_charge":"No","volume":356,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"file_date_updated":"2026-03-09T11:51:59Z","file":[{"creator":"dernst","date_updated":"2026-03-09T11:51:59Z","file_size":1130069,"content_type":"application/pdf","date_created":"2026-03-09T11:51:59Z","success":1,"file_name":"2025_DISC_Chatterjee.pdf","file_id":"21418","checksum":"8e3d1594365df60163d9df22158a37b1","access_level":"open_access","relation":"main_file"}],"oa":1,"oa_version":"Published Version","OA_type":"gold","ddc":["000"],"doi":"10.4230/LIPIcs.DISC.2025.23","publication_status":"published","status":"public","date_updated":"2026-03-09T11:52:58Z","ec_funded":1,"month":"10","publication":"39th International Symposium on Distributed Computing","has_accepted_license":"1","external_id":{"arxiv":["2508.14524"]},"year":"2025","citation":{"ieee":"K. Chatterjee, J. M. Křišťan, S. Schmid, J. Svoboda, and M. X. Yeo, “Boosting payment channel network liquidity with topology optimization and transaction selection,” in <i>39th International Symposium on Distributed Computing</i>, Berlin, Germany, 2025, vol. 356.","apa":"Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2025). Boosting payment channel network liquidity with topology optimization and transaction selection. In <i>39th International Symposium on Distributed Computing</i> (Vol. 356). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>","ama":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. Boosting payment channel network liquidity with topology optimization and transaction selection. In: <i>39th International Symposium on Distributed Computing</i>. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>","chicago":"Chatterjee, Krishnendu, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” In <i>39th International Symposium on Distributed Computing</i>, Vol. 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>.","mla":"Chatterjee, Krishnendu, et al. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” <i>39th International Symposium on Distributed Computing</i>, vol. 356, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>.","short":"K. Chatterjee, J.M. Křišťan, S. Schmid, J. Svoboda, M.X. Yeo, in:, 39th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. 2025. Boosting payment channel network liquidity with topology optimization and transaction selection. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 23."}},{"quality_controlled":"1","abstract":[{"text":"In this work, we consider the list-decodability and list-recoverability of codes in the zero-rate regime. Briefly, a code 𝒞 ⊆ [q]ⁿ is (p,𝓁,L)-list-recoverable if for all tuples of input lists (Y₁,… ,Y_n) with each Y_i ⊆ [q] and |Y_i| = 𝓁, the number of codewords c ∈ 𝒞 such that c_i ∉ Y_i for at most pn choices of i ∈ [n] is less than L; list-decoding is the special case of 𝓁 = 1. In recent work by Resch, Yuan and Zhang (ICALP 2023) the zero-rate threshold for list-recovery was determined for all parameters: that is, the work explicitly computes p_*: = p_*(q,𝓁,L) with the property that for all ε > 0 (a) there exist positive-rate (p_*-ε,𝓁,L)-list-recoverable codes, and (b) any (p_*+ε,𝓁,L)-list-recoverable code has rate 0. In fact, in the latter case the code has constant size, independent on n. However, the constant size in their work is quite large in 1/ε, at least |𝒞| ≥ (1/(ε))^O(q^L).\r\nOur contribution in this work is to show that for all choices of q,𝓁 and L with q ≥ 3, any (p_*+ε,𝓁,L)-list-recoverable code must have size O_{q,𝓁,L}(1/ε), and furthermore this upper bound is complemented by a matching lower bound Ω_{q,𝓁,L}(1/ε). This greatly generalizes work by Alon, Bukh and Polyanskiy (IEEE Trans. Inf. Theory 2018) which focused only on the case of binary alphabet (and thus necessarily only list-decoding). We remark that we can in fact recover the same result for q = 2 and even L, as obtained by Alon, Bukh and Polyanskiy: we thus strictly generalize their work. \r\nOur main technical contribution is to (a) properly define a linear programming relaxation of the list-recovery condition over large alphabets; and (b) to demonstrate that a certain function defined on a q-ary probability simplex is maximized by the uniform distribution. This represents the core challenge in generalizing to larger q (as a binary simplex can be naturally identified with a one-dimensional interval). We can subsequently re-utilize certain Schur convexity and convexity properties established for a related function by Resch, Yuan and Zhang along with ideas of Alon, Bukh and Polyanskiy.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MaMo"}],"author":[{"full_name":"Resch, Nicolas","last_name":"Resch","first_name":"Nicolas"},{"first_name":"Chen","last_name":"Yuan","full_name":"Yuan, Chen"},{"last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan","orcid":"0000-0002-6465-6258","full_name":"Zhang, Yihan"}],"title":"Tight bounds on list-decodable and list-recoverable zero-rate codes","type":"conference","corr_author":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773614"]},"arxiv":1,"date_published":"2025-02-11T00:00:00Z","_id":"19281","intvolume":"       325","alternative_title":["LIPIcs"],"article_number":"82","OA_place":"publisher","date_created":"2025-03-02T23:01:53Z","scopus_import":"1","language":[{"iso":"eng"}],"acknowledgement":"The research of C. Yuan was support in part by the National Key R&D Program of China\r\nunder Grant 2023YFE0123900 and Natural Science Foundation of Shanghai under the 2024 Shanghai Action Plan for Science, Technology and Innovation Grant 24BC3200700. The research of N. Resch is supported in part by an NWO (Dutch Research Council) grant with number C.2324.0590, and this work was done in part while he was visiting the Simons Institute for the Theory of Computing, supported by DOE grant #DE-SC0024124.","conference":{"location":"New York, NY, United States","name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2025-01-07","end_date":"2025-01-10"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":325,"article_processing_charge":"Yes","day":"11","file_date_updated":"2025-03-04T09:35:57Z","file":[{"checksum":"df3921ddf1b360b07f43d427fea51242","access_level":"open_access","relation":"main_file","date_created":"2025-03-04T09:35:57Z","file_name":"2025_LIPIcs_Resch.pdf","file_id":"19286","success":1,"content_type":"application/pdf","creator":"dernst","file_size":898601,"date_updated":"2025-03-04T09:35:57Z"}],"oa":1,"OA_type":"gold","oa_version":"Published Version","ddc":["510","000"],"publication_status":"published","status":"public","doi":"10.4230/LIPIcs.ITCS.2025.82","date_updated":"2025-09-30T10:42:35Z","month":"02","publication":"16th Innovations in Theoretical Computer Science Conference","has_accepted_license":"1","year":"2025","citation":{"mla":"Resch, Nicolas, et al. “Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.” <i>16th Innovations in Theoretical Computer Science Conference</i>, vol. 325, 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.82\">10.4230/LIPIcs.ITCS.2025.82</a>.","short":"N. Resch, C. Yuan, Y. Zhang, in:, 16th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Resch N, Yuan C, Zhang Y. 2025. Tight bounds on list-decodable and list-recoverable zero-rate codes. 16th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 325, 82.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.” In <i>16th Innovations in Theoretical Computer Science Conference</i>, Vol. 325. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.82\">https://doi.org/10.4230/LIPIcs.ITCS.2025.82</a>.","ama":"Resch N, Yuan C, Zhang Y. Tight bounds on list-decodable and list-recoverable zero-rate codes. In: <i>16th Innovations in Theoretical Computer Science Conference</i>. Vol 325. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.82\">10.4230/LIPIcs.ITCS.2025.82</a>","apa":"Resch, N., Yuan, C., &#38; Zhang, Y. (2025). Tight bounds on list-decodable and list-recoverable zero-rate codes. In <i>16th Innovations in Theoretical Computer Science Conference</i> (Vol. 325). New York, NY, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.82\">https://doi.org/10.4230/LIPIcs.ITCS.2025.82</a>","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Tight bounds on list-decodable and list-recoverable zero-rate codes,” in <i>16th Innovations in Theoretical Computer Science Conference</i>, New York, NY, United States, 2025, vol. 325."},"external_id":{"arxiv":["2309.01800"],"isi":["001532717300082"]}},{"scopus_import":"1","OA_place":"publisher","date_created":"2025-06-22T22:02:06Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the\r\nEuropean Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was further supported by the Federal Ministry of Education and Research (BMBF) project, 6G-RIC: 6G Research and Innovation Cluster, grant 16KISK020K.","language":[{"iso":"eng"}],"date_published":"2025-06-02T00:00:00Z","article_number":"4","_id":"19858","intvolume":"       330","alternative_title":["LIPIcs"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"conference":{"end_date":"2025-06-11","location":"Liverpool, United Kingdom","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks","start_date":"2025-06-09"},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"author":[{"id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","first_name":"Antoine","last_name":"El-Hayek","full_name":"El-Hayek, Antoine"},{"full_name":"Hanauer, Kathrin","last_name":"Hanauer","first_name":"Kathrin"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"}],"abstract":[{"lang":"eng","text":"Given a graph G that undergoes a sequence of edge insertions and deletions, we study the Maximum k-Edge Coloring problem (MkEC): Having access to k different colors, color as many edges of G as possible such that no two adjacent edges share the same color. While this problem is different from simply maintaining a b-matching with b = k, the two problems are related. However, maximum b-matching can be solved efficiently in the static setting, whereas MkEC is NP-hard and even APX-hard for k ≥ 2. \r\nWe present new results on both problems: For b-matching, we show a new integrality gap result and we adapt Wajc’s matching sparsification scheme [David Wajc, 2020] for the case where b is a constant.\r\nUsing these as basis, we give three new algorithms for the dynamic MkEC problem: Our MatchO algorithm builds on the dynamic (2+ε)-approximation algorithm of Bhattacharya, Gupta, and Mohan [Sayan Bhattacharya et al., 2017] for b-matching and achieves a (2+ε)(k+1)/k-approximation in O(poly(log n, ε^-1)) update time against an oblivious adversary. Our MatchA algorithm builds on the dynamic (7+ε)-approximation algorithm by Bhattacharya, Henzinger, and Italiano [Sayan Bhattacharya et al., 2015] for fractional b-matching and achieves a (7+ε)(3k+3)/(3k-1)-approximation in O(poly(log n, ε^-1)) update time against an adaptive adversary. Moreover, our reductions use the dynamic b-matching algorithm as a black box, so any future improvement in the approximation ratio for dynamic b-matching will automatically translate into a better approximation ratio for our algorithms. Finally, we present a greedy algorithm with O(Δ+k) update time, which guarantees a 2.16 approximation factor."}],"quality_controlled":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773683"]},"arxiv":1,"type":"conference","corr_author":"1","title":"On b-matching and fully-dynamic maximum k-edge coloring","publication":"4th Symposium on Algorithmic Foundations of Dynamic Networks","month":"06","ec_funded":1,"external_id":{"arxiv":["2310.01149"],"isi":["001532136900004"]},"citation":{"short":"A. El-Hayek, K. Hanauer, M. Henzinger, in:, 4th Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"El-Hayek, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">10.4230/LIPIcs.SAND.2025.4</a>.","ista":"El-Hayek A, Hanauer K, Henzinger M. 2025. On b-matching and fully-dynamic maximum k-edge coloring. 4th Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 330, 4.","chicago":"El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">https://doi.org/10.4230/LIPIcs.SAND.2025.4</a>.","ama":"El-Hayek A, Hanauer K, Henzinger M. On b-matching and fully-dynamic maximum k-edge coloring. In: <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">10.4230/LIPIcs.SAND.2025.4</a>","apa":"El-Hayek, A., Hanauer, K., &#38; Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">https://doi.org/10.4230/LIPIcs.SAND.2025.4</a>","ieee":"A. El-Hayek, K. Hanauer, and M. Henzinger, “On b-matching and fully-dynamic maximum k-edge coloring,” in <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, Liverpool, United Kingdom, 2025, vol. 330."},"year":"2025","has_accepted_license":"1","oa":1,"oa_version":"Published Version","OA_type":"gold","day":"02","article_processing_charge":"No","volume":330,"file_date_updated":"2025-06-23T11:23:29Z","file":[{"checksum":"ad93a1e052adb29d7bfe8bd551bab193","access_level":"open_access","relation":"main_file","date_created":"2025-06-23T11:23:29Z","success":1,"file_name":"2025_LIPIcs_ElHayek.pdf","file_id":"19872","content_type":"application/pdf","creator":"dernst","date_updated":"2025-06-23T11:23:29Z","file_size":995666}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"date_updated":"2025-09-30T13:37:28Z","ddc":["000"],"doi":"10.4230/LIPIcs.SAND.2025.4","publication_status":"published","status":"public"},{"title":"Quantitative language automata","publication_identifier":{"isbn":["9783959773898"],"issn":["1868-8969"]},"arxiv":1,"corr_author":"1","type":"conference","quality_controlled":"1","abstract":[{"lang":"eng","text":"A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA 𝒜 obtains a mean payoff, and every word w ∈ Σ^ω is assigned the maximal mean payoff obtained by nondeterministic runs of 𝒜 over w. We introduce quantitative language automata (QLAs) that define functions from language generators (i.e., implementations) to values, where a language generator can be nonprobabilistic, defining a set of infinite words, or probabilistic, defining a probability measure over infinite words. A QLA consists of a QWA and an aggregator function. For example, given a QWA 𝒜, the infimum aggregator maps each language L ⊆ Σ^ω to the greatest lower bound assigned by 𝒜 to any word in L. For boolean value sets, QWAs define boolean properties of traces, and QLAs define boolean properties of sets of traces, i.e., hyperproperties. For more general value sets, QLAs serve as a specification language for a generalization of hyperproperties, called quantitative hyperproperties. A nonprobabilistic (resp. probabilistic) quantitative hyperproperty assigns a value to each set (resp. distribution) G of traces, e.g., the minimal (resp. expected) average response time exhibited by the traces in G. We give several examples of quantitative hyperproperties and investigate three paradigmatic problems for QLAs: evaluation, nonemptiness, and universality. In the evaluation problem, given a QLA 𝔸 and an implementation G, we ask for the value that 𝔸 assigns to G. In the nonemptiness (resp. universality) problem, given a QLA 𝔸 and a value k, we ask whether 𝔸 assigns at least k to some (resp. every) language. We provide a comprehensive picture of decidability for these problems for QLAs with common aggregators as well as their restrictions to ω-regular languages and trace distributions generated by finite-state Markov chains."}],"department":[{"_id":"ToHe"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","last_name":"Kebis","full_name":"Kebis, Pavol"},{"last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"conference":{"start_date":"2025-08-26","location":"Aarhus, Denmark","name":"CONCUR: Conference on Concurrency Theory","end_date":"2025-08-29"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"date_published":"2025-08-18T00:00:00Z","article_number":"21","alternative_title":["LIPIcs"],"_id":"20253","intvolume":"       348","scopus_import":"1","date_created":"2025-08-31T22:01:32Z","OA_place":"publisher","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.4230/LIPIcs.CONCUR.2025.21","status":"public","publication_status":"published","date_updated":"2025-12-01T12:36:52Z","day":"18","article_processing_charge":"No","volume":348,"file_date_updated":"2025-09-03T10:01:53Z","file":[{"relation":"main_file","checksum":"9d4054058757a73477e6015b10ed6996","access_level":"open_access","file_id":"20282","file_name":"2025_CONCUR_HenzingerT.pdf","success":1,"date_created":"2025-09-03T10:01:53Z","content_type":"application/pdf","file_size":1257397,"date_updated":"2025-09-03T10:01:53Z","creator":"dernst"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"oa":1,"oa_version":"Published Version","OA_type":"gold","has_accepted_license":"1","external_id":{"arxiv":["2506.0515"],"isi":["001570540800021"]},"citation":{"apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &#38; Sarac, N. E. (2025). Quantitative language automata. In <i>36th International Conference on Concurrency Theory</i> (Vol. 348). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2025.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2025.21</a>","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Quantitative language automata. In: <i>36th International Conference on Concurrency Theory</i>. Vol 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2025.21\">10.4230/LIPIcs.CONCUR.2025.21</a>","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Language Automata.” In <i>36th International Conference on Concurrency Theory</i>, Vol. 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2025.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2025.21</a>.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 36th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Henzinger, Thomas A., et al. “Quantitative Language Automata.” <i>36th International Conference on Concurrency Theory</i>, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2025.21\">10.4230/LIPIcs.CONCUR.2025.21</a>.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2025. Quantitative language automata. 36th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 348, 21.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in <i>36th International Conference on Concurrency Theory</i>, Aarhus, Denmark, 2025, vol. 348."},"year":"2025","ec_funded":1,"publication":"36th International Conference on Concurrency Theory","month":"08"},{"article_number":"30","_id":"20290","alternative_title":["LIPIcs"],"intvolume":"       345","date_published":"2025-08-20T00:00:00Z","acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093. We thank anonymous reviewers for pointing us to the Hurwicz criterion and to the work of Gallego-Hernández and Mansutti [13]. We thank Marie van den Bogaard for her valuable feedback on the first author’s PhD dissertation, which helped improve the quality of this work. ","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2025-09-07T22:01:32Z","OA_place":"publisher","conference":{"start_date":"2025-08-25","name":"MFCS: Mathematical Foundations of Computer Science","location":"Warsaw, Poland","end_date":"2025-08-29"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider equilibria in multiplayer stochastic graph games with terminal-node rewards. In such games, Nash equilibria are defined assuming that each player seeks to maximise their expected payoff, ignoring their aversion or tolerance to risk. We therefore study risk-sensitive equilibria (RSEs), where the expected payoff is replaced by a risk measure. A classical risk measure in the literature is the entropic risk measure, where each player has a real valued parameter capturing their risk-averseness. We introduce the extreme risk measure, which corresponds to extreme cases of entropic risk measure, where players are either extreme optimists or extreme pessimists. Under extreme risk measure, every player is an extremist: an extreme optimist perceives their reward as the maximum payoff that can be achieved with positive probability, while an extreme pessimist expects the minimum payoff achievable with positive probability. We argue that the extreme risk measure, especially in multi-player graph based settings, is particularly relevant as they can model several real life instances such as interactions between secure systems and potential security threats, or distributed controls for safety critical systems. We prove that RSEs defined with the extreme risk measure are guaranteed to exist when all rewards are non-negative. Furthermore, we prove that the problem of deciding whether a given game contains an RSE that generates risk measures within specified intervals is decidable and NP-complete for our extreme risk measure, and even PTIME-complete when all players are extreme optimists, while that same problem is undecidable using the entropic risk measure or even the classical expected payoff. This establishes, to our knowledge, the first decidable fragment for equilibria in simple stochastic games without restrictions on strategy types or number of players."}],"author":[{"first_name":"Léonard","last_name":"Brice","full_name":"Brice, Léonard"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Thejaswini","first_name":"K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"title":"Finding equilibria: Simpler for pessimists, simplest for optimists","arxiv":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"corr_author":"1","type":"conference","ec_funded":1,"month":"08","publication":"50th International Symposium on Mathematical Foundations of Computer Science","has_accepted_license":"1","external_id":{"arxiv":["2502.0531"]},"citation":{"mla":"Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">10.4230/LIPIcs.MFCS.2025.30</a>.","ista":"Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.","short":"L. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">https://doi.org/10.4230/LIPIcs.MFCS.2025.30</a>.","ama":"Brice L, Henzinger TA, Thejaswini KS. Finding equilibria: Simpler for pessimists, simplest for optimists. In: <i>50th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">10.4230/LIPIcs.MFCS.2025.30</a>","apa":"Brice, L., Henzinger, T. A., &#38; Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In <i>50th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">https://doi.org/10.4230/LIPIcs.MFCS.2025.30</a>","ieee":"L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Warsaw, Poland, 2025, vol. 345."},"year":"2025","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"file_date_updated":"2025-09-08T07:11:12Z","file":[{"content_type":"application/pdf","creator":"dernst","date_updated":"2025-09-08T07:11:12Z","file_size":1149694,"access_level":"open_access","checksum":"9bc6b8e537662d371d2a27444cbc0b75","relation":"main_file","date_created":"2025-09-08T07:11:12Z","success":1,"file_id":"20306","file_name":"2025_MFCS_Brice.pdf"}],"article_processing_charge":"Yes","day":"20","volume":345,"oa_version":"Published Version","OA_type":"gold","oa":1,"doi":"10.4230/LIPIcs.MFCS.2025.30","publication_status":"published","status":"public","ddc":["000"],"date_updated":"2025-09-08T07:15:40Z"},{"status":"public","publication_status":"published","doi":"10.4230/LIPIcs.MFCS.2025.57","ddc":["000"],"date_updated":"2025-09-08T07:06:11Z","file":[{"success":1,"file_id":"20305","file_name":"2025_MFCS_HenzingerT.pdf","date_created":"2025-09-08T06:56:56Z","relation":"main_file","access_level":"open_access","checksum":"6068b772aba6cb0d01f3e5a90abed973","date_updated":"2025-09-08T06:56:56Z","file_size":1009644,"creator":"dernst","content_type":"application/pdf"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"file_date_updated":"2025-09-08T06:56:56Z","volume":345,"day":"20","article_processing_charge":"No","OA_type":"gold","oa_version":"Published Version","oa":1,"has_accepted_license":"1","citation":{"ieee":"T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Warsaw, Poland, 2025, vol. 345.","chicago":"Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">https://doi.org/10.4230/LIPIcs.MFCS.2025.57</a>.","mla":"Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">10.4230/LIPIcs.MFCS.2025.57</a>.","short":"T.A. Henzinger, A. Prakash, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 57.","ama":"Henzinger TA, Prakash A, Thejaswini KS. Resolving nondeterminism with randomness. In: <i>50th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">10.4230/LIPIcs.MFCS.2025.57</a>","apa":"Henzinger, T. A., Prakash, A., &#38; Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In <i>50th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">https://doi.org/10.4230/LIPIcs.MFCS.2025.57</a>"},"year":"2025","external_id":{"arxiv":["2502.12872"]},"ec_funded":1,"publication":"50th International Symposium on Mathematical Foundations of Computer Science","month":"08","title":"Resolving nondeterminism with randomness","corr_author":"1","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"arxiv":1,"abstract":[{"text":"We define and study classes of ω-regular automata for which the nondeterminism can be resolved by a policy that uses a combination of memory and randomness on any input word, based solely on the prefix read so far. We examine two settings for providing the input word to an automaton. In the first setting, called adversarial resolvability, the input word is constructed letter-by-letter by an adversary, dependent on the resolver’s previous decisions. In the second setting, called stochastic resolvability, the adversary pre-commits to an infinite word and reveals it letter-by-letter. In each setting, we require the existence of an almost-sure resolver, i.e., a policy that ensures that as long as the adversary provides a word in the language of the underlying nondeterministic automaton, the run constructed by the policy is accepting with probability 1.\r\nThe class of automata that are adversarially resolvable is the well-studied class of history-deterministic automata. The case of stochastically resolvable automata, on the other hand, defines a novel class. Restricting the class of resolvers in both settings to stochastic policies without memory introduces two additional new classes of automata. We show that the new automata classes offer interesting trade-offs between succinctness, expressivity, and computational complexity, providing a fine gradation between deterministic automata and nondeterministic automata.","lang":"eng"}],"quality_controlled":"1","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Aditya","last_name":"Prakash","full_name":"Prakash, Aditya"},{"first_name":"K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","last_name":"Thejaswini","full_name":"Thejaswini, K. S."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"conference":{"end_date":"2025-08-29","start_date":"2025-08-25","name":"MFCS: Mathematical Foundations of Computer Science","location":"Warsaw, Poland"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"_id":"20291","intvolume":"       345","article_number":"57","date_published":"2025-08-20T00:00:00Z","language":[{"iso":"eng"}],"acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093.","OA_place":"publisher","date_created":"2025-09-07T22:01:32Z","scopus_import":"1"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2025-09-17","name":"ESA: European Symposium on Algorithms","location":"Warsaw, Poland","start_date":"2025-09-15"},"language":[{"iso":"eng"}],"date_created":"2025-10-26T23:01:34Z","OA_place":"publisher","scopus_import":"1","alternative_title":["LIPIcs"],"_id":"20533","intvolume":"       351","article_number":"2","date_published":"2025-10-01T00:00:00Z","corr_author":"1","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773959"]},"title":"Securing dynamic data: A primer on differentially private data structures","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","first_name":"Roodabeh","last_name":"Safavi Hemami","full_name":"Safavi Hemami, Roodabeh"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"quality_controlled":"1","abstract":[{"text":"We give an introduction into differential privacy in the dynamic setting, called the continual observation setting.","lang":"eng"}],"citation":{"ieee":"M. Henzinger and R. Safavi Hemami, “Securing dynamic data: A primer on differentially private data structures,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351.","ama":"Henzinger M, Safavi Hemami R. Securing dynamic data: A primer on differentially private data structures. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">10.4230/LIPIcs.ESA.2025.2</a>","apa":"Henzinger, M., &#38; Safavi Hemami, R. (2025). Securing dynamic data: A primer on differentially private data structures. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">https://doi.org/10.4230/LIPIcs.ESA.2025.2</a>","chicago":"Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">https://doi.org/10.4230/LIPIcs.ESA.2025.2</a>.","short":"M. Henzinger, R. Safavi Hemami, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">10.4230/LIPIcs.ESA.2025.2</a>.","ista":"Henzinger M, Safavi Hemami R. 2025. Securing dynamic data: A primer on differentially private data structures. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 2."},"year":"2025","has_accepted_license":"1","month":"10","publication":"33rd Annual European Symposium on Algorithms","date_updated":"2025-10-27T08:00:13Z","status":"public","publication_status":"published","doi":"10.4230/LIPIcs.ESA.2025.2","ddc":["000"],"OA_type":"gold","oa_version":"Published Version","oa":1,"file":[{"relation":"main_file","checksum":"094e0466d90664fbea397b469a60acbb","access_level":"open_access","success":1,"file_id":"20541","file_name":"2025_LIPIcs.ESA_Henzinger.pdf","date_created":"2025-10-27T07:57:00Z","content_type":"application/pdf","date_updated":"2025-10-27T07:57:00Z","file_size":770227,"creator":"dernst"}],"file_date_updated":"2025-10-27T07:57:00Z","volume":351,"article_processing_charge":"No","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"end_date":"2025-09-17","name":"ESA: European Symposium on Algorithms","location":"Warsaw, Poland","start_date":"2025-09-15"},"scopus_import":"1","OA_place":"publisher","date_created":"2025-10-26T23:01:34Z","acknowledgement":"Monika Henzinger and Evangelos Kosinas: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant https://www.doi.org/10.55776/Z422 and grant https://www.doi.org/10.55776/I5982. Harald Räcke and Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858.","language":[{"iso":"eng"}],"date_published":"2025-10-01T00:00:00Z","article_number":"36","intvolume":"       351","_id":"20534","arxiv":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773959"]},"corr_author":"1","type":"conference","title":"Efficient contractions of dynamic graphs - with applications","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger"},{"id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949","first_name":"Evangelos","last_name":"Kosinas","full_name":"Kosinas, Evangelos"},{"full_name":"Münk, Robin","first_name":"Robin","last_name":"Münk"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"}],"abstract":[{"text":"A non-trivial minimum cut (NMC) sparsifier is a multigraph Ĝ that preserves all non-trivial minimum cuts of a given undirected graph G. We introduce a flexible data structure for fully dynamic graphs that can efficiently provide an NMC sparsifier upon request at any point during the sequence of updates. We employ simple dynamic forest data structures to achieve a fast from-scratch construction of the sparsifier at query time. Based on the strength of the adversary and desired type of time bounds, the data structure comes with different guarantees. Specifically, let G be a fully dynamic simple graph with n vertices and minimum degree δ. Then our data structure supports an insertion/deletion of an edge to/from G in n^o(1) worst-case time. Furthermore, upon request, it can return w.h.p. an NMC sparsifier of G that has O(n/δ) vertices and O(n) edges, in Ô(n) time. The probabilistic guarantees hold against an adaptive adversary. Alternatively, the update and query times can be improved to Õ(1) and Õ(n) respectively, if amortized-time guarantees are sufficient, or if the adversary is oblivious. Throughout the paper, we use Õ to hide polylogarithmic factors and Ô to hide subpolynomial (i.e., n^o(1)) factors.\r\nWe discuss two applications of our new data structure. First, it can be used to efficiently report a cactus representation of all minimum cuts of a fully dynamic simple graph. Building this cactus for the NMC sparsifier instead of the original graph allows for a construction time that is sublinear in the number of edges. Against an adaptive adversary, we can with high probability output the cactus representation in worst-case Ô(n) time. Second, our data structure allows us to efficiently compute the maximal k-edge-connected subgraphs of undirected simple graphs, by repeatedly applying a minimum cut algorithm on the NMC sparsifier. Specifically, we can compute with high probability the maximal k-edge-connected subgraphs of a simple graph with n vertices and m edges in Õ(m+n²/k) time. This improves the best known time bounds for k = Ω(n^{1/8}) and naturally extends to the case of fully dynamic graphs.","lang":"eng"}],"quality_controlled":"1","external_id":{"arxiv":["2509.05157"]},"citation":{"apa":"Henzinger, M., Kosinas, E., Münk, R., &#38; Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">https://doi.org/10.4230/LIPIcs.ESA.2025.36</a>","ama":"Henzinger M, Kosinas E, Münk R, Räcke H. Efficient contractions of dynamic graphs - with applications. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">10.4230/LIPIcs.ESA.2025.36</a>","short":"M. Henzinger, E. Kosinas, R. Münk, H. Räcke, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Henzinger, Monika, et al. “Efficient Contractions of Dynamic Graphs - with Applications.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">10.4230/LIPIcs.ESA.2025.36</a>.","ista":"Henzinger M, Kosinas E, Münk R, Räcke H. 2025. Efficient contractions of dynamic graphs - with applications. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms vol. 351, 36.","chicago":"Henzinger, Monika, Evangelos Kosinas, Robin Münk, and Harald Räcke. “Efficient Contractions of Dynamic Graphs - with Applications.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">https://doi.org/10.4230/LIPIcs.ESA.2025.36</a>.","ieee":"M. Henzinger, E. Kosinas, R. Münk, and H. Räcke, “Efficient contractions of dynamic graphs - with applications,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351."},"year":"2025","has_accepted_license":"1","publication":"33rd Annual European Symposium on Algorithms","month":"10","ec_funded":1,"date_updated":"2025-10-27T08:05:46Z","ddc":["000"],"doi":"10.4230/LIPIcs.ESA.2025.36","status":"public","publication_status":"published","oa":1,"oa_version":"Published Version","OA_type":"gold","article_processing_charge":"No","day":"01","volume":351,"project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"file_date_updated":"2025-10-27T08:03:36Z","file":[{"content_type":"application/pdf","creator":"dernst","file_size":934846,"date_updated":"2025-10-27T08:03:36Z","checksum":"d2daf9a467e96fb5e7084a8a85321776","access_level":"open_access","relation":"main_file","date_created":"2025-10-27T08:03:36Z","file_id":"20542","file_name":"2025_LIPIcs.ESA_HenzingerM.pdf","success":1}]},{"article_number":"91","_id":"20535","alternative_title":["LIPIcs"],"intvolume":"       351","date_published":"2025-10-01T00:00:00Z","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 (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422 and grant DOI 10.55776/I5982. Laxman Dhulipala and George Z. Li: supported by NSF award number CNS-2317194. Quanquan C. Liu: supported by a Google Academic Research Award and by an NSF award number CCF-2453323.","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2025-10-26T23:01:35Z","OA_place":"publisher","conference":{"start_date":"2025-09-15","name":"ESA: European Symposium on Algorithms","location":"Warsaw, Poland","end_date":"2025-09-17"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the k-core decomposition problem, the classic peeling algorithm iteratively removes a vertex if its induced degree falls below a threshold. The sparse vector technique (SVT) is generally used to transform non-private threshold queries into private ones with only a small additive loss in accuracy. However, a naive application of SVT in the graph setting leads to an amplification of the error by a factor of n due to composition, as SVT is applied to every vertex. In this paper, we resolve this problem by formulating a novel generalized sparse vector technique which we call the Multidimensional AboveThreshold (MAT) Mechanism which generalizes SVT (applied to vectors with one dimension) to vectors with multiple dimensions. When applied to vectors with n dimensions, we solve a number of important graph problems with better bounds than previous work.\r\nSpecifically, we apply our MAT mechanism to obtain a set of improved bounds for a variety of problems including k-core decomposition, densest subgraph, low out-degree ordering, and vertex coloring. We give a tight local edge differentially private (LEDP) algorithm for k-core decomposition that results in an approximation with O(ε^{-1} log n) additive error and no multiplicative error in O(n) rounds. We also give a new (2+η)-factor multiplicative, O(ε^{-1} log n) additive error algorithm in O(log² n) rounds for any constant η > 0. Both of these results are asymptotically tight against our new lower bound of Ω(log n) for any constant-factor approximation algorithm for k-core decomposition. Our new algorithms for k-core decomposition also directly lead to new algorithms for the related problems of densest subgraph and low out-degree ordering. Finally, we give novel LEDP differentially private defective coloring algorithms that use number of colors given in terms of the arboricity of the graph.","lang":"eng"}],"quality_controlled":"1","author":[{"last_name":"Dhulipala","first_name":"Laxman","full_name":"Dhulipala, Laxman"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Li, George Z.","last_name":"Li","first_name":"George Z."},{"full_name":"Liu, Quanquan C.","first_name":"Quanquan C.","last_name":"Liu"},{"full_name":"Sricharan, A. R.","first_name":"A. R.","last_name":"Sricharan"},{"last_name":"Zhu","id":"a2117c59-cee4-11ed-b9d0-874ecf0f8ac5","first_name":"Leqi","full_name":"Zhu, Leqi"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"title":"Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism","publication_identifier":{"isbn":["9783959773959"],"issn":["1868-8969"]},"arxiv":1,"type":"conference","corr_author":"1","ec_funded":1,"month":"10","publication":"33rd Annual European Symposium on Algorithms","has_accepted_license":"1","external_id":{"arxiv":["2508.02182"]},"year":"2025","citation":{"apa":"Dhulipala, L., Henzinger, M., Li, G. Z., Liu, Q. C., Sricharan, A. R., &#38; Zhu, L. (2025). Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">https://doi.org/10.4230/LIPIcs.ESA.2025.91</a>","ama":"Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">10.4230/LIPIcs.ESA.2025.91</a>","chicago":"Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">https://doi.org/10.4230/LIPIcs.ESA.2025.91</a>.","mla":"Dhulipala, Laxman, et al. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">10.4230/LIPIcs.ESA.2025.91</a>.","short":"L. Dhulipala, M. Henzinger, G.Z. Li, Q.C. Liu, A.R. Sricharan, L. Zhu, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. 2025. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 91.","ieee":"L. Dhulipala, M. Henzinger, G. Z. Li, Q. C. Liu, A. R. Sricharan, and L. Zhu, “Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351."},"file":[{"date_updated":"2025-10-27T06:58:43Z","file_size":870317,"creator":"dernst","content_type":"application/pdf","success":1,"file_id":"20539","file_name":"2025_LIPIcs.ESA_Dhulipala.pdf","date_created":"2025-10-27T06:58:43Z","relation":"main_file","checksum":"19146e935b5b6ad5d33c8d08280ad8e7","access_level":"open_access"}],"file_date_updated":"2025-10-27T06:58:43Z","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"}],"day":"01","article_processing_charge":"No","volume":351,"oa_version":"Published Version","OA_type":"gold","oa":1,"doi":"10.4230/LIPIcs.ESA.2025.91","publication_status":"published","status":"public","ddc":["000"],"date_updated":"2025-10-27T07:02:06Z"},{"quality_controlled":"1","abstract":[{"lang":"eng","text":"Uniquely represented (UR) data structures represent each logical state with a unique storage state. We study the problem of maintaining a dynamic set of n keys from a totally ordered universe in this context. UR structures are also called \"strongly history independent\" structures in the literature.\r\nWe introduce a two-layer data structure called (α,ε)-Randomized Block Search Tree (RBST) that is uniquely represented and suitable for external memory (EM). Though RBSTs naturally generalize the well-known binary Treaps, several new ideas are needed to analyze the expected search, update, and storage efficiency in terms of block-reads, block-writes, and blocks stored. We prove that searches have O(ε^{-1} + log_α n) block-reads, that dynamic updates perform O(ε^{-1} + log_α(n)/α) block-writes and O(ε^{-2}+(1+(ε^{-1}+log n)/α)log_α n) block-reads, and that (α, ε)-RBSTs have an asymptotic load-factor of at least (1-ε) for every ε ∈ (0,1/2].\r\nThus (α, ε)-RBSTs improve on the known, uniquely represented B-Treap [Golovin; ICALP'09]. Compared with non-UR structures, the RBST is also, to the best of our knowledge, the first external memory structure that is storage-efficient and has a non-amortized, write-efficient update bound."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"author":[{"full_name":"Safavi Hemami, Roodabeh","last_name":"Safavi Hemami","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","first_name":"Roodabeh"},{"first_name":"Martin P.","last_name":"Seybold","full_name":"Seybold, Martin P."}],"title":"B-Treaps revised: Write efficient randomized block search trees with high load","arxiv":1,"publication_identifier":{"isbn":["9783959773980"],"issn":["1868-8969"]},"corr_author":"1","type":"conference","date_published":"2025-08-29T00:00:00Z","article_number":"47","alternative_title":["LIPIcs"],"_id":"20536","intvolume":"       349","scopus_import":"1","date_created":"2025-10-26T23:01:35Z","OA_place":"publisher","acknowledgement":"This work was supported under the Australian Research Council Discovery Projects\r\nfunding scheme (project number DP180102870). This project has received funding from the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N and project “Fast Algorithms for a Reactive Network Layer (ReactNet)” P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","language":[{"iso":"eng"}],"conference":{"end_date":"2025-08-15","name":"WADS: Algorithms and Data Structures Symposium","location":"Toronto, Canada","start_date":"2025-08-11"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"29","article_processing_charge":"No","volume":349,"project":[{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"file_date_updated":"2025-10-27T07:09:41Z","file":[{"file_id":"20540","file_name":"2025_LIPIcs.WADS_Safavi.pdf","success":1,"date_created":"2025-10-27T07:09:41Z","relation":"main_file","access_level":"open_access","checksum":"196af33762831a78e87f4f95ecd8677b","file_size":1081870,"date_updated":"2025-10-27T07:09:41Z","creator":"dernst","content_type":"application/pdf"}],"oa":1,"oa_version":"Published Version","OA_type":"gold","ddc":["000"],"doi":"10.4230/LIPIcs.WADS.2025.47","publication_status":"published","status":"public","date_updated":"2025-10-27T07:10:49Z","ec_funded":1,"month":"08","publication":"19th International Symposium on Algorithms and Data Structures","has_accepted_license":"1","external_id":{"arxiv":["2303.04722"]},"year":"2025","citation":{"ieee":"R. Safavi Hemami and M. P. Seybold, “B-Treaps revised: Write efficient randomized block search trees with high load,” in <i>19th International Symposium on Algorithms and Data Structures</i>, Toronto, Canada, 2025, vol. 349.","apa":"Safavi Hemami, R., &#38; Seybold, M. P. (2025). B-Treaps revised: Write efficient randomized block search trees with high load. In <i>19th International Symposium on Algorithms and Data Structures</i> (Vol. 349). Toronto, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.WADS.2025.47\">https://doi.org/10.4230/LIPIcs.WADS.2025.47</a>","ama":"Safavi Hemami R, Seybold MP. B-Treaps revised: Write efficient randomized block search trees with high load. In: <i>19th International Symposium on Algorithms and Data Structures</i>. Vol 349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.WADS.2025.47\">10.4230/LIPIcs.WADS.2025.47</a>","ista":"Safavi Hemami R, Seybold MP. 2025. B-Treaps revised: Write efficient randomized block search trees with high load. 19th International Symposium on Algorithms and Data Structures. WADS: Algorithms and Data Structures Symposium, LIPIcs, vol. 349, 47.","short":"R. Safavi Hemami, M.P. Seybold, in:, 19th International Symposium on Algorithms and Data Structures, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Safavi Hemami, Roodabeh, and Martin P. Seybold. “B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.” <i>19th International Symposium on Algorithms and Data Structures</i>, vol. 349, 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.WADS.2025.47\">10.4230/LIPIcs.WADS.2025.47</a>.","chicago":"Safavi Hemami, Roodabeh, and Martin P. Seybold. “B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.” In <i>19th International Symposium on Algorithms and Data Structures</i>, Vol. 349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.WADS.2025.47\">https://doi.org/10.4230/LIPIcs.WADS.2025.47</a>."}},{"publication":"7th Conference on Advances in Financial Technologies","month":"10","has_accepted_license":"1","external_id":{"arxiv":["2508.01448"]},"year":"2025","citation":{"apa":"Baig, M. A., Günther, C. U., &#38; Pietrzak, K. Z. (2025). Nakamoto consensus from multiple resources. In <i>7th Conference on Advances in Financial Technologies</i> (Vol. 354). Pittsburgh, PA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2025.16\">https://doi.org/10.4230/LIPIcs.AFT.2025.16</a>","ama":"Baig MA, Günther CU, Pietrzak KZ. Nakamoto consensus from multiple resources. In: <i>7th Conference on Advances in Financial Technologies</i>. Vol 354. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2025.16\">10.4230/LIPIcs.AFT.2025.16</a>","chicago":"Baig, Mirza Ahad, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Nakamoto Consensus from Multiple Resources.” In <i>7th Conference on Advances in Financial Technologies</i>, Vol. 354. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.AFT.2025.16\">https://doi.org/10.4230/LIPIcs.AFT.2025.16</a>.","mla":"Baig, Mirza Ahad, et al. “Nakamoto Consensus from Multiple Resources.” <i>7th Conference on Advances in Financial Technologies</i>, vol. 354, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.AFT.2025.16\">10.4230/LIPIcs.AFT.2025.16</a>.","ista":"Baig MA, Günther CU, Pietrzak KZ. 2025. Nakamoto consensus from multiple resources. 7th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 354, 16.","short":"M.A. Baig, C.U. Günther, K.Z. Pietrzak, in:, 7th Conference on Advances in Financial Technologies, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ieee":"M. A. Baig, C. U. Günther, and K. Z. Pietrzak, “Nakamoto consensus from multiple resources,” in <i>7th Conference on Advances in Financial Technologies</i>, Pittsburgh, PA, United States, 2025, vol. 354."},"day":"06","article_processing_charge":"Yes","volume":354,"project":[{"grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f"},{"grant_number":"F8509","name":"Security and Privacy by Design for Complex Systems","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1"}],"file_date_updated":"2025-11-04T08:19:02Z","file":[{"date_created":"2025-11-04T08:19:02Z","success":1,"file_id":"20598","file_name":"2025_LIPIcsAFT_Baig.pdf","access_level":"open_access","checksum":"b638adcd4fbffa77116c35393e165eb7","relation":"main_file","creator":"dernst","date_updated":"2025-11-04T08:19:02Z","file_size":1061847,"content_type":"application/pdf"}],"oa":1,"oa_version":"Published Version","OA_type":"gold","ddc":["000"],"doi":"10.4230/LIPIcs.AFT.2025.16","status":"public","publication_status":"published","date_updated":"2026-04-15T08:45:18Z","date_published":"2025-10-06T00:00:00Z","article_number":"16","alternative_title":["LIPIcs"],"_id":"20587","intvolume":"       354","scopus_import":"1","date_created":"2025-11-02T23:01:34Z","OA_place":"publisher","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF)\r\n10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license\r\nto any author-accepted manuscript version arising from this submission.","language":[{"iso":"eng"}],"conference":{"start_date":"2025-10-08","name":"AFT: Conference on Advances in Financial Technologies","location":"Pittsburgh, PA, United States","end_date":"2025-10-10"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"The blocks in the Bitcoin blockchain \"record\" the amount of work W that went into creating them through proofs of work. When honest parties control a majority of the work, consensus is achieved by picking the chain with the highest recorded weight. Resources other than work have been considered to secure such longest-chain blockchains. In Chia, blocks record the amount of disk-space S (via a proof of space) and sequential computational steps V (through a VDF).\r\nIn this paper, we ask what weight functions Γ(S,V,W) (that assign a weight to a block as a function of the recorded space, speed, and work) are secure in the sense that whenever the weight of the resources controlled by honest parties is larger than the weight of adversarial parties, the blockchain is secure against private double-spending attacks.\r\nWe completely classify such functions in an idealized \"continuous\" model: Γ(S,V,W) is secure against private double-spending attacks if and only if it is homogeneous of degree one in the \"timed\" resources V and W, i.e., αΓ(S,V,W) = Γ(S,α V, α W). This includes the Bitcoin rule Γ(S,V,W) = W and the Chia rule Γ(S,V,W) = S ⋅ V. In a more realistic model where blocks are created at discrete time-points, one additionally needs some mild assumptions on the dependency on S (basically, the weight should not grow too much if S is slightly increased, say linear as in Chia).\r\nOur classification is more general and allows various instantiations of the same resource. It provides a powerful tool for designing new longest-chain blockchains. E.g., consider combining different PoWs to counter centralization, say the Bitcoin PoW W₁ and a memory-hard PoW W₂. Previous work suggested to use W₁+W₂ as weight. Our results show that using e.g., √{W₁}⋅ √{W₂} or min{W₁,W₂} are also secure, and we argue that in practice these are much better choices.","lang":"eng"}],"quality_controlled":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"KrPi"}],"author":[{"last_name":"Baig","first_name":"Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","full_name":"Baig, Mirza Ahad"},{"last_name":"Günther","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","first_name":"Christoph Ullrich","full_name":"Günther, Christoph Ullrich"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21651"}]},"title":"Nakamoto consensus from multiple resources","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1410"}],"arxiv":1,"publication_identifier":{"isbn":["9783959774000"],"issn":["1868-8969"]},"corr_author":"1","type":"conference"},{"has_accepted_license":"1","external_id":{"isi":["001585185800011"],"arxiv":["2102.13457"]},"citation":{"ieee":"J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in <i>27th International Conference on Principles of Distributed Systems</i>, Tokyo, Japan, 2024, vol. 286.","mla":"Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” <i>27th International Conference on Principles of Distributed Systems</i>, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">10.4230/LIPIcs.OPODIS.2023.11</a>.","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.","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.","chicago":"Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In <i>27th International Conference on Principles of Distributed Systems</i>, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.11</a>.","apa":"Hirvonen, J., Schmid, L., Chatterjee, K., &#38; Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In <i>27th International Conference on Principles of Distributed Systems</i> (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.11</a>","ama":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: <i>27th International Conference on Principles of Distributed Systems</i>. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11\">10.4230/LIPIcs.OPODIS.2023.11</a>"},"year":"2024","ec_funded":1,"publication":"27th International Conference on Principles of Distributed Systems","month":"01","doi":"10.4230/LIPIcs.OPODIS.2023.11","publication_status":"published","status":"public","ddc":["000"],"date_updated":"2025-12-02T13:38:16Z","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"file":[{"date_updated":"2024-02-26T09:04:58Z","file_size":867363,"creator":"dernst","content_type":"application/pdf","success":1,"file_id":"15028","file_name":"2024_LIPICs_Hirvonen.pdf","date_created":"2024-02-26T09:04:58Z","relation":"main_file","checksum":"4fc7eea6e4ba140b904781fc7df868ec","access_level":"open_access"}],"file_date_updated":"2024-02-26T09:04:58Z","article_processing_charge":"No","day":"18","volume":286,"oa_version":"Published Version","oa":1,"conference":{"location":"Tokyo, Japan","name":"OPODIS: Conference on Principles of Distributed Systems","start_date":"2023-12-06","end_date":"2023-12-08"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"11","intvolume":"       286","_id":"15006","alternative_title":["LIPIcs"],"date_published":"2024-01-18T00:00:00Z","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.","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2024-02-18T23:01:01Z","title":"On the convergence time in graphical games: A locality-sensitive approach","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773089"]},"arxiv":1,"corr_author":"1","type":"conference","quality_controlled":"1","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."}],"author":[{"full_name":"Hirvonen, Juho","first_name":"Juho","last_name":"Hirvonen"},{"last_name":"Schmid","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","full_name":"Schmid, Laura"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"KrCh"}]},{"citation":{"ieee":"O. Alpos, I. Amores-Sesar, C. Cachin, and M. X. Yeo, “Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks,” in <i>27th International Conference on Principles of Distributed Systems</i>, Tokyo, Japan, 2024, vol. 286.","ista":"Alpos O, Amores-Sesar I, Cachin C, Yeo MX. 2024. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 12.","mla":"Alpos, Orestis, et al. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” <i>27th International Conference on Principles of Distributed Systems</i>, vol. 286, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.12\">10.4230/LIPIcs.OPODIS.2023.12</a>.","short":"O. Alpos, I. Amores-Sesar, C. Cachin, M.X. Yeo, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” In <i>27th International Conference on Principles of Distributed Systems</i>, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.12\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.12</a>.","ama":"Alpos O, Amores-Sesar I, Cachin C, Yeo MX. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In: <i>27th International Conference on Principles of Distributed Systems</i>. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.12\">10.4230/LIPIcs.OPODIS.2023.12</a>","apa":"Alpos, O., Amores-Sesar, I., Cachin, C., &#38; Yeo, M. X. (2024). Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In <i>27th International Conference on Principles of Distributed Systems</i> (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2023.12\">https://doi.org/10.4230/LIPIcs.OPODIS.2023.12</a>"},"year":"2024","external_id":{"isi":["001585185800012"],"arxiv":["2307.02954"]},"has_accepted_license":"1","month":"01","publication":"27th International Conference on Principles of Distributed Systems","date_updated":"2025-12-02T13:38:53Z","ddc":["000"],"publication_status":"published","status":"public","doi":"10.4230/LIPIcs.OPODIS.2023.12","oa":1,"oa_version":"Published Version","volume":286,"article_processing_charge":"No","day":"18","file":[{"creator":"dernst","date_updated":"2024-02-26T10:16:57Z","file_size":1505994,"content_type":"application/pdf","date_created":"2024-02-26T10:16:57Z","success":1,"file_name":"2024_LIPICs_Alpos.pdf","file_id":"15031","access_level":"open_access","checksum":"2993e810a45e8c8056106834b07aea92","relation":"main_file"}],"file_date_updated":"2024-02-26T10:16:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"end_date":"2023-12-08","start_date":"2023-12-06","location":"Tokyo, Japan","name":"OPODIS: Conference on Principles of Distributed Systems"},"date_created":"2024-02-18T23:01:02Z","scopus_import":"1","language":[{"iso":"eng"}],"acknowledgement":"We would like to thank Krzysztof Pietrzak and Jovana Mićić for useful discussions. This work has been funded by the Swiss National Science Foundation (SNSF) under grant agreement Nr. 200021_188443 (Advanced Consensus Protocols).\r\n","date_published":"2024-01-18T00:00:00Z","_id":"15007","intvolume":"       286","alternative_title":["LIPIcs"],"article_number":"12","corr_author":"1","type":"conference","publication_identifier":{"isbn":["9783959773089"],"issn":["1868-8969"]},"arxiv":1,"title":"Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"KrPi"}],"author":[{"full_name":"Alpos, Orestis","first_name":"Orestis","last_name":"Alpos"},{"full_name":"Amores-Sesar, Ignacio","first_name":"Ignacio","last_name":"Amores-Sesar"},{"last_name":"Cachin","first_name":"Christian","full_name":"Cachin, Christian"},{"orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X","last_name":"Yeo","full_name":"Yeo, Michelle X"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead."}]},{"article_number":"55","_id":"15008","intvolume":"       287","alternative_title":["LIPIcs"],"date_published":"2024-01-24T00:00:00Z","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.","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2024-02-18T23:01:02Z","conference":{"end_date":"2024-02-02","start_date":"2024-01-30","location":"Berkeley, CA, United States","name":"ITCS: Innovations in Theoretical Computer Science"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","author":[{"last_name":"Goranci","first_name":"Gramoz","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"first_name":"Sushant","last_name":"Sachdeva","full_name":"Sachdeva, Sushant"},{"last_name":"Sricharan","first_name":"A. R.","full_name":"Sricharan, A. R."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MoHe"}],"title":"Electrical flows for polylogarithmic competitive oblivious routing","arxiv":1,"publication_identifier":{"isbn":["9783959773096"],"issn":["1868-8969"]},"corr_author":"1","type":"conference","ec_funded":1,"publication":"15th Innovations in Theoretical Computer Science Conference","month":"01","has_accepted_license":"1","external_id":{"isi":["001300389400055"],"arxiv":["2303.02491"]},"year":"2024","citation":{"ieee":"G. Goranci, M. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in <i>15th Innovations in Theoretical Computer Science Conference</i>, Berkeley, CA, United States, 2024, vol. 287.","apa":"Goranci, G., Henzinger, M., Räcke, H., Sachdeva, S., &#38; Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In <i>15th Innovations in Theoretical Computer Science Conference</i> (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.55\">https://doi.org/10.4230/LIPIcs.ITCS.2024.55</a>","ama":"Goranci G, Henzinger M, Räcke H, Sachdeva S, Sricharan AR. Electrical flows for polylogarithmic competitive oblivious routing. In: <i>15th Innovations in Theoretical Computer Science Conference</i>. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.55\">10.4230/LIPIcs.ITCS.2024.55</a>","ista":"Goranci G, Henzinger M, 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, LIPIcs, vol. 287, 55.","short":"G. Goranci, M. 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.","mla":"Goranci, Gramoz, et al. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” <i>15th Innovations in Theoretical Computer Science Conference</i>, vol. 287, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.55\">10.4230/LIPIcs.ITCS.2024.55</a>.","chicago":"Goranci, Gramoz, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” In <i>15th Innovations in Theoretical Computer Science Conference</i>, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.55\">https://doi.org/10.4230/LIPIcs.ITCS.2024.55</a>."},"file_date_updated":"2024-02-26T10:10:48Z","file":[{"content_type":"application/pdf","file_size":1054754,"date_updated":"2024-02-26T10:10:48Z","creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"b89716aae6a5599f187897e39de1e53a","file_id":"15030","file_name":"2024_LIPICs_Goranci.pdf","success":1,"date_created":"2024-02-26T10:10:48Z"}],"project":[{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"article_processing_charge":"No","day":"24","volume":287,"oa_version":"Published Version","oa":1,"doi":"10.4230/LIPIcs.ITCS.2024.55","status":"public","publication_status":"published","ddc":["000"],"date_updated":"2025-09-04T12:06:25Z"},{"intvolume":"       323","_id":"17099","alternative_title":["LIPIcs"],"article_number":"5","date_published":"2024-12-05T00:00:00Z","language":[{"iso":"eng"}],"acknowledgement":"This research was partially supported by ERC CoG 863818 (ForM-SMArt), Austrian\r\nScience Fund (FWF) 10.55776/COE12, and French Agence Nationale de la Recherche (ANR)\r\nANR-21-CE40-0020 (CONVERGENCE project)","date_created":"2024-06-03T07:44:27Z","OA_place":"publisher","scopus_import":"1","conference":{"end_date":"2024-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Gujarat, India","start_date":"2024-12-16"},"isi":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state and the chosen actions, the next state is obtained according to a stochastic transition function. An objective is a measurable function on plays (or infinite trajectories) of the game, and the value for an objective is the maximal expectation that the player can guarantee against the adversarial player. We consider: (a) stateful-discounted objectives, which are similar to the classical discounted-sum objectives, but states are associated with different discount factors rather than a single discount factor; and (b) parity objectives, which are a canonical representation for ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount factors, the limit value is the limit of the value of the stateful-discounted objectives, as the discount factors approach zero according to the given order.\r\nThe computational problem we consider is the approximation of the value within an arbitrary\r\nadditive error. The above problem is known to be in EXPSPACE for the limit value of statefuldiscounted objectives and in PSPACE for parity objectives. The best-known algorithms for both the above problems are at least exponential time, with an exponential dependence on the number of states and actions. Our main results for the value approximation problem for the limit value of stateful-discounted objectives and parity objectives are as follows: (a) we establish TFNP[NP] complexity; and (b) we present algorithms that improve the dependency on the number of actions in the exponent from linear to logarithmic. In particular, if the number of states is constant, our algorithms run in polynomial time."}],"quality_controlled":"1","author":[{"first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","first_name":"Raimundo J"},{"full_name":"Svoboda, Jakub","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda"}],"department":[{"_id":"KrCh"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms","corr_author":"1","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773553"]},"arxiv":1,"ec_funded":1,"month":"12","publication":"44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1","citation":{"apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., &#38; Svoboda, J. (2024). Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. In <i>44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 323). Gujarat, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5\">https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5</a>","ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. In: <i>44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5\">10.4230/LIPIcs.FSTTCS.2024.5</a>","chicago":"Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” In <i>44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5\">https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5</a>.","ista":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. 2024. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 323, 5.","short":"A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, J. Svoboda, in:, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Asadi, Ali, et al. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” <i>44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 323, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5\">10.4230/LIPIcs.FSTTCS.2024.5</a>.","ieee":"A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. Svoboda, “Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms,” in <i>44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Gujarat, India, 2024, vol. 323."},"year":"2024","external_id":{"arxiv":["2405.02486"],"isi":["001537516500005"]},"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"file_date_updated":"2025-01-08T09:49:31Z","file":[{"file_id":"18777","file_name":"2024_LIPIcs_Asadi.pdf","success":1,"date_created":"2025-01-08T09:49:31Z","relation":"main_file","checksum":"5b544ab4692b93300b404435c036ddd4","access_level":"open_access","file_size":847960,"date_updated":"2025-01-08T09:49:31Z","creator":"dernst","content_type":"application/pdf"}],"volume":323,"article_processing_charge":"No","day":"05","OA_type":"gold","oa_version":"Published Version","oa":1,"publication_status":"published","status":"public","doi":"10.4230/LIPIcs.FSTTCS.2024.5","ddc":["000"],"date_updated":"2025-12-02T13:40:52Z"},{"citation":{"ieee":"H. Kourimska, A. Lieutier, and M. Wintraecken, “The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","chicago":"Kourimska, Hana, André Lieutier, and Mathijs Wintraecken. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">https://doi.org/10.4230/LIPIcs.SoCG.2024.69</a>.","mla":"Kourimska, Hana, et al. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">10.4230/LIPIcs.SoCG.2024.69</a>.","short":"H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Kourimska H, Lieutier A, Wintraecken M. 2024. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 69.","apa":"Kourimska, H., Lieutier, A., &#38; Wintraecken, M. (2024). The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">https://doi.org/10.4230/LIPIcs.SoCG.2024.69</a>","ama":"Kourimska H, Lieutier A, Wintraecken M. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">10.4230/LIPIcs.SoCG.2024.69</a>"},"year":"2024","external_id":{"arxiv":["2212.01118"]},"has_accepted_license":"1","month":"06","publication":"40th International Symposium on Computational Geometry","ec_funded":1,"date_updated":"2025-04-15T07:16:58Z","publication_status":"published","status":"public","doi":"10.4230/LIPIcs.SoCG.2024.69","ddc":["510"],"oa_version":"Published Version","oa":1,"file_date_updated":"2024-06-17T08:33:40Z","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"file":[{"creator":"dernst","date_updated":"2024-06-17T08:33:40Z","file_size":1612558,"content_type":"application/pdf","date_created":"2024-06-17T08:33:40Z","success":1,"file_name":"2024_LIPICS_Kourimska.pdf","file_id":"17150","access_level":"open_access","checksum":"b40ff456c19294adb5d9613fcfd751c6","relation":"main_file"}],"volume":293,"article_processing_charge":"No","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece"},"language":[{"iso":"eng"}],"acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nSupported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Cô d'Azur.\r\nWe are greatly indebted to Fred Chazal for sharing his insights. We further thank Erin Chambers, Christopher Fillmore, and Elizabeth Stephenson for early discussions and all members of the Edelsbrunner group (Institute of Science and Technology Austria) and the Datashape team (Inria) for the atmosphere in which this research was conducted.","date_created":"2024-06-16T22:01:06Z","scopus_import":"1","_id":"17144","alternative_title":["LIPIcs"],"intvolume":"       293","article_number":"69","date_published":"2024-06-01T00:00:00Z","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"arxiv":1,"title":"The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms","author":[{"full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","orcid":"0000-0001-7841-0091","first_name":"Hana","last_name":"Kourimska"},{"last_name":"Lieutier","first_name":"André","full_name":"Lieutier, André"},{"last_name":"Wintraecken","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"department":[{"_id":"HeEd"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We prove that the medial axis of closed sets is Hausdorff stable in the following sense: Let 𝒮 ⊆ ℝ^d be a fixed closed set that contains a bounding sphere. That is, the bounding sphere is part of the set 𝒮. Consider the space of C^{1,1} diffeomorphisms of ℝ^d to itself, which keep the bounding sphere invariant. The map from this space of diffeomorphisms (endowed with a Banach norm) to the space of closed subsets of ℝ^d (endowed with the Hausdorff distance), mapping a diffeomorphism F to the closure of the medial axis of F(𝒮), is Lipschitz. This extends a previous stability result of Chazal and Soufflet on the stability of the medial axis of C² manifolds under C² ambient diffeomorphisms."}]},{"title":"Grid peeling of parabolas","type":"conference","arxiv":1,"publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"Grid peeling is the process of repeatedly removing the convex hull vertices of the grid points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous process, the affine curve-shortening flow, which deforms the curve based on the curvature. We prove this conjecture for one class of curves, parabolas with a vertical axis, and we determine the value of the constant factor in the formula that relates the two processes."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"HeEd"}],"author":[{"last_name":"Rote","first_name":"Günter","full_name":"Rote, Günter"},{"first_name":"Moritz","last_name":"Rüber","full_name":"Rüber, Moritz"},{"last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","full_name":"Saghafian, Morteza"}],"conference":{"end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece","start_date":"2024-06-11"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2024-06-01T00:00:00Z","_id":"17145","alternative_title":["LIPIcs"],"intvolume":"       293","article_number":"76","date_created":"2024-06-16T22:01:06Z","scopus_import":"1","language":[{"iso":"eng"}],"acknowledgement":"Part of this work was done while G.R. enjoyed the hospitality of the Institute of Science and Technology Austria (ISTA) as a visiting professor during his sabbatical in the winter semester 2022/23.","ddc":["510"],"status":"public","publication_status":"published","doi":"10.4230/LIPIcs.SoCG.2024.76","date_updated":"2024-06-17T08:41:56Z","volume":293,"article_processing_charge":"No","day":"01","file_date_updated":"2024-06-17T08:40:04Z","file":[{"checksum":"fbad1de06383a6b7e8a1cb3e8c7205ce","access_level":"open_access","relation":"main_file","date_created":"2024-06-17T08:40:04Z","file_name":"2024_LIPICS_Rote.pdf","file_id":"17151","success":1,"content_type":"application/pdf","creator":"dernst","file_size":1430896,"date_updated":"2024-06-17T08:40:04Z"}],"oa":1,"oa_version":"Published Version","has_accepted_license":"1","citation":{"short":"G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Rote G, Rüber M, Saghafian M. 2024. Grid peeling of parabolas. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 76.","mla":"Rote, Günter, et al. “Grid Peeling of Parabolas.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">10.4230/LIPIcs.SoCG.2024.76</a>.","chicago":"Rote, Günter, Moritz Rüber, and Morteza Saghafian. “Grid Peeling of Parabolas.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">https://doi.org/10.4230/LIPIcs.SoCG.2024.76</a>.","ama":"Rote G, Rüber M, Saghafian M. Grid peeling of parabolas. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">10.4230/LIPIcs.SoCG.2024.76</a>","apa":"Rote, G., Rüber, M., &#38; Saghafian, M. (2024). Grid peeling of parabolas. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">https://doi.org/10.4230/LIPIcs.SoCG.2024.76</a>","ieee":"G. Rote, M. Rüber, and M. Saghafian, “Grid peeling of parabolas,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293."},"year":"2024","external_id":{"arxiv":["2402.15787"]},"month":"06","publication":"40th International Symposium on Computational Geometry"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-06-14","location":"Athens, Greece","name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11"},"acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart for early discussions on the linked circles construction in three dimensions, and Gábor Tardos for helpful remarks and suggestions.","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2024-06-16T22:01:06Z","article_number":"53","alternative_title":["LIPIcs"],"_id":"17146","intvolume":"       293","date_published":"2024-06-01T00:00:00Z","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"arxiv":1,"type":"conference","title":"Maximum Betti numbers of Čech complexes","related_material":{"record":[{"status":"public","relation":"later_version","id":"20657"}]},"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Pach, János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János"}],"department":[{"_id":"HeEd"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","abstract":[{"text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². In particular, there is an arrangement of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers a long-standing open question in computational geometry.","lang":"eng"}],"external_id":{"arxiv":["2310.14801"]},"year":"2024","citation":{"apa":"Edelsbrunner, H., &#38; Pach, J. (2024). Maximum Betti numbers of Čech complexes. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>","ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>.","ista":"Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 53.","short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293."},"has_accepted_license":"1","month":"06","publication":"40th International Symposium on Computational Geometry","ec_funded":1,"date_updated":"2025-12-01T15:19:20Z","doi":"10.4230/LIPIcs.SoCG.2024.53","publication_status":"published","status":"public","ddc":["510"],"oa_version":"Published Version","oa":1,"file_date_updated":"2024-06-17T08:46:33Z","file":[{"creator":"dernst","date_updated":"2024-06-17T08:46:33Z","file_size":766562,"content_type":"application/pdf","date_created":"2024-06-17T08:46:33Z","success":1,"file_name":"2024_LIPICS_Edelsbrunner.pdf","file_id":"17152","access_level":"open_access","checksum":"5442d44fb89d77477a87668d6e61aac9","relation":"main_file"}],"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"}],"day":"01","article_processing_charge":"No","volume":293},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"conference":{"name":"GD: Graph Drawing and Network Visualization","location":"Vienna, Austria","start_date":"2024-09-18","end_date":"2024-09-20"},"scopus_import":"1","date_created":"2024-11-17T23:01:47Z","OA_place":"publisher","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, \"Discretization in Geometry and Dynamics\", Austrian Science Fund (FWF), grant no. I 02979-N35.","language":[{"iso":"eng"}],"date_published":"2024-10-28T00:00:00Z","article_number":"3","intvolume":"       320","_id":"18556","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959773430"],"issn":["1868-8969"]},"arxiv":1,"corr_author":"1","type":"conference","title":"The Euclidean MST-ratio for bi-colored lattices","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"HeEd"}],"author":[{"last_name":"Cultrera di Montesano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastiano","orcid":"0000-0001-6249-0832","full_name":"Cultrera di Montesano, Sebastiano"},{"full_name":"Draganov, Ondrej","last_name":"Draganov","orcid":"0000-0003-0464-3823","first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","last_name":"Saghafian"}],"abstract":[{"text":"Given a finite set, A ⊆ ℝ², and a subset, B ⊆ A, the MST-ratio is the combined length of the minimum spanning trees of B and A⧵B divided by the length of the minimum spanning tree of A. The question of the supremum, over all sets A, of the maximum, over all subsets B, is related to the Steiner ratio, and we prove this sup-max is between 2.154 and 2.427. Restricting ourselves to 2-dimensional lattices, we prove that the sup-max is 2, while the inf-max is 1.25. By some margin the most difficult of these results is the upper bound for the inf-max, which we prove by showing that the hexagonal lattice cannot have MST-ratio larger than 1.25.","lang":"eng"}],"quality_controlled":"1","external_id":{"arxiv":["2403.10204"],"isi":["001540278400001"]},"year":"2024","citation":{"chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “The Euclidean MST-Ratio for Bi-Colored Lattices.” In <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, Vol. 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">https://doi.org/10.4230/LIPIcs.GD.2024.3</a>.","short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, in:, 32nd International Symposium on Graph Drawing and Network Visualization, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2024. The Euclidean MST-ratio for bi-colored lattices. 32nd International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LIPIcs, vol. 320, 3.","mla":"Cultrera di Montesano, Sebastiano, et al. “The Euclidean MST-Ratio for Bi-Colored Lattices.” <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, vol. 320, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">10.4230/LIPIcs.GD.2024.3</a>.","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2024). The Euclidean MST-ratio for bi-colored lattices. In <i>32nd International Symposium on Graph Drawing and Network Visualization</i> (Vol. 320). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">https://doi.org/10.4230/LIPIcs.GD.2024.3</a>","ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. The Euclidean MST-ratio for bi-colored lattices. In: <i>32nd International Symposium on Graph Drawing and Network Visualization</i>. Vol 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">10.4230/LIPIcs.GD.2024.3</a>","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “The Euclidean MST-ratio for bi-colored lattices,” in <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, Vienna, Austria, 2024, vol. 320."},"has_accepted_license":"1","month":"10","publication":"32nd International Symposium on Graph Drawing and Network Visualization","ec_funded":1,"date_updated":"2025-12-02T13:50:50Z","ddc":["510"],"doi":"10.4230/LIPIcs.GD.2024.3","status":"public","publication_status":"published","oa":1,"oa_version":"Published Version","OA_type":"gold","article_processing_charge":"Yes","day":"28","volume":320,"project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"file_date_updated":"2024-11-18T07:49:25Z","file":[{"creator":"dernst","date_updated":"2024-11-18T07:49:25Z","file_size":908541,"content_type":"application/pdf","date_created":"2024-11-18T07:49:25Z","success":1,"file_id":"18560","file_name":"2024_LIPIcs_CultreradiMontesano.pdf","checksum":"5f9b35e115c3d375e99be78da9054cb4","access_level":"open_access","relation":"main_file"}]},{"external_id":{"isi":["001542467600021"],"arxiv":["2302.11988"]},"year":"2024","citation":{"ieee":"A. El-Hayek, M. Henzinger, and S. Schmid, “Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges,” in <i>38th International Symposium on Distributed Computing</i>, Madrid, Spain, 2024, vol. 319.","chicago":"El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In <i>38th International Symposium on Distributed Computing</i>, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>.","ista":"El-Hayek A, Henzinger M, Schmid S. 2024. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. 38th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 319, 21.","short":"A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” <i>38th International Symposium on Distributed Computing</i>, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In <i>38th International Symposium on Distributed Computing</i> (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>","ama":"El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: <i>38th International Symposium on Distributed Computing</i>. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>"},"has_accepted_license":"1","month":"10","publication":"38th International Symposium on Distributed Computing","ec_funded":1,"date_updated":"2025-12-02T13:51:28Z","ddc":["000"],"doi":"10.4230/LIPIcs.DISC.2024.21","publication_status":"published","status":"public","oa":1,"oa_version":"Published Version","OA_type":"gold","day":"24","article_processing_charge":"Yes","volume":319,"file_date_updated":"2024-11-18T08:02:45Z","file":[{"content_type":"application/pdf","date_updated":"2024-11-18T08:02:45Z","file_size":809666,"creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"d6c8277331cafa188c33ba1717206cf4","success":1,"file_id":"18561","file_name":"2024_LIPIcs_ElHayek.pdf","date_created":"2024-11-18T08:02:45Z"}],"project":[{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"},{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"conference":{"name":"DISC: Symposium on Distributed Computing","location":"Madrid, Spain","start_date":"2024-10-28","end_date":"2024-11-01"},"scopus_import":"1","OA_place":"publisher","date_created":"2024-11-17T23:01:47Z","acknowledgement":"Antoine El-Hayek: This project has received funding from the Austrian Science Fund\r\n(FWF) grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung,\r\n2020–2024.\r\nMonika Henzinger: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI\r\n10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE\r\nStiftung, 2020–2024.\r\nStefan Schmid: This project has received funding from the German Research Foundation (DFG),\r\nSPP 2378 (project ReNO), 2023-2027.","language":[{"iso":"eng"}],"date_published":"2024-10-24T00:00:00Z","article_number":"21","_id":"18557","intvolume":"       319","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959773522"],"issn":["1868-8969"]},"arxiv":1,"corr_author":"1","type":"conference","title":"Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges","department":[{"_id":"MoHe"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"orcid":"0000-0003-4268-7368","first_name":"Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","last_name":"El-Hayek","full_name":"El-Hayek, Antoine"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"abstract":[{"text":"Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight.","lang":"eng"}],"quality_controlled":"1"}]