Andreia Correia

Orcid: 0000-0002-6569-9671

According to our database1, Andreia Correia authored at least 18 papers between 2016 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Robot-human coordination for pallet loading in a parts-to-picker order-picking system.
Comput. Ind. Eng., 2026

2024
Scaling Up Transactions with Slower Clocks.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023
2PLSF: Two-Phase Locking with Starvation-Freedom.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

TL4x: Buffered Durable Transactions on Disk as Fast as in Memory.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

2022
2PLSF - Two-Phase Locking with Starvation-Freedom.
Dataset, November, 2022

2021
Efficient algorithms for persistent transactional memory.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

OrcGC: automatic lock-free memory reclamation.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

NVCache: A Plug-and-Play NVMM-based I/O Booster for Legacy Systems.
Proceedings of the 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2021

2020
A wait-free universal construction for large objects.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Persistent memory and the rise of universal constructions.
Proceedings of the EuroSys '20: Fifteenth EuroSys Conference 2020, 2020

2019
A Wait-Free Universal Construct for Large Objects.
CoRR, 2019

OneFile: A Wait-Free Persistent Transactional Memory.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

2018
Romulus: Efficient Algorithms for Persistent Transactional Memory.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Strong trylocks for reader-writer locks.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

2017
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

POSTER: A Wait-Free Queue with Wait-Free Memory Reclamation.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

POSTER: Poor Man's URCU.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
Tidex: a mutual exclusion lock.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016


  Loading...