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


2021 | Published | Conference Paper | IST-REx-ID: 10072 | OA
A new notion of commutativity for the algorithmic Lovász Local Lemma
Harris, David G., A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 207. 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
Korhonen, Janne, Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing 209. 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
Alistarh, Dan-Adrian, Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing 209. 2021
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10054 | OA
Faster algorithms for bounded liveness in graphs and game graphs
Chatterjee, Krishnendu, Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming 198. 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
Arrighi, Emmanuel, On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 213. 2021
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
Jecker, Ismael R, A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science 187. 2021
[Published Version] View | Files available | DOI | WoS
 

2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Decomposing permutation automata
Jecker, Ismael R, Decomposing permutation automata. 32nd International Conference on Concurrency Theory 203. 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
Guha, Shibashis, A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science 202. 2021
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 9441 | OA
Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations
J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 9604 | OA
Counting cells of order-k voronoi tessellations in ℝ3 with morse theory
Biswas, Ranita, Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. Leibniz International Proceedings in Informatics 189. 2021
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 9345 | OA
The density fingerprint of a periodic point set
H. Edelsbrunner, T. Heiss, V. Kurlin , P. Smith, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 9605 | OA
Computing the multicover bifiltration
Corbet, René, Computing the multicover bifiltration. Leibniz International Proceedings in Informatics 189. 2021
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 11816 | OA
Dynamic matching algorithms in practice
M. 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. 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. 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. 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. 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. 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: 7605 | OA
In search of the fastest concurrent union-find algorithm
Alistarh, Dan-Adrian, In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems 153. 2020
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7990 | OA
Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
Wagner, Uli, Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry 164. 2020
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Export / Embed