Basso M, Prokopec A, Rosà A and Binder W. (2023). Optimization-Aware Compiler-Level Event Profiling. ACM Transactions on Programming Languages and Systems. 10.1145/3591473.

Moreno P, Areias M and Rocha R. (2020). A Compression-Based Design for Higher Throughput in a Lock-Free Hash Map. Euro-Par 2020: Parallel Processing. 10.1007/978-3-030-57675-2_29. (458-473).

http://link.springer.com/10.1007/978-3-030-57675-2_29

Wang H, Ou J, Zhao M, Qiu S, Jiao Y, Wang Y, Mao Q, Yang Z, Liu Y, Zhang J, Hu J, Zhang J, Liu J, Chen J, Shen Y, Cao L, Zhang H, Li H, Li M, Ma Y, Zhang L, Liu J, Zhang G, Liu F and Chen J. (2024). LavaStore: ByteDance's Purpose-Built, High-Performance, Cost-Effective Local Storage Engine for Cloud Services. Proceedings of the VLDB Endowment. 17:12. (3799-3812). Online publication date: 1-Aug-2024.

https://doi.org/10.14778/3685800.3685807

Areias M and Rocha R. (2022). On the correctness of a lock-free compression-based elastic mechanism for a hash trie design. Computing. 10.1007/s00607-022-01085-2. 104:10. (2279-2305). Online publication date: 1-Oct-2022.

https://link.springer.com/10.1007/s00607-022-01085-2

Kang J and Jung J. A marriage of pointer- and epoch-based reclamation. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. (314-328).

https://doi.org/10.1145/3385412.3385978

Natarajan A, Ramachandran A and Mittal N. (2020). FEAST. ACM Transactions on Parallel Computing. 7:2. (1-64). Online publication date: 31-May-2020.

https://doi.org/10.1145/3391438

Brown T, Prokopec A and Alistarh D. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (276-291).

https://doi.org/10.1145/3332466.3374542

Prokopec A, Rosà A, Leopoldseder D, Duboscq G, Tůma P, Studener M, Bulej L, Zheng Y, Villazón A, Simon D, Würthinger T and Binder W. Renaissance: benchmarking suite for parallel applications on the JVM. Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. (31-47).

https://doi.org/10.1145/3314221.3314637

Prokopec A, Duboscq G, Leopoldseder D and Würthinger T. An optimization-driven incremental inline substitution algorithm for just-in-time compilers. Proceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization. (164-179).

/doi/10.5555/3314872.3314893

Prokopec A, Duboscq G, Leopoldseder D and Wirthinger T. (2019). An Optimization-Driven Incremental Inline Substitution Algorithm for Just-in-Time Compilers 2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). 10.1109/CGO.2019.8661171. 978-1-7281-1436-1. (164-179).

https://ieeexplore.ieee.org/document/8661171/

Areias M and Rocha R. (2018). On Extending a Fixed Size, Persistent and Lock-Free Hash Map Design to Store Sorted Keys 2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom). 10.1109/BDCloud.2018.00070. 978-1-7281-1141-4. (415-422).

https://ieeexplore.ieee.org/document/8672329/

Marr S and Daloze B. Few versatile vs. many specialized collections: how to design a collection library for exploratory programming?. Companion Proceedings of the 2nd International Conference on the Art, Science, and Engineering of Programming. (135-143).

https://doi.org/10.1145/3191697.3214334

Prokopec A. (2018). Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure. Euro-Par 2018: Parallel Processing. 10.1007/978-3-319-96983-1_41. (575-589).

https://link.springer.com/10.1007/978-3-319-96983-1_41

Körner P and Bendisposto J. (2018). Distributed Model Checking Using ProB. NASA Formal Methods. 10.1007/978-3-319-77935-5_18. (244-260).

http://link.springer.com/10.1007/978-3-319-77935-5_18