On Termination Detection in an Asynchronous Distributed System. - Sathya Peri; Neeraj Mittal (PDCS, 2004)

Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies. - Neeraj Mittal; Subbarayan Venkatesan; Sathya Peri (DISC, 2004)

Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. - Sathya Peri; Neeraj Mittal (FSTTCS, 2005)

A family of optimal termination detection algorithms. - Neeraj Mittal; Subbarayan Venkatesan; Sathya Peri (Distributed Comput., 2007)

A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set. - Ranganath Atreya; Neeraj Mittal; Sathya Peri (IEEE Trans. Parallel Distributed Syst., 2007)

Improving the Efficacy of a Termination Detection Algorithm. - Sathya Peri; Neeraj Mittal (J. Inf. Sci. Eng., 2008)

D2HT: The Best of Both Worlds, Integrating RPS and DHT. - Marin Bertier; François Bonnet 001; Anne-Marie Kermarrec; Vincent Leroy 001; Sathya Peri; Michel Raynal (EDCC, 2010)

SEPastry: Security Enhanced Pastry. - Madhumita Mishra; Somanath Tripathy; Sathya Peri (ACITY (1), 2012)

An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference. - Sathya Peri; Krishnamurthy Vidyasankar (ICDCN, 2012)

On Non-Interference of Transactions - Petr Kuznetsov; Sathya Peri (CoRR, 2012)

Multi-Version Conflict Notion. - Priyanka Kumar; Sathya Peri (CoRR, 2013)

A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness - Priyanka Kumar; Sathya Peri (CoRR, 2013)

Correctness of concurrent executions of closed nested transactions in transactional memory systems. - Sathya Peri; K. Vidyasankar (Theor. Comput. Sci., 2013)

A TimeStamp Based Multi-version STM Algorithm. - Priyanka Kumar; Sathya Peri; K. Vidyasankar (ICDCN, 2014)

S-Gossip: Security Enhanced Gossip Protocol for Unstructured P2P Networks. - Sumit Kumar Tetarave; Somanath Tripathy; Sathya Peri (ICDCIT, 2015)

Multiversion Conflict Notion for Transactional Memory Systems. - Priyanka Kumar; Sathya Peri (CoRR, 2015)

Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture. - Nandini Singhal; Sathya Peri; Subrahmanyam Kalyanasundaram (CoRR, 2015)

Opacity proof for CaPR+ algorithm. - Anshu S. Anand; R. K. Shyamasundar; Sathya Peri (ICDCN, 2016)

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

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. - Nandini Singhal; Sathya Peri; Subrahmanyam Kalyanasundaram (ICDCN, 2017)

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

Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench. - Ajay Singh 002; Sathya Peri; G. Monika; Anila Kumari (CoRR, 2017)

Efficient means of Achieving Composability using Transactional Memory. - Sathya Peri; Ajay Singh 002; Archit Somani (CoRR, 2017)

Starvation Freedom in Multi-Version Transactional Memory Systems. - Ved Prakash Chaudhary; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri (CoRR, 2017)

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

An Innovative Approach for Achieving Composability in Concurrent Systems using Multi-Version Object Based STMs. - Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri; Archit Somani (CoRR, 2017)

Non-interference and local correctness in transactional memory. - Petr Kuznetsov; Sathya Peri (Theor. Comput. Sci., 2017)

Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems. - Sathya Peri; Ajay Singh 002; Archit Somani (NETYS, 2018)

An Innovative Approach to Achieve Compositionality Efficiently Using Multi-version Object Based Transactional Systems. - Chirag Juyal; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri; Archit Somani (SSS, 2018)

Garbage Collection in Concurrent Sets. - Jonathan Marbaniang; Shekhar Bhandakkar; Sathya Peri (CoRR, 2018)

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries. - Bapi Chatterjee; Sathya Peri; Muktikanta Sa; Nandini Singhal (CoRR, 2018)

An Efficient Framework for Concurrent Execution of Smart Contracts. - Parwat Singh Anjana; Sweta Kumari 001; Sathya Peri; Sachin Rathor; Archit Somani (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)

