( en | de | ru )

 

Disambiguation of "Fatourou, Panagiota"

Author of the publication

copydeleteadd this publication to your clipboard
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS.

, and . PODC, page 33-42. ACM, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Panagiota Anagnostu

Panagiota Papazoglou

Panagiota Bilianou

Panagiota Sarischouli

Panagiota Mantaka

 

Other publications of authors with the same name

Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions., , , and . NETYS, volume 8593 of Lecture Notes in Computer Science, page 25-40. Springer, (2014)The complexity of updating snapshot objects., , and . J. Parallel Distributed Comput., 71 (12): 1570-1577 (2011)Tracking in Order to Recover: Recoverable Lock-Free Data Structures., , , , and . CoRR, (2019)VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores., , , , and . CoRR, (2020)Disjoint-Access Parallelism in Software Transactional Memory., and . Transactional Memory, volume 8913 of Lecture Notes in Computer Science, Springer, (2015)The performance power of software combining in persistence., , and . PPoPP, page 337-352. ACM, (2022)Lock-Free Augmented Trees., and . DISC, volume 319 of LIPIcs, page 23:1-23:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Time-space tradeoffs for implementations of snapshots., , and . STOC, page 169-178. ACM, (2006)Non-blocking binary search trees., , , and . PODC, page 131-140. ACM, (2010)The Complexity of Updating Multi-writer Snapshot Objects., , and . ICDCN, volume 4308 of Lecture Notes in Computer Science, page 319-330. Springer, (2006)