( en | de | ru )

 

Disambiguation of "Sa, Muktikanta"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Practical Concurrent Wait-Free Unbounded Graph.

, , and . HPCC/SmartCity/DSS, page 2487-2494. IEEE, (2019)

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.

Abdulrahman Sà Sà

Sa Bajt

Sa ari

Sa Pintar

Sa Baki

 

Other publications of authors with the same name

Dynamic Graph Operations: A Consistent Non-blocking Approach., , and . CoRR, (2020)A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries., , , and . ICDCN, page 168-177. ACM, (2019)A Pragmatic Non-blocking Concurrent Directed Acyclic Graph., , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 327-344. Springer, (2019)Proving Correctness of Concurrent Objects by Validating Linearization Points., , and . CoRR, (2017)Short Paper: Maintenance of Strongly Connected Component in Shared-Memory Graph.. NETYS, volume 11028 of Lecture Notes in Computer Science, page 382-387. Springer, (2018)Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds., , , and . OPODIS, volume 217 of LIPIcs, page 20:1-20:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An Efficient Practical Concurrent Wait-Free Unbounded Graph., , and . HPCC/SmartCity/DSS, page 2487-2494. IEEE, (2019)Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds., , and . DISC, volume 209 of LIPIcs, page 52:1-52:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A simple agent based model for detecting abnormal event patterns in distributed wireless sensor networks., and . ICCCS, page 67-70. ACM, (2011)Maintenance of Strongly Connected Component in Shared-memory Graph.. CoRR, (2018)