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.
77 Publications
2024 | Published | Conference Paper | IST-REx-ID: 17144 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms
H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 17145 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grid peeling of parabolas
G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 17146 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Maximum Betti numbers of Čech complexes
H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 17327 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Abstraction-based decision making for statistical properties
F. Cano, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, 9th International Conference on Formal Structures for Computation and Deduction, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
F. Cano, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, 9th International Conference on Formal Structures for Computation and Deduction, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 15007 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks
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.
[Published Version]
View
| Files available
| DOI
| arXiv
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.
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Electrical flows for polylogarithmic competitive oblivious routing
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.
[Published Version]
View
| Files available
| DOI
| arXiv
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.
2024 | Published | Conference Paper | IST-REx-ID: 18066 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bidding games with charging
G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18067 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
History-determinism vs fair simulation
U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18068 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Strategic dominance: A new preorder for nondeterministic processes
T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18156 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Private counting of distinct elements in the turnstile model and extensions
M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The fault in our stars: Designing reproducible large-scale code analysis experiments
P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18308 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fully dynamic k-means coreset in near-optimal update time
M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Connectivity oracles for predictable vertex failures
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18556 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The Euclidean MST-ratio for bi-colored lattices
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.
[Published Version]
View
| Files available
| DOI
| arXiv
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.
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18758 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, in:, 19th International Symposium on Parameterized and Exact Computation, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
J. Lill, K.H. Petrova, S. Weber, in:, 19th International Symposium on Parameterized and Exact Computation, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
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.
[Published Version]
View
| Files available
| DOI
| arXiv
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.
2023 | Published | Conference Paper | IST-REx-ID: 14084 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Parameter estimation for Gibbs distributions
D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
2023 | Published | Conference Paper | IST-REx-ID: 14085 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Efficient data structures for incremental exact and approximate maximum flow
G. Goranci, M. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version]
View
| Files available
| DOI
G. Goranci, M. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
2023 | Published | Conference Paper | IST-REx-ID: 14485 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brief announcement: BatchBoost: Universal batching for concurrent data structures
V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version]
View
| Files available
| DOI
V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.