Entitling concurrency to smart contracts using optimistic transactional memory. - Parwat Singh Anjana; Sweta Kumari 001; Sathya Peri; Sachin Rathor; Archit Somani (ICDCN, 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)

An Efficient Framework for Optimistic Concurrent Execution of Smart Contracts. - Parwat Singh Anjana; Sweta Kumari 001; Sathya Peri; Sachin Rathor; Archit Somani (PDP, 2019)

Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems. - Chirag Juyal; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri; Archit Somani (SSS, 2019)

STMs in practice: Partial rollback vs pure abort mechanisms. - Anshu S. Anand; R. K. Shyamasundar; Sathya Peri (Concurr. Comput. Pract. Exp., 2019)

Achieving Greater Concurrency in Execution of Smart Contracts using Object Semantics. - Parwat Singh Anjana; Sweta Kumari 001; Sathya Peri; Archit Somani (CoRR, 2019)

Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics. - Chirag Juyal; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri; Archit Somani (CoRR, 2019)

DiPETrans: A Framework for Distributed Parallel Execution of Transactions of Blocks in Blockchain. - Shrey Baheti; Parwat Singh Anjana; Sathya Peri; Yogesh Simmhan (CoRR, 2019)

Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree. - Aishwarya Gurjar; Sathya Peri; Sinchan Sengupta (ISPDC, 2020)

Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory. - Parwat Singh Anjana; Hagit Attiya; Sweta Kumari 001; Sathya Peri; Archit Somani (NETYS, 2020)

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

DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain✱. - Prashansa Agrawal; Parwat Singh Anjana; Sathya Peri (ICDCN, 2021)

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

An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs. - Hemalatha Eedi; Sathya Peri; Neha Ranabothu; Rahul Utkoor (PDP, 2021)

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

An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs. - Hemalatha Eedi; Sahith Karra; Sathya Peri; Neha Ranabothu; Rahul Utkoor (CoRR, 2021)

An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree. - Parwat Singh Anjana; Adithya Rajesh Chandrassery; Sathya Peri (CLOUD, 2022)

A Self-stabilizing Minimum Average Stretch Spanning Tree Construction. - Sinchan Sengupta; Sathya Peri; Parwat Singh Anjana (NETYS, 2022)

A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality. - Sinchan Sengupta; Sathya Peri; Vipul Aggarwal; Ambey Kumari Gupta (PDP, 2022)

Achieving starvation-freedom in multi-version transactional memory systems. - Ved Prakash Chaudhary; Chirag Juyal; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri (Computing, 2022)

DiPETrans: A framework for distributed parallel execution of transactions of blocks in blockchains. - Shrey Baheti; Parwat Singh Anjana; Sathya Peri; Yogesh Simmhan (Concurr. Comput. Pract. Exp., 2022)

FUSED-PAGERANK: Loop-Fusion based Approximate PageRank. - Shalini Jain 002; Rahul Utkoor; Hemalatha Eedi; Sathya Peri; Ramakrishna Upadrasta (CoRR, 2022)

An efficient approach to achieve compositionality using optimized multi-version object based transactional systems. - Chirag Juyal; Sandeep S. Kulkarni; Sweta Kumari 001; Sathya Peri; Archit Somani (Inf. Comput., 2022)

An Improved/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs. - Hemalatha Eedi; Sahith Karra; Sathya Peri; Neha Ranabothu; Rahul Utkoor (Int. J. Parallel Program., 2022)

DAG-Based Efficient Parallel Scheduler for Blockchains: Hyperledger Sawtooth as a Case Study. - Manaswini Piduguralla; Saheli Chakraborty; Parwat Singh Anjana; Sathya Peri (Euro-Par, 2023)

Wait-Free Updates and Range Search Using Uruv. - Gaurav Bhardwaj; Bapi Chatterjee; Abhay Jain; Sathya Peri (SSS, 2023)

Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. - Gaurav Bhardwaj; Sathya Peri; Pratik Shetty (SSS, 2023)

An Efficient Framework for Execution of Smart Contracts in Hyperledger Sawtooth. - Manaswini Piduguralla; Saheli Chakraborty; Parwat Singh Anjana; Sathya Peri (CoRR, 2023)

