( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings.

, , и . PaPoC@EuroSys, стр. 5:1-5:10. ACM, (2021)

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 Stavrianidou

Panagiota Sarischouli

 

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

Tracking in Order to Recover: Recoverable Lock-Free Data Structures., , , , и . CoRR, (2019)Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions., , , и . NETYS, том 8593 из Lecture Notes in Computer Science, стр. 25-40. Springer, (2014)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)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)Lock-Free Augmented Trees., и . DISC, том 319 из LIPIcs, стр. 23:1-23:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Complexity of Updating Multi-writer Snapshot Objects., , и . ICDCN, том 4308 из Lecture Notes in Computer Science, стр. 319-330. Springer, (2006)The complexity of updating multi-writer snapshot objects., , и . PODC, стр. 318-319. ACM, (2007)Time-space tradeoffs for implementations of snapshots., , и . STOC, стр. 169-178. ACM, (2006)