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.
121 Publications
2020 | Journal Article | IST-REx-ID: 8268 | 
N. M. Gurel et al., “Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications,” IEEE Transactions on Signal Processing, vol. 68. IEEE, pp. 4268–4282, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 8722 |
S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 45–61.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Journal Article | IST-REx-ID: 7224 |
J. Rybicki, N. Abrego, and O. Ovaskainen, “Habitat fragmentation and species diversity in competitive communities,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 506–517, 2020.
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 8724 |
N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.
[Published Version]
View
| Files available
| arXiv
2020 | Conference Paper | IST-REx-ID: 7213 |
S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 7802 |
A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Virtual Event, United States, 2020, no. 7, pp. 175–185.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 7636 |
T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2020 | Conference Paper | IST-REx-ID: 8191
D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.
View
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 7635
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
View
| DOI