default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVikram Saraph
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i7]Vivian Maloney, Richard F. Obrecht, Vikram Saraph, Prathibha Rama, Kate Tallaksen:
High-Resolution Convolutional Neural Networks on Homomorphically Encrypted Data via Sharding Ciphertexts. CoRR abs/2306.09189 (2023)- 2021
- [c6]Kiwan Maeng, Shivam Bharuka, Isabel Gao, Mark C. Jeffrey, Vikram Saraph, Bor-Yiing Su, Caroline Trippel, Jiyan Yang, Mike Rabbat, Brandon Lucia, Carole-Jean Wu:
Understanding and Improving Failure Tolerant Training for Deep Learning Recommendation with Partial Recovery. MLSys 2021 - 2020
- [c5]Udit Gupta, Samuel Hsia, Vikram Saraph, Xiaodong Wang, Brandon Reagen, Gu-Yeon Wei, Hsien-Hsin S. Lee, David Brooks, Carole-Jean Wu:
DeepRecSys: A System for Optimizing End-To-End At-Scale Neural Recommendation Inference. ISCA 2020: 982-995 - [i6]Udit Gupta, Samuel Hsia, Vikram Saraph, Xiaodong Wang, Brandon Reagen, Gu-Yeon Wei, Hsien-Hsin S. Lee, David Brooks, Carole-Jean Wu:
DeepRecSys: A System for Optimizing End-To-End At-scale Neural Recommendation Inference. CoRR abs/2001.02772 (2020) - [i5]Kiwan Maeng, Shivam Bharuka, Isabel Gao, Mark C. Jeffrey, Vikram Saraph, Bor-Yiing Su, Caroline Trippel, Jiyan Yang, Mike Rabbat, Brandon Lucia, Carole-Jean Wu:
CPR: Understanding and Improving Failure Tolerant Training for Deep Learning Recommendation with Partial Recovery. CoRR abs/2011.02999 (2020)
2010 – 2019
- 2019
- [b1]Vikram Saraph:
Fault-Tolerant Distributed Computability. Brown University, USA, 2019 - [c4]Vikram Saraph, Maurice Herlihy:
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts. Tokenomics 2019: 4:1-4:15 - [i4]Vikram Saraph, Maurice Herlihy:
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts. CoRR abs/1901.01376 (2019) - 2018
- [j4]Julia F. Knight, Vikram Saraph
:
Scott sentences for certain groups. Arch. Math. Log. 57(3-4): 453-472 (2018) - [j3]Vikram Saraph, Maurice Herlihy, Eli Gafni:
An algorithmic approach to the asynchronous computability theorem. J. Appl. Comput. Topol. 1(3-4): 451-474 (2018) - [c3]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Vikram Saraph, Eric Koskinen:
Proof-Carrying Smart Contracts. Financial Cryptography Workshops 2018: 325-338 - 2017
- [i3]Vikram Saraph, Maurice Herlihy, Eli Gafni:
An Algorithmic Approach to the Asynchronous Computability Theorem. CoRR abs/1703.08525 (2017) - [i2]Archita Agarwal, Zhiyu Liu, Eli Rosenthal, Vikram Saraph:
Linearizable Iterators for Concurrent Data Structures. CoRR abs/1705.08885 (2017) - 2016
- [c2]Vikram Saraph, Maurice Herlihy, Eli Gafni:
Asynchronous Computability Theorems for t-Resilient Systems. DISC 2016: 428-441 - 2015
- [j2]Vipin Vijayan, Vikram Saraph, Tijana Milenkovic:
MAGNA++: Maximizing Accuracy in Global Network Alignment via both node and edge conservation. Bioinform. 31(14): 2409-2411 (2015) - [c1]Vikram Saraph, Maurice Herlihy:
The Relative Power of Composite Loop Agreement Tasks. OPODIS 2015: 13:1-13:16 - [i1]Maurice Herlihy, Vikram Saraph:
The Relative Power of Composite Loop Agreement Tasks. CoRR abs/1506.03506 (2015) - 2014
- [j1]Vikram Saraph, Tijana Milenkovic:
MAGNA: Maximizing Accuracy in Global Network Alignment. Bioinform. 30(20): 2931-2940 (2014)
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-05-14 20:30 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:
