7 citations · 16 across the 10 of their papers we have counts for
5 papers · 1 filter
Learned Lock-free Search Data Structures
Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma +2
Non-blocking search data structures offer scalability with a progress guarantee on high-performance multi-core architectures. In the recent past, "learned queries" have gained rema…
Wait-Free Updates and Range Search using Uruv
Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee +1
CRUD operations, along with range queries make a highly useful abstract data type (ADT), employed by many dynamic analytics tasks. Despite its wide applications, to our knowledge,…
Dynamic Graph Operations: A Consistent Non-blocking Approach
Bapi Chatterjee, Sathya Peri, Muktikanta Sa
Graph algorithms enormously contribute to the domains such as blockchains, social networks, biological networks, telecommunication networks, and several others. The ever-increasing…
A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries
Bapi Chatterjee, Sathya Peri, Muktikanta Sa +1
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- additi…
Efficient Lock-free Binary Search Trees
Bapi Chatterjee, Nhan Nguyen, Philippas Tsigas
In this paper we present a novel algorithm for concurrent lock-free internal binary search trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in t…