Sathya Peri | DeepAI

AI Chat

Featured Co-authors

Sandeep Kulkarni
10 publications
Sweta Kumari
9 publications
Ramakrishna Upadrasta
8 publications
Parwat Singh Anjana
8 publications
Archit Somani
8 publications
Bapi Chatterjee
7 publications
Siddharth Nayak
6 publications
Abhinav Sharma
6 publications
Muktikanta Sa
5 publications
Gaurav Bhardwaj
5 publications
Shalini Jain
3 publications

∙ 08/22/2023

Learned Lock-free Search Data Structures

Non-blocking search data structures offer scalability with a progress gu...

0 Gaurav Bhardwaj, et al. ∙

∙ 07/27/2023

Wait-Free Updates and Range Search using Uruv

CRUD operations, along with range queries make a highly useful abstract ...

0 Gaurav Bhardwaj, et al. ∙

∙ 02/16/2023

An Efficient Framework for Execution of Smart Contracts in Hyperledger Sawtooth

Blockchain technology is a distributed, decentralized, and immutable led...

0 Manaswini Piduguralla, et al. ∙

∙ 03/19/2022

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

Replicated tree data structures are extensively used in collaborative ap...

0 Parwat Singh Anjana, et al. ∙

∙ 03/17/2022

FUSED-PAGERANK: Loop-Fusion based Approximate PageRank

PageRank is a graph centrality metric that gives the importance of each ...

0 Shalini Jain, et al. ∙

∙ 09/20/2021

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

PageRank is a well-known algorithm whose robustness helps set a standard...

0 Hemalatha Eedi, et al. ∙

∙ 02/09/2021

OptSmart: A Space Efficient Optimistic Concurrent Execution of Smart Contracts

Popular blockchains such as Ethereum and several others execute complex ...

0 Parwat Singh Anjana, et al. ∙

∙ 10/17/2020

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

The surge in the spread of misleading information, lies, propaganda, and...

0 Prashansa Agrawal, et al. ∙

∙ 03/03/2020

Dynamic Graph Operations: A Consistent Non-blocking Approach

Graph algorithms enormously contribute to the domains such as blockchain...

0 Bapi Chatterjee, et al. ∙

∙ 05/03/2019

An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems

In the modern era of multi-core systems, the main aim is to utilize the ...

0 Chirag Juyal, et al. ∙

∙ 04/07/2019

Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics

Software Transactional Memory Systems (STMs) provides ease of multithrea...

0 Chirag Juyal, et al. ∙

∙ 03/31/2019

Achieving Greater Concurrency in Execution of Smart Contracts using Object Semantics

Popular blockchain such as Ethereum and several others execute complex t...

0 Parwat Singh Anjana, et al. ∙

∙ 10/31/2018

A Concurrent Unbounded Wait-Free Graph

In this paper, we propose a concurrent non-blocking unbounded directed g...

0 Sathya Peri, et al. ∙

∙ 09/05/2018

Entitling Concurrency to Smart Contracts Using Optimistic Transactional Memory

Blockchain platforms such as Ethereum and several others execute complex...

0 Parwat Singh Anjana, et al. ∙

∙ 09/05/2018

An Efficient Framework for Concurrent Execution of Smart Contracts

Distributed public blockchain platform such as ethereum entitle complex ...

0 Parwat Singh Anjana, et al. ∙

∙ 09/04/2018

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

Graph algorithms applied in many applications, including social networks...

0 Bapi Chatterjee, et al. ∙

∙ 06/03/2018

Garbage Collection in Concurrent Sets

Garbage Collection in concurrent data structures, especially lock-free o...

0 Jonathan Marbaniang, et al. ∙

∙ 12/28/2017

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

In the modern era of multicore processors, utilizing multiple cores prop...

0 Sandeep Kulkarni, et al. ∙

∙ 10/20/2017

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

In this paper, we propose a generic concurrent directed graph (for share...

0 Sathya Peri, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world