Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.”10.1007/978-3-031-37706-8_8__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 156–69, doi:10.1007/978-3-031-37706-8_8.
LibreCat: https://research-explorer.ista.ac.at/record/14260
DOI: 10.1007/978-3-031-37706-8_8

Koval, Nikita, et al. Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM. Zenodo, 2023, doi:10.5281/ZENODO.7877757.
LibreCat: https://research-explorer.ista.ac.at/record/14995
DOI: 10.5281/ZENODO.7877757

Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.”10.1145/3558481.3591082__Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.
LibreCat: https://research-explorer.ista.ac.at/record/13262
DOI: 10.1145/3558481.3591082
arXiv: 2304.09331

Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.” 36th Conference on Neural Information Processing Systems, vol. 36, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15363
arXiv: 2305.17581

Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.”10.4230/LIPIcs.OPODIS.2021.14__25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14.
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808

Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.”10.4230/LIPIcs.OPODIS.2021.15__25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.15.
LibreCat: https://research-explorer.ista.ac.at/record/11183
DOI: 10.4230/LIPIcs.OPODIS.2021.15

Shevchenko, Aleksandr, et al. “Mean-Field Analysis of Piecewise Linear Solutions for Wide ReLU Networks.” Journal of Machine Learning Research, vol. 23, no. 130, Journal of Machine Learning Research, 2022, pp. 1–55.
LibreCat: https://research-explorer.ista.ac.at/record/11420
arXiv: 2111.02278

Pacut, Maciej, et al. “Brief Announcement: Temporal Locality in Online Algorithms.”10.4230/LIPIcs.DISC.2022.52__36th International Symposium on Distributed Computing, vol. 246, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.DISC.2022.52.
LibreCat: https://research-explorer.ista.ac.at/record/12182
DOI: 10.4230/LIPIcs.DISC.2022.52

Markov, Ilia, et al. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.”10.1145/3528535.3565248__Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–54, doi:10.1145/3528535.3565248.
LibreCat: https://research-explorer.ista.ac.at/record/12780
DOI: 10.1145/3528535.3565248
arXiv: 2111.08617

Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.”10.1145/3519270.3538435__Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
LibreCat: https://research-explorer.ista.ac.at/record/11844
DOI: 10.1145/3519270.3538435
arXiv: 2205.12597

Brown, Trevor A., et al. “PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures.”10.1145/3503221.3508410__Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 385–99, doi:10.1145/3503221.3508410.
LibreCat: https://research-explorer.ista.ac.at/record/11181
DOI: 10.1145/3503221.3508410
WoS: 000883318200027

Postnikova, Anastasiia, et al. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.”10.1145/3503221.3508432__Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 353–67, doi:10.1145/3503221.3508432.
LibreCat: https://research-explorer.ista.ac.at/record/11180
DOI: 10.1145/3503221.3508432
WoS: 000883318200025
arXiv: 2109.00657

Postnikova, Anastasiia, et al. Multi-Queues Can Be State-of-the-Art Priority Schedulers. Zenodo, 2022, doi:10.5281/ZENODO.5733408.
LibreCat: https://research-explorer.ista.ac.at/record/13076
DOI: 10.5281/ZENODO.5733408

Balliu, Alkida, et al. “Local Mending.”10.1007/978-3-031-09993-9_1__International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, vol. 13298, Springer Nature, 2022, pp. 1–20, doi:10.1007/978-3-031-09993-9_1.
LibreCat: https://research-explorer.ista.ac.at/record/11707
DOI: 10.1007/978-3-031-09993-9_1
WoS: 000876977400001
arXiv: 2102.08703

Iofinova, Eugenia B., et al. “How Well Do Sparse ImageNet Models Transfer?”10.1109/cvpr52688.2022.01195__2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Institute of Electrical and Electronics Engineers, 2022, pp. 12256–66, doi:10.1109/cvpr52688.2022.01195.
LibreCat: https://research-explorer.ista.ac.at/record/12299
DOI: 10.1109/cvpr52688.2022.01195
WoS: 000870759105034
arXiv: 2111.13445

Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”10.1007/s00453-021-00905-9__Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
LibreCat: https://research-explorer.ista.ac.at/record/8286
DOI: 10.1007/s00453-021-00905-9
WoS: 000734004600001
arXiv: 2003.09297

Hoefler, Torsten, et al. “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, 2021, pp. 1–124.
LibreCat: https://research-explorer.ista.ac.at/record/10180
arXiv: 2102.00554

Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.”10.4230/LIPIcs.DISC.2021.43__35th International Symposium on Distributed Computing, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.43.
LibreCat: https://research-explorer.ista.ac.at/record/10218
DOI: 10.4230/LIPIcs.DISC.2021.43
arXiv: 2102.08808

Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.”10.4230/LIPIcs.DISC.2021.4__35th International Symposium on Distributed Computing, vol. 209, 4, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.4.
LibreCat: https://research-explorer.ista.ac.at/record/10217
DOI: 10.4230/LIPIcs.DISC.2021.4

Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.”10.4230/LIPIcs.DISC.2021.52__35th International Symposium on Distributed Computing, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.52.
LibreCat: https://research-explorer.ista.ac.at/record/10216
DOI: 10.4230/LIPIcs.DISC.2021.52
arXiv: 2003.01697