Muktikanta Sa

According to our database, Muktikanta Sa authored at least 14 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.

Bapi Chatterjee, Sathya Peri, Muktikanta Sa

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Komma Manogna

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Dynamic Graph Operations: A Consistent Non-blocking Approach.

Bapi Chatterjee, Sathya Peri, Muktikanta Sa

CoRR, 2020

2019

A Pragmatic Non-blocking Concurrent Directed Acyclic Graph.

Sathya Peri, Muktikanta Sa, Nandini Singhal

Proceedings of the Networked Systems - 7th International Conference, 2019

A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries.

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

An Efficient Practical Concurrent Wait-Free Unbounded Graph.

Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa

Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019

2018

A Concurrent Unbounded Wait-Free Graph.

Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa

CoRR, 2018

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries.

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal

CoRR, 2018

Maintenance of Strongly Connected Component in Shared-memory Graph.

Muktikanta Sa

CoRR, 2018

Short Paper: Maintenance of Strongly Connected Component in Shared-Memory Graph.

Muktikanta Sa

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Building Efficient Concurrent Graph Object through Composition of List-based Set.

Sathya Peri, Muktikanta Sa, Nandini Singhal

CoRR, 2017

Proving Correctness of Concurrent Objects by Validating Linearization Points.

Sathya Peri, Muktikanta Sa, Nandini Singhal

CoRR, 2017

2016

Maintaining Acyclicity of Concurrent Graphs.

Sathya Peri, Muktikanta Sa, Nandini Singhal

CoRR, 2016

2011

A simple agent based model for detecting abnormal event patterns in distributed wireless sensor networks.

Muktikanta Sa, Amiya Kumar Rath

Proceedings of the 2011 International Conference on Communication, 2011