( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning.

, , и . ICDCN, стр. 258-259. ACM, (2024)

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.

Peri Kocabayoglu

Ivan Peri

Mark Peri

Bojan Peri

Israel Peri

 

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

A Concurrent Unbounded Wait-Free Graph., , и . CoRR, (2018)Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench., , , и . CoRR, (2017)An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs., , , и . PDP, стр. 35-43. IEEE, (2021)Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot., , и . SSS, том 14310 из Lecture Notes in Computer Science, стр. 106-110. Springer, (2023)Maintaining Acyclicity of Concurrent Graphs., , и . CoRR, (2016)Opacity proof for CaPR+ algorithm., , и . ICDCN, стр. 16:1-16:4. ACM, (2016)Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems., и . ICDCN, том 6522 из Lecture Notes in Computer Science, стр. 95-106. Springer, (2011)A Self-stabilizing Minimum Average Stretch Spanning Tree Construction., , и . NETYS, том 13464 из Lecture Notes in Computer Science, стр. 119-135. Springer, (2022)Starvation Freedom in Multi-Version Transactional Memory Systems., , , и . CoRR, (2017)Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems., , , , и . SSS, том 11914 из Lecture Notes in Computer Science, стр. 209-227. Springer, (2019)