Sathya Peri

Adithya Rajesh Chandrassery

Parwat Singh Anjana

Proceedings of the Networked Systems - 10th International Conference, 2022

An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree.

[BibT_eX]

[DOI]

Parwat Singh Anjana

Proceedings of the IEEE 15th International Conference on Cloud Computing, 2022

2021

An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Bapi Chatterjee

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

An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th Euromicro International Conference on Parallel, 2021

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

[BibT_eX]

[DOI]

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

DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain✱.

[BibT_eX]

[DOI]

Prashansa Agrawal

Parwat Singh Anjana

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020

Dynamic Graph Operations: A Consistent Non-blocking Approach.

[BibT_eX]

[DOI]

Bapi Chatterjee

CoRR, 2020

Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 8th International Conference, 2020

Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree.

[BibT_eX]

[DOI]

Aishwarya Gurjar

Sinchan Sengupta

Proceedings of the 19th International Symposium on Parallel and Distributed Computing, 2020

2019

DiPETrans: A Framework for Distributed Parallel Execution of Transactions of Blocks in Blockchain.

[BibT_eX]

[DOI]

CoRR, 2019

Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics.

[BibT_eX]

[DOI]

CoRR, 2019

Achieving Greater Concurrency in Execution of Smart Contracts using Object Semantics.

[BibT_eX]

[DOI]

CoRR, 2019

STMs in practice: Partial rollback vs pure abort mechanisms.

[BibT_eX]

[DOI]

Anshu S. Anand

R. K. Shyamasundar

Concurr. Comput. Pract. Exp., 2019

Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

An Efficient Framework for Optimistic Concurrent Execution of Smart Contracts.

[BibT_eX]

[DOI]

Proceedings of the 27th Euromicro International Conference on Parallel, 2019

A Pragmatic Non-blocking Concurrent Directed Acyclic Graph.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Entitling concurrency to smart contracts using optimistic transactional memory.

[BibT_eX]

[DOI]

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

An Efficient Practical Concurrent Wait-Free Unbounded Graph.

[BibT_eX]

[DOI]

Chandra Kiran Reddy

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.

[BibT_eX]

[DOI]

Chandra Kiran Reddy

CoRR, 2018

An Efficient Framework for Concurrent Execution of Smart Contracts.

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Garbage Collection in Concurrent Sets.

[BibT_eX]

[DOI]

Jonathan Marbaniang

Shekhar Bhandakkar

CoRR, 2018

An Innovative Approach to Achieve Compositionality Efficiently Using Multi-version Object Based Transactional Systems.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems.

[BibT_eX]

[DOI]

Ajay Singh

Archit Somani

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

2017

Non-interference and local correctness in transactional memory.

[BibT_eX]

[DOI]

Petr Kuznetsov

Theor. Comput. Sci., 2017

An Innovative Approach for Achieving Composability in Concurrent Systems using Multi-Version Object Based STMs.

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Starvation Freedom in Multi-Version Transactional Memory Systems.

[BibT_eX]

[DOI]

Ved Prakash Chaudhary

Sandeep S. Kulkarni

Sweta Kumari

CoRR, 2017

Efficient means of Achieving Composability using Transactional Memory.

[BibT_eX]

[DOI]

Ajay Singh

Archit Somani

CoRR, 2017

Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench.

[BibT_eX]

[DOI]

CoRR, 2017

Proving Correctness of Concurrent Objects by Validating Linearization Points.

[BibT_eX]

[DOI]

CoRR, 2017

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016

Maintaining Acyclicity of Concurrent Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Opacity proof for CaPR+ algorithm.

[BibT_eX]

[DOI]

Anshu S. Anand

R. K. Shyamasundar

Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015

Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

CoRR, 2015

Multiversion Conflict Notion for Transactional Memory Systems.

[BibT_eX]

[DOI]

CoRR, 2015

S-Gossip: Security Enhanced Gossip Protocol for Unstructured P2P Networks.

[BibT_eX]

[DOI]

Sumit Kumar Tetarave

Somanath Tripathy

Proceedings of the Distributed Computing and Internet Technology, 2015

2014

A TimeStamp Based Multi-version STM Algorithm.

[BibT_eX]

[DOI]

K. Vidyasankar

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013

Correctness of concurrent executions of closed nested transactions in transactional memory systems.

[BibT_eX]

[DOI]

K. Vidyasankar

Theor. Comput. Sci., 2013

A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness

[BibT_eX]

[DOI]

CoRR, 2013

Multi-Version Conflict Notion.

[BibT_eX]

[DOI]

CoRR, 2013

2012

On Non-Interference of Transactions

[BibT_eX]

[DOI]

Petr Kuznetsov

CoRR, 2012

An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference.

[BibT_eX]

[DOI]

Krishnamurthy Vidyasankar

Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

SEPastry: Security Enhanced Pastry.

[BibT_eX]

[DOI]

Madhumita Mishra

Somanath Tripathy