| A simple agent based model for detecting abnormal event patterns in distributed wireless sensor networks M Sa, AK Rath Proceedings of the 2011 International Conference on Communication, Computing …, 2011 | 23 | 2011 |
| A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries B Chatterjee, S Peri, M Sa, N Singhal Proceedings of the 20th International Conference on Distributed Computing …, 2019 | 19 | 2019 |
| Maintaining acyclicity of concurrent graphs S Peri, M Sa, N Singhal CoRR, abs/1611.03947, 2016 | 7 | 2016 |
| Non-blocking dynamic unbounded graphs with worst-case amortized bounds B Chatterjee, S Peri, M Sa, K Manogna 25th International Conference on Principles of Distributed Systems (OPODIS 2021), 2022 | 5 | 2022 |
| An efficient practical concurrent wait-free unbounded graph S Peri, CK Reddy, M Sa 2019 IEEE 21st International Conference on High Performance Computing and …, 2019 | 3 | 2019 |
| Dynamic Graph Operations: A Consistent Non-blocking Approach B Chatterjee, S Peri, M Sa arXiv preprint arXiv:2003.01697, 2020 | 2 | 2020 |
| Proving correctness of concurrent objects by validating linearization points S Peri, M Sa, A Singh, N Singhal, A Somani arXiv preprint arXiv:1705.02884, 2017 | 2 | 2017 |
| Short Paper: Maintenance of Strongly Connected Component in Shared-Memory Graph M Sa Networked Systems: 6th International Conference, NETYS 2018, Essaouira …, 2019 | 1 | 2019 |
| A Concurrent Unbounded Wait-Free Graph S Peri, CK Reddy, M Sa arXiv preprint arXiv:1810.13325, 2018 | 1 | 2018 |
| A simple and practical concurrent non-blocking unbounded graph with reachability queries B Chatterjee, S Peri, M Sa, N Singhal arXiv preprint arXiv:1809.00896, 2018 | 1 | 2018 |
| Maintenance of strongly connected component in shared-memory graph M Sa arXiv preprint arXiv:1804.01276, 2018 | 1 | 2018 |
| Building efficient concurrent graphs through composition of set objects S Peri, M Sa, N Singhal CoRR, abs/1710.08296, 2017 | 1 | 2017 |
| Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds B Chatterjee, S Peri, M Sa 35th International Symposium on Distributed Computing (DISC 2021), 2021 | | 2021 |
| The Design of Efficient Concurrent Non-blocking Graph Algorithms M Sa, S Peri | | 2020 |
| A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries S Peri, M Sa Association for Computing Machinery, 2019 | | 2019 |
| A pragmatic non-blocking concurrent directed acyclic graph S Peri, M Sa, N Singhal Networked Systems: 7th International Conference, NETYS 2019, Marrakech …, 2019 | | 2019 |
| Building Efficient Concurrent Graph Object through Composition of List-based Set S Peri, M Sa, N Singhal arXiv preprint arXiv:1710.08296, 2017 | | 2017 |
| An Efficient Concurrent Graph Data-Structure which maintains Acyclicity S Peri, M Sa, N Singhal arXiv preprint arXiv:1611.03947, 2016 | | 2016 |
| Dynamic Acyclicity of Concurrent Graph Objects S Peri, M Sa, N Singhal | | |
