A simple agent based model for detecting abnormal event patterns in distributed wireless sensor networks. - Muktikanta Sa; Amiya Kumar Rath (ICCCS, 2011)

Maintaining Acyclicity of Concurrent Graphs. - Sathya Peri; Muktikanta Sa; Nandini Singhal (CoRR, 2016)

Proving Correctness of Concurrent Objects by Validating Linearization Points. - Sathya Peri; Muktikanta Sa; Nandini Singhal (CoRR, 2017)

Building Efficient Concurrent Graph Object through Composition of List-based Set. - Sathya Peri; Muktikanta Sa; Nandini Singhal (CoRR, 2017)

Short Paper: Maintenance of Strongly Connected Component in Shared-Memory Graph. - Muktikanta Sa (NETYS, 2018)

Maintenance of Strongly Connected Component in Shared-memory Graph. - 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)

A Concurrent Unbounded Wait-Free Graph. - Sathya Peri; Chandra Kiran Reddy; Muktikanta Sa (CoRR, 2018)

An Efficient Practical Concurrent Wait-Free Unbounded Graph. - Sathya Peri; Chandra Kiran Reddy; Muktikanta Sa (HPCC/SmartCity/DSS, 2019)

A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries. - Bapi Chatterjee; Sathya Peri; Muktikanta Sa; Nandini Singhal (ICDCN, 2019)

A Pragmatic Non-blocking Concurrent Directed Acyclic Graph. - Sathya Peri; Muktikanta Sa; Nandini Singhal (NETYS, 2019)

Dynamic Graph Operations: A Consistent Non-blocking Approach. - Bapi Chatterjee; Sathya Peri; Muktikanta Sa (CoRR, 2020)

Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. - Bapi Chatterjee; Sathya Peri; Muktikanta Sa; Komma Manogna (OPODIS, 2021)

Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. - Bapi Chatterjee; Sathya Peri; Muktikanta Sa (DISC, 2021)