5 Publications

Mark all

[5]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee, Bapi, Ivan Walulya, and Philippas Tsigas. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science. Elsevier, n.d. https://doi.org/10.1016/j.tcs.2021.06.041.
View | DOI | Download None (ext.)
 
[4]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.52.
View | Files available | DOI | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
View | Download Published Version (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” In ACM International Conference Proceeding Series, 168–77. ACM, 2019. https://doi.org/10.1145/3288599.3288617.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-36687-2_3.
View | Files available | DOI
 

Search

Filter Publications

5 Publications

Mark all

[5]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee, Bapi, Ivan Walulya, and Philippas Tsigas. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science. Elsevier, n.d. https://doi.org/10.1016/j.tcs.2021.06.041.
View | DOI | Download None (ext.)
 
[4]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.52.
View | Files available | DOI | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
View | Download Published Version (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” In ACM International Conference Proceeding Series, 168–77. ACM, 2019. https://doi.org/10.1145/3288599.3288617.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-36687-2_3.
View | Files available | DOI
 

Search

Filter Publications