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.

107 Publications


2025 | Published | Conference Paper | IST-REx-ID: 20253 | OA
Henzinger, Thomas A., et al. “Quantitative Language Automata.” 36th International Conference on Concurrency Theory, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.CONCUR.2025.21.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 19281 | OA
Resch, Nicolas, et al. “Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.” 16th Innovations in Theoretical Computer Science Conference, vol. 325, 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ITCS.2025.82.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
El-Hayek, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” 4th Symposium on Algorithmic Foundations of Dynamic Networks, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SAND.2025.4.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17145 | OA
Rote, Günter, et al. “Grid Peeling of Parabolas.” 40th International Symposium on Computational Geometry, vol. 293, 76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.76.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15007 | OA
Alpos, Orestis, et al. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” 27th International Conference on Principles of Distributed Systems, vol. 286, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.12.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18175 | OA
Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” 38th European Conference on Object-Oriented Programming, vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ECOOP.2024.27.
[Published Version] View | Files available | DOI
 

2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
Hu, Bingbing, et al. “Connectivity Oracles for Predictable Vertex Failures.” 32nd Annual European Symposium on Algorithms, vol. 308, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ESA.2024.72.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18068 | OA
Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” 35th International Conference on Concurrency Theory, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17327 | OA
Cano, Filip, et al. “Abstraction-Based Decision Making for Statistical Properties.” 9th International Conference on Formal Structures for Computation and Deduction, vol. 299, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.FSCD.2024.2.
[Published Version] View | Files available | DOI
 

2024 | Published | Conference Paper | IST-REx-ID: 18067 | OA
Boker, Udi, et al. “History-Determinism vs Fair Simulation.” 35th International Conference on Concurrency Theory, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.12.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18066 | OA
Avni, Guy, et al. “Bidding Games with Charging.” 35th International Conference on Concurrency Theory, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.8.
[Published Version] View | Files available | DOI | arXiv
 

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

2024 | Published | Conference Paper | IST-REx-ID: 17146 | OA
Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” 40th International Symposium on Computational Geometry, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.53.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17144 | OA
Kourimska, Hana, et al. “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, vol. 293, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.69.
[Published Version] View | Files available | DOI | arXiv
 

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

2024 | Published | Conference Paper | IST-REx-ID: 18156 | OA
Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” International Conference on Approximation Algorithms for Combinatorial Optimization Problems , vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40.
[Published Version] View | Files available | DOI | arXiv
 

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

2024 | Published | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” 27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed