default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSathya Peri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Parwat Singh Anjana
, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
OptSmart: a space efficient Optimistic concurrent execution of Smart contracts. Distributed Parallel Databases 42(2): 245-297 (2024)- [c42]Subhajit Sahu, Kishore Kothapalli, Hemalatha Eedi, Sathya Peri:
DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs. Euro-Par (3) 2024: 312-326 - [c41]Manaswini Piduguralla, Souvik Sarkar, Sathya Peri:
Improving Throughput and Fault Tolerance of Blockchain Nodes. ICDCN 2024: 256-257 - [c40]Gaurav Bhardwaj, Ayaz Ahmed, Sathya Peri:
Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning. ICDCN 2024: 258-259 - [c39]Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak:
Kanva: A Lock-free Learned Search Data Structure. ICPP 2024: 252-261 - [c38]Subhajit Sahu, Kishore Kothapalli, Hemalatha Eedi, Sathya Peri:
Lock-free Computation of PageRank in Dynamic Graphs. IPDPS (Workshops) 2024: 825-834 - [c37]Gaurav Bhardwaj, Ayaz Ahmed, Sathya Peri:
Concurrent Wait-Free Graph Snapshots Using Multi-versioning. NETYS 2024: 32-49 - [c36]Nischay Ranjan, Rohit Kapoor, Sathya Peri:
Short Paper: An Efficient Framework for Supporting Nested Transaction in STMs. NETYS 2024: 204-210 - [c35]Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak:
Brief Announcement: Lock-free Learned Search Data Structure. SPAA 2024: 65-67 - [i33]Raaghav Ravishankar, Sandeep S. Kulkarni, Sathya Peri, Gokarna Sharma:
Distributing Context-Aware Shared Memory Data Structures: A Case Study on Unordered Linked List. CoRR abs/2404.10151 (2024) - [i32]Ajay D. Kshemkalyani, Manaswini Piduguralla, Sathya Peri, Anshuman Misra:
Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers. CoRR abs/2405.19457 (2024) - 2023
- [c34]Manaswini Piduguralla, Saheli Chakraborty, Parwat Singh Anjana, Sathya Peri:
DAG-Based Efficient Parallel Scheduler for Blockchains: Hyperledger Sawtooth as a Case Study. Euro-Par 2023: 184-198 - [c33]Gaurav Bhardwaj, Sathya Peri, Pratik Shetty:
Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. SSS 2023: 106-110 - [c32]Gaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri:
Wait-Free Updates and Range Search Using Uruv. SSS 2023: 435-450 - [i31]Manaswini Piduguralla, Saheli Chakraborty, Parwat Singh Anjana, Sathya Peri:
An Efficient Framework for Execution of Smart Contracts in Hyperledger Sawtooth. CoRR abs/2302.08452 (2023) - [i30]Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee, Sathya Peri:
Wait-Free Updates and Range Search using Uruv. CoRR abs/2307.14744 (2023) - [i29]Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak:
Learned Lock-free Search Data Structures. CoRR abs/2308.11205 (2023) - [i28]Gaurav Bhardwaj, Sathya Peri, Pratik Shetty:
Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. CoRR abs/2310.02380 (2023) - 2022
- [j10]Ved Prakash Chaudhary, Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri:
Achieving starvation-freedom in multi-version transactional memory systems. Computing 104(10): 2159-2179 (2022) - [j9]Shrey Baheti, Parwat Singh Anjana, Sathya Peri, Yogesh Simmhan:
DiPETrans: A framework for distributed parallel execution of transactions of blocks in blockchains. Concurr. Comput. Pract. Exp. 34(10) (2022) - [j8]Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
An efficient approach to achieve compositionality using optimized multi-version object based transactional systems. Inf. Comput. 285(Part): 104696 (2022) - [j7]Hemalatha Eedi, Sahith Karra, Sathya Peri, Neha Ranabothu, Rahul Utkoor:
An Improved/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs. Int. J. Parallel Program. 50(3-4): 381-404 (2022) - [c31]Parwat Singh Anjana, Adithya Rajesh Chandrassery, Sathya Peri:
An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree. CLOUD 2022: 479-488 - [c30]Parwat Singh Anjana, Adithya Rajesh Chandrassery, Sathya Peri:
An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree. CCGRID 2022: 767-770 - [c29]Sinchan Sengupta, Sathya Peri, Parwat Singh Anjana:
A Self-stabilizing Minimum Average Stretch Spanning Tree Construction. NETYS 2022: 119-135 - [c28]Sinchan Sengupta, Sathya Peri, Vipul Aggarwal, Ambey Kumari Gupta:
A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality. PDP 2022: 67-74 - [e1]Raju S. Bapi, Sandeep S. Kulkarni, Swarup Mohalik, Sathya Peri:
Distributed Computing and Intelligent Technology - 18th International Conference, ICDCIT 2022, Bhubaneswar, India, January 19-23, 2022, Proceedings. Lecture Notes in Computer Science 13145, Springer 2022, ISBN 978-3-030-94875-7 [contents] - [i27]Shalini Jain, Rahul Utkoor, Hemalatha Eedi, Sathya Peri, Ramakrishna Upadrasta:
FUSED-PAGERANK: Loop-Fusion based Approximate PageRank. CoRR abs/2203.09284 (2022) - [i26]Parwat Singh Anjana, Adithya Rajesh Chandrassery, Sathya Peri:
An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree. CoRR abs/2203.10285 (2022) - 2021
- [c27]Prashansa Agrawal, Parwat Singh Anjana, Sathya Peri:
DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain✱. ICDCN 2021: 245-246 - [c26]Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Komma Manogna:
Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. OPODIS 2021: 20:1-20:25 - [c25]Hemalatha Eedi, Sathya Peri, Neha Ranabothu, Rahul Utkoor:
An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs. PDP 2021: 35-43 - [c24]Bapi Chatterjee, Sathya Peri, Muktikanta Sa:
Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. DISC 2021: 52:1-52:4 - [i25]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
OptSmart: A Space Efficient Optimistic Concurrent Execution of Smart Contracts. CoRR abs/2102.04875 (2021) - [i24]Hemalatha Eedi, Sahith Karra, Sathya Peri, Neha Ranabothu, Rahul Utkoor:
An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs. CoRR abs/2109.09527 (2021) - 2020
- [c23]Aishwarya Gurjar, Sathya Peri, Sinchan Sengupta:
Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree. ISPDC 2020: 142-149 - [c22]Parwat Singh Anjana, Hagit Attiya, Sweta Kumari, Sathya Peri, Archit Somani:
Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory. NETYS 2020: 77-93 - [i23]Bapi Chatterjee, Sathya Peri, Muktikanta Sa:
Dynamic Graph Operations: A Consistent Non-blocking Approach. CoRR abs/2003.01697 (2020) - [i22]Prashansa Agrawal, Parwat Singh Anjana, Sathya Peri:
DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain. CoRR abs/2010.08765 (2020)
2010 – 2019
- 2019
- [j6]Anshu S. Anand, R. K. Shyamasundar, Sathya Peri:
STMs in practice: Partial rollback vs pure abort mechanisms. Concurr. Comput. Pract. Exp. 31(5) (2019) - [c21]Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa:
An Efficient Practical Concurrent Wait-Free Unbounded Graph. HPCC/SmartCity/DSS 2019: 2487-2494 - [c20]Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal:
A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries. ICDCN 2019: 168-177 - [c19]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
Entitling concurrency to smart contracts using optimistic transactional memory. ICDCN 2019: 508 - [c18]Ved Prakash Chaudhary, Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri:
Achieving Starvation-Freedom in Multi-version Transactional Memory Systems. NETYS 2019: 291-310 - [c17]Sathya Peri, Muktikanta Sa, Nandini Singhal:
A Pragmatic Non-blocking Concurrent Directed Acyclic Graph. NETYS 2019: 327-344 - [c16]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
An Efficient Framework for Optimistic Concurrent Execution of Smart Contracts. PDP 2019: 83-92 - [c15]Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems. SSS 2019: 209-227 - [i21]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Archit Somani:
Achieving Greater Concurrency in Execution of Smart Contracts using Object Semantics. CoRR abs/1904.00358 (2019) - [i20]Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics. CoRR abs/1904.03700 (2019) - [i19]Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems. CoRR abs/1905.01200 (2019) - [i18]Shrey Baheti, Parwat Singh Anjana, Sathya Peri, Yogesh Simmhan:
DiPETrans: A Framework for Distributed Parallel Execution of Transactions of Blocks in Blockchain. CoRR abs/1906.11721 (2019) - 2018
- [c14]Sathya Peri, Ajay Singh, Archit Somani:
Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems. NETYS 2018: 157-174 - [c13]Chirag Juyal, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
An Innovative Approach to Achieve Compositionality Efficiently Using Multi-version Object Based Transactional Systems. SSS 2018: 284-300 - [i17]Jonathan Marbaniang, Shekhar Bhandakkar, Sathya Peri:
Garbage Collection in Concurrent Sets. CoRR abs/1806.00834 (2018) - [i16]Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal:
A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries. CoRR abs/1809.00896 (2018) - [i15]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
An Efficient Framework for Concurrent Execution of Smart Contracts. CoRR abs/1809.01326 (2018) - [i14]Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa:
A Concurrent Unbounded Wait-Free Graph. CoRR abs/1810.13325 (2018) - 2017
- [j5]Petr Kuznetsov, Sathya Peri:
Non-interference and local correctness in transactional memory. Theor. Comput. Sci. 688: 103-116 (2017) - [c12]Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram:
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. ICDCN 2017: 44 - [i13]Sathya Peri, Muktikanta Sa, Nandini Singhal:
Proving Correctness of Concurrent Objects by Validating Linearization Points. CoRR abs/1705.02884 (2017) - [i12]Ajay Singh, Sathya Peri, G. Monika, Anila Kumari:
Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench. CoRR abs/1707.08357 (2017) - [i11]Sathya Peri, Ajay Singh, Archit Somani:
Efficient means of Achieving Composability using Transactional Memory. CoRR abs/1709.00681 (2017) - [i10]Ved Prakash Chaudhary, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri:
Starvation Freedom in Multi-Version Transactional Memory Systems. CoRR abs/1709.01033 (2017) - [i9]Sathya Peri, Muktikanta Sa, Nandini Singhal:
Building Efficient Concurrent Graph Object through Composition of List-based Set. CoRR abs/1710.08296 (2017) - [i8]Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri, Archit Somani:
An Innovative Approach for Achieving Composability in Concurrent Systems using Multi-Version Object Based STMs. CoRR abs/1712.09803 (2017) - 2016
- [c11]Anshu S. Anand, R. K. Shyamasundar, Sathya Peri:
Opacity proof for CaPR+ algorithm. ICDCN 2016: 16:1-16:4 - [i7]Sathya Peri, Muktikanta Sa, Nandini Singhal:
Maintaining Acyclicity of Concurrent Graphs. CoRR abs/1611.03947 (2016) - 2015
- [c10]Sumit Kumar Tetarave, Somanath Tripathy, Sathya Peri:
S-Gossip: Security Enhanced Gossip Protocol for Unstructured P2P Networks. ICDCIT 2015: 288-298 - [i6]Priyanka Kumar, Sathya Peri:
Multiversion Conflict Notion for Transactional Memory Systems. CoRR abs/1509.04048 (2015) - [i5]Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram:
Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture. CoRR abs/1509.08267 (2015) - [i4]Anshu S. Anand, R. K. Shyamasundar, Sathya Peri:
Opacity Proof for CaPR+ Algorithm. CoRR abs/1510.06967 (2015) - 2014
- [c9]Petr Kuznetsov, Sathya Peri:
Non-interference and Local Correctness in Transactional Memory. ICDCN 2014: 197-211 - [c8]Priyanka Kumar, Sathya Peri, K. Vidyasankar:
A TimeStamp Based Multi-version STM Algorithm. ICDCN 2014: 212-226 - 2013
- [j4]Sathya Peri, K. Vidyasankar:
Correctness of concurrent executions of closed nested transactions in transactional memory systems. Theor. Comput. Sci. 496: 125-153 (2013) - [i3]Priyanka Kumar, Sathya Peri:
A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness. CoRR abs/1305.6624 (2013) - [i2]Priyanka Kumar, Sathya Peri:
Multi-Version Conflict Notion. CoRR abs/1307.8256 (2013) - 2012
- [c7]Madhumita Mishra, Somanath Tripathy, Sathya Peri:
SEPastry: Security Enhanced Pastry. ACITY (1) 2012: 789-795 - [c6]Sathya Peri, Krishnamurthy Vidyasankar:
An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference. ICDCN 2012: 409-423 - [i1]Petr Kuznetsov, Sathya Peri:
On Non-Interference of Transactions. CoRR abs/1211.6315 (2012) - 2011
- [c5]Sathya Peri, Krishnamurthy Vidyasankar:
Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems. ICDCN 2011: 95-106 - 2010
- [c4]Marin Bertier, François Bonnet, Anne-Marie Kermarrec, Vincent Leroy, Sathya Peri, Michel Raynal:
D2HT: The Best of Both Worlds, Integrating RPS and DHT. EDCC 2010: 135-144
2000 – 2009
- 2008
- [j3]Sathya Peri, Neeraj Mittal:
Improving the Efficacy of a Termination Detection Algorithm. J. Inf. Sci. Eng. 24(1): 159-174 (2008) - 2007
- [j2]Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
A family of optimal termination detection algorithms. Distributed Comput. 20(2): 141-162 (2007) - [j1]Ranganath Atreya, Neeraj Mittal, Sathya Peri:
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set. IEEE Trans. Parallel Distributed Syst. 18(10): 1345-1360 (2007) - 2005
- [c3]Sathya Peri, Neeraj Mittal:
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. FSTTCS 2005: 420-431 - 2004
- [c2]Sathya Peri, Neeraj Mittal:
On Termination Detection in an Asynchronous Distributed System. PDCS 2004: 209-215 - [c1]Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies. DISC 2004: 290-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
