Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5735 Publications
2021 | Published | Thesis | IST-REx-ID: 9733 | 
The polaron at strong coupling
D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.
2021 | Published | Journal Article | IST-REx-ID: 15271
Simple, deterministic, constant-round coloring in congested clique and MPC
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
View
| DOI
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
2021 | Published | Conference Paper | IST-REx-ID: 10630 |
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
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.
2021 | Published | Conference Paper | IST-REx-ID: 10072 |
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
D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 | Published | Conference Paper | IST-REx-ID: 10075 |
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
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.