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.

62 Publications


2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Decomposing permutation automata
I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10054 | OA
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Published | Conference Paper | IST-REx-ID: 10072 | OA
A new notion of commutativity for the algorithmic Lovász Local Lemma
D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
A bit of nondeterminism makes pushdown automata expressive and succinct
S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10217 | OA
Lower bounds for shared-memory leader election under bounded write contention
D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10218 | OA
Brief announcement: Fast graphical population protocols
D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
On the complexity of intersection non-emptiness for star-free language classes
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7952 | OA
The topological correctness of PL-approximations of isomanifolds
J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI
 

2020 | Published | Conference Paper | IST-REx-ID: 8725 | OA
The splay-list: A distribution-adaptive concurrent skip-list
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11816 | OA
Dynamic matching algorithms in practice
M.H. Henzinger, K. Shahbaz, R. Paul, C. Schulz, in:, 8th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11818 | OA
Fully-dynamic coresets
M.H. Henzinger, S. Kale, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11819 | OA
Finding all global minimum cuts in practice
M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11822 | OA
Faster fully dynamic transitive closure in practice
K. Hanauer, M.H. Henzinger, C. Schulz, in:, 18th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11824 | OA
Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
M.H. Henzinger, S. Neumann, A. Wiese, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11825 | OA
Constant-time dynamic (Δ+1)-coloring
M.H. Henzinger, P. Peng, in:, 37th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7348 | OA
Monitoring event frequencies
T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Export / Embed