default search action
Bapi Chatterjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Bapi Chatterjee
:
Distributed Machine Learning. ICDCN 2024: 4-7 - [c19]Bapi Chatterjee, Vyacheslav Kungurtsev, Dan Alistarh:
Federated SGD with Local Asynchrony. ICDCS 2024: 857-868 - [c18]Gaurav Bhardwaj
Kanva: A Lock-free Learned Search Data Structure. ICPP 2024: 252-261 - [c17]Gaurav Bhardwaj
Brief Announcement: Lock-free Learned Search Data Structure. SPAA 2024: 65-67 - [i11]Vyacheslav Kungurtsev, Apaar, Aarya Khandelwal, Parth Sandeep Rastogi, Bapi Chatterjee, Jakub Marecek:
Empirical Bayes for Dynamic Bayesian Networks Using Generalized Variational Inference. CoRR abs/2406.17831 (2024) - [i10]Geetika, Drishya Uniyal, Bapi Chatterjee:
Towards Hyper-parameter-free Federated Learning. CoRR abs/2408.17145 (2024) - 2023
- [c16]Gaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri:
Wait-Free Updates and Range Search Using Uruv. SSS 2023: 435-450 - [i9]Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee, Sathya Peri:
Wait-Free Updates and Range Search using Uruv. CoRR abs/2307.14744 (2023) - [i8]Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak:
Learned Lock-free Search Data Structures. CoRR abs/2308.11205 (2023) - 2022
- [i7]Bapi Chatterjee, Vyacheslav Kungurtsev
Scaling the Wild: Decentralizing Hogwild!-style Shared-memory SGD. CoRR abs/2203.06638 (2022) - 2021
- [j1]Bapi Chatterjee
Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theor. Comput. Sci. 886: 27-48 (2021) - [c15]Vyacheslav Kungurtsev, Malcolm Egan, Bapi Chatterjee, Dan Alistarh:
Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees. AAAI 2021: 8209-8216 - [c14]Giorgi Nadiradze, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, Dan Alistarh:
Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent. AAAI 2021: 9037-9045 - [c13]Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Komma Manogna:
Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. OPODIS 2021: 20:1-20:25 - [c12]Bapi Chatterjee
Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. DISC 2021: 52:1-52:4 - 2020
- [i6]Dan Alistarh, Bapi Chatterjee, Vyacheslav Kungurtsev:
Elastic Consistency: A General Consistency Model for Distributed Stochastic Gradient Descent. CoRR abs/2001.05918 (2020) - [i5]Bapi Chatterjee, Sathya Peri, Muktikanta Sa:
Dynamic Graph Operations: A Consistent Non-blocking Approach. CoRR abs/2003.01697 (2020) - [i4]Vyacheslav Kungurtsev, Bapi Chatterjee, Dan Alistarh:
Stochastic Gradient Langevin with Delayed Gradients. CoRR abs/2006.07362 (2020)
2010 – 2019
- 2019
- [c11]Sumit Bhatia
A Persistent Homology Perspective to the Link Prediction Problem. COMPLEX NETWORKS (1) 2019: 27-39 - [c10]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 - 2018
- [c9]Bapi Chatterjee, Ivan Walulya, Philippas Tsigas
Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree. ICDCN 2018: 11:1-11:10 - [c8]Himanshu Gupta, Sandeep Hans, Kushagra Aggarwal, Sameep Mehta, Bapi Chatterjee, Praveen Jayachandran:
Efficiently Processing Temporal Queries on Hyperledger Fabric. ICDE 2018: 1489-1494 - [c7]Ivan Walulya, Bapi Chatterjee, Ajoy K. Datta, Rashmi Niyolia, Philippas Tsigas:
Concurrent Lock-Free Unbounded Priority Queue with Mutable Priorities. SSS 2018: 365-380 - [i3]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) - [i2]Sumit Bhatia, Bapi Chatterjee, Deepak Nathani, Manohar Kaul
Understanding and Predicting Links in Graphs: A Persistent Homology Perspective. CoRR abs/1811.04049 (2018) - 2017
- [c6]Himanshu Gupta, Sameep Mehta, Sandeep Hans, Bapi Chatterjee, Pranay Lohia, Rajmohan C:
Provenance in Context of Hadoop as a Service (HaaS) - State of the Art and Research Directions. CLOUD 2017: 680-683 - [c5]Bapi Chatterjee:
Lock-free Linearizable 1-Dimensional Range Queries. ICDCN 2017: 9 - 2016
- [c4]Bapi Chatterjee, Ivan Walulya, Philippas Tsigas
Help-Optimal and Language-Portable Lock-Free Concurrent Data Structures. ICPP 2016: 360-369 - 2014
- [c3]Bapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas
Efficient lock-free binary search trees. PODC 2014: 322-331 - [i1]Bapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas:
Efficient Lock-free Binary Search Trees. CoRR abs/1404.3272 (2014) - 2013
- [c2]Daniel Cederman, Bapi Chatterjee, Nhan Nguyen Dang, Yiannis Nikolakopoulos, Marina Papatriantafilou
A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems. IPDPS 2013: 1309-1320 - 2012
- [c1]Daniel Cederman, Bapi Chatterjee, Philippas Tsigas
Understanding the Performance of Concurrent Data Structures on Graphics Processors. Euro-Par 2012: 883-894
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-09 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: