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.
4262 Publications
2022 |Published| Journal Article | IST-REx-ID: 7577 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities with inertial-type method,” Applicable Analysis, vol. 101, no. 1. Taylor & Francis, pp. 192–216, 2022.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |Submitted| Preprint | IST-REx-ID: 11943 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Velicky et al., “Saturated reconstruction of living brain tissue,” bioRxiv. Cold Spring Harbor Laboratory.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2022 |Submitted| Preprint | IST-REx-ID: 11950 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. M. Michalska et al., “Uncovering brain tissue architecture across scales with super-resolution light microscopy,” bioRxiv. Cold Spring Harbor Laboratory.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 |Published| Journal Article | IST-REx-ID: 10023 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” Communications in Information and Systems, vol. 21, no. 4. International Press, pp. 481–536, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10052 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10054 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version]
View
| Files available
| DOI
2021 |Published| Journal Article | IST-REx-ID: 10071 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to tutorial-a-thon,” Notices of the American Mathematical Society, vol. 68, no. 9. American Mathematical Society, pp. 1511–1514, 2021.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 10072 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol. 207.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10075 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Submitted| Preprint | IST-REx-ID: 10080 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” bioRxiv. Cold Spring Harbor Laboratory.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2021 |Published| Journal Article | IST-REx-ID: 10153 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” Proceedings of the ACM on Programming Languages, vol. 5. Association for Computing Machinery, 2021.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10148 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. Degraen, M. Piovarci, B. Bickel, and A. Kruger, “Capturing tactile properties of real surfaces for haptic reproduction,” in 34th Annual ACM Symposium, Virtual, 2021, pp. 954–971.
[Preprint]
View
| Files available
| DOI
2021 |Submitted| Preprint | IST-REx-ID: 10174 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
N. Clozeau and A. Gloria, “Quantitative nonlinear homogenization: control of oscillations,” arXiv. .
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 10180 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and E.-A. Peste, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” Journal of Machine Learning Research, vol. 22, no. 241. Journal of Machine Learning Research, pp. 1–124, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10218 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10217 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10216 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10219 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 10285 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
G. Dubach, “On eigenvector statistics in the spherical and truncated unitary ensembles,” Electronic Journal of Probability, vol. 26. Institute of Mathematical Statistics, 2021.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10367 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
C. Ilharco et al., “Recognizing multimodal entailment,” in 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts, Bangkok, Thailand, 2021, pp. 29–30.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)