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.

103 Publications


2025 | Published | Conference Paper | IST-REx-ID: 19281 | OA
Tight bounds on list-decodable and list-recoverable zero-rate codes
Resch, Nicolas, Tight bounds on list-decodable and list-recoverable zero-rate codes. 16th Innovations in Theoretical Computer Science Conference 325. 2025
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17145 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 15007 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18175 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18068 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 17327 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18067 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 15006 | OA
On the convergence time in graphical games: A locality-sensitive approach
Hirvonen, Juho, On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems 286. 2024
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
Asadi, Ali, 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 323. 2024
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18066 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18556 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 17146 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 17144 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18156 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 15008 | OA
Electrical flows for polylogarithmic competitive oblivious routing
Goranci, Gramoz, Electrical flows for polylogarithmic competitive oblivious routing. 15th Innovations in Theoretical Computer Science Conference 287. 2024
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18308 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
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
 

2023 | Published | Conference Paper | IST-REx-ID: 14485 | OA
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
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Export / Embed