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.

4950 Publications


2021 | 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 | 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 | Preprint | IST-REx-ID: 10080 | OA [Preprint] View | DOI | Download Preprint (ext.)
 

2021 | Journal Article | IST-REx-ID: 10153 | OA
Transitioning from structural to nominal code with efficient gradual typing
F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10148 | OA
Capturing tactile properties of real surfaces for haptic reproduction
D. Degraen, M. Piovarci, B. Bickel, A. Kruger, in:, 34th Annual ACM Symposium, Association for Computing Machinery, 2021, pp. 954–971.
[Preprint] View | Files available | DOI
 

2021 | Preprint | IST-REx-ID: 10174 | OA [Preprint] View | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10180 | OA
Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, E.-A. Peste, Journal of Machine Learning Research 22 (2021) 1–124.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | 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 | 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 | 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
 

Filters and Search Terms

extern<>1

Search

Filter Publications