Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

112 Publications


2024 | Published | Conference Paper | IST-REx-ID: 18067 | OA
Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18308 | OA
La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” In 32nd Annual European Symposium on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.100.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18068 | OA
Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18556 | OA
Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “The Euclidean MST-Ratio for Bi-Colored Lattices.” In 32nd International Symposium on Graph Drawing and Network Visualization, Vol. 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.GD.2024.3.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
Hu, Bingbing, Evangelos Kosinas, and Adam Polak. “Connectivity Oracles for Predictable Vertex Failures.” In 32nd Annual European Symposium on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.72.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In 38th International Symposium on Distributed Computing, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.DISC.2024.21.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” In 19th International Symposium on Parameterized and Exact Computation, Vol. 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18175 | OA
Maj, Petr, Stefanie Muroya Lei, Konrad Siek, Luca Di Grazia, and Jan Vitek. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” In 38th European Conference on Object-Oriented Programming, Vol. 313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ECOOP.2024.27.
[Published Version] View | Files available | DOI | WoS
 

2023 | Published | Conference Paper | IST-REx-ID: 14485 | OA
Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.” In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.
[Published Version] View | Files available | DOI
 

2023 | Published | Conference Paper | IST-REx-ID: 14516 | OA
Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.” In 5th Conference on Advances in Financial Technologies, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.AFT.2023.7.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Published | Conference Paper | IST-REx-ID: 14085 | OA
Goranci, Gramoz, and Monika Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14086 | OA
Henzinger, Monika, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14084 | OA
Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14405 | OA
Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14083 | OA
Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.99.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 12760 | OA
Henzinger, Monika, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.36.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11812 | OA
Hanauer, Kathrin, Monika Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.18.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 12775 | OA
Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11183 | OA
Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15.
[Published Version] View | Files available | DOI
 

2022 | Published | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed