( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS.

, и . PODC, стр. 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.

Panagiota Anagnostu

Panagiota Papazoglou

Panagiota Bilianou

Panagiota Sarischouli

Panagiota Mantaka

 

Другие публикации лиц с тем же именем

VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores., , , , и . CoRR, (2020)The complexity of updating snapshot objects., , и . J. Parallel Distributed Comput., 71 (12): 1570-1577 (2011)Lock-Free Augmented Trees., и . DISC, том 319 из LIPIcs, стр. 23:1-23:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions., , , и . NETYS, том 8593 из Lecture Notes in Computer Science, стр. 25-40. Springer, (2014)Tracking in Order to Recover: Recoverable Lock-Free Data Structures., , , , и . CoRR, (2019)Disjoint-Access Parallelism in Software Transactional Memory., и . Transactional Memory, том 8913 из Lecture Notes in Computer Science, Springer, (2015)The performance power of software combining in persistence., , и . PPoPP, стр. 337-352. ACM, (2022)Staleness and Local Progress in Transactional Memory., , , и . NETYS, том 12129 из Lecture Notes in Computer Science, стр. 227-243. Springer, (2020)ParIS: The Next Destination for Fast Data Series Indexing and Query Answering., , и . IEEE BigData, стр. 791-800. IEEE, (2018)The PCL theorem: transactions cannot be parallel, consistent and live., , , и . SPAA, стр. 178-187. ACM, (2014)