Learned Lock-free Search Data Structures. - Gaurav Bhardwaj; Bapi Chatterjee; Abhinav Sharma; Sathya Peri; Siddharth Nayak (CoRR, 2023)

Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. - Gaurav Bhardwaj; Sathya Peri; Pratik Shetty (CoRR, 2023)

DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs. - Subhajit Sahu; Kishore Kothapalli; Hemalatha Eedi; Sathya Peri (Euro-Par (3), 2024)

Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning. - Gaurav Bhardwaj; Ayaz Ahmed; Sathya Peri (ICDCN, 2024)

Improving Throughput and Fault Tolerance of Blockchain Nodes. - Manaswini Piduguralla; Souvik Sarkar; Sathya Peri (ICDCN, 2024)

Kanva: A Lock-free Learned Search Data Structure. - Gaurav Bhardwaj; Bapi Chatterjee; Abhinav Sharma; Sathya Peri; Siddharth Nayak (ICPP, 2024)

Lock-free Computation of PageRank in Dynamic Graphs. - Subhajit Sahu; Kishore Kothapalli; Hemalatha Eedi; Sathya Peri (IPDPS (Workshops), 2024)

Concurrent Wait-Free Graph Snapshots Using Multi-versioning. - Gaurav Bhardwaj; Ayaz Ahmed; Sathya Peri (NETYS, 2024)

Short Paper: An Efficient Framework for Supporting Nested Transaction in STMs. - Nischay Ranjan; Rohit Kapoor; Sathya Peri (NETYS, 2024)

Brief Announcement: Lock-free Learned Search Data Structure. - Gaurav Bhardwaj; Bapi Chatterjee; Abhinav Sharma; Sathya Peri; Siddharth Nayak (SPAA, 2024)

Distributing Context-Aware Shared Memory Data Structures: A Case Study on Unordered Linked List. - Raaghav Ravishankar; Sandeep S. Kulkarni; Sathya Peri; Gokarna Sharma (CoRR, 2024)

Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers. - Ajay D. Kshemkalyani; Manaswini Piduguralla; Sathya Peri; Anshuman Misra (CoRR, 2024)

Unleashing Multicore Strength for Efficient Execution of Transactions. - Ankit Ravish; Akshay Tejwani; Manaswini Piduguralla; Sathya Peri (CoRR, 2024)

OptSmart: a space efficient Optimistic concurrent execution of Smart contracts. - Parwat Singh Anjana; Sweta Kumari 001; Sathya Peri; Sachin Rathor; Archit Somani (Distributed Parallel Databases, 2024)

Efficient Task Graph Scheduling for Parallel QR Factorization in SLSQP. - Soumyajit Chatterjee; Rahul Utkoor; Uppu Eshwar; Sathya Peri; V. Krishna Nandivada (Euro-Par (3), 2025)

Byzantine-Tolerant Consensus in GPU-Inspired Shared Memory. - Chryssis Georgiou; Manaswini Piduguralla; Sathya Peri (Euro-Par (3), 2025)

Enhancing QR Decomposition: A GPU-Based Approach to Parallelizing the Householder Algorithm with CUDA Streams. - Uppu Eshwar; Soumyajit Chatterjee; Sathya Peri (ICDCIT, 2025)

Unleashing Multicore Strength for Efficient Execution of Blockchain Transactions. - Ankit Ravish; Akshay Tejwani; Manaswini Piduguralla; Sathya Peri (ICDCIT, 2025)

Concurrent and Learned Data Structures. - Bapi Chatterjee; Sathya Peri (ICDCN, 2025)

On Constructing a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers. - Ajay D. Kshemkalyani; Manaswini Piduguralla; Sathya Peri; Anshuman Misra (ICDCN, 2025)

Distributing Context-Aware Shared Memory Data Structures: A Case Study on Singly-Linked Lists. - Raaghav Ravishankar; Sandeep S. Kulkarni; Sathya Peri; Gokarna Sharma (ICDCN, 2025)

On Reducing Stretch in Spanning Trees. - Sinchan Sengupta; Sathya Peri (Concurr. Comput. Pract. Exp., 2025)