default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSweta Kumari 0001
Person information
- affiliation: Shiv Nadar Institution of Eminence, Gautam Buddha Nagar, India
- affiliation (2021 - 2023): Huawei Technologies India Pvt. Ltd, India
- affiliation (2019 - 2021): Technion, Haifa, Israel
- affiliation (PhD 2019): Indian Institute of Technology Hyderabad, India
Other persons with the same name
- Sweta Kumari 0002
![[0000-0003-0441-6065]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-0441-6065")
— Indian Institute of Technology Madras, Department of Biotechnology, Chennai, India - Sweta Kumari 0003 — Indian Institute of Technology (ISM) Dhanbad, Electronics Engineering Department, Jharkhand, India
- Sweta Kumari 0004 — Delhi Technological University, New Delhi, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]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)- 2022
- [j3]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) - [j2]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) - [j1]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement. Inf. Comput. 285(Part): 104869 (2022) - 2021
- [i9]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) - 2020
- [c9]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 - [c8]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems That Mix Shared Memory and Message Passing. OPODIS 2020: 16:1-16:16 - [c7]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. PODC 2020: 51-53 - [c6]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. SSS 2020: 1-15 - [i8]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. CoRR abs/2003.07787 (2020) - [i7]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems that Mix Shared Memory and Message Passing. CoRR abs/2012.10846 (2020)
2010 – 2019
- 2019
- [c5]Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani:
Entitling concurrency to smart contracts using optimistic transactional memory. ICDCN 2019: 508 - [c4]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 - [c3]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 - [c2]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 - [i6]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) - [i5]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) - [i4]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) - 2018
- [c1]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 - [i3]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) - 2017
- [i2]Ved Prakash Chaudhary, Sandeep S. Kulkarni, Sweta Kumari, Sathya Peri:
Starvation Freedom in Multi-Version Transactional Memory Systems. CoRR abs/1709.01033 (2017) - [i1]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)
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-07-20 20:33 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:
