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 | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical population protocols. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 43.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh D-A, Gelashvili R, Nadiradze G. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 4.
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. 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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 11814 | OA
Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms for graphs under continual observation. 29th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

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

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

2021 | Conference Paper | IST-REx-ID: 9441 | OA
Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.
[Published Version] View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 11818 | OA
Henzinger MH, Kale S. 2020. Fully-dynamic coresets. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 57.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 11816 | OA
Henzinger MH, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 58.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 11824 | OA
Henzinger MH, Neumann S, Wiese A. 2020. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 51.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 11822 | OA
Hanauer K, Henzinger MH, Schulz C. 2020. Faster fully dynamic transitive closure in practice. 18th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 160, 14.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 11825 | OA
Henzinger MH, Peng P. 2020. Constant-time dynamic (Δ+1)-coloring. 37th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 154, 53.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 11819 | OA
Henzinger MH, Noe A, Schulz C, Strash D. 2020. Finding all global minimum cuts in practice. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 59.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 7348 | OA
Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8725 | OA
Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 7952 | OA
Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations of isomanifolds. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications