Bapi Chatterjee

Alistarh Group

6 Publications

Mark all

[6]
2021 | Published | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press; 2021:8209-8216.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 9827 | OA
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 2021;886:27-48. doi:10.1016/j.tcs.2021.06.041
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. 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. doi:10.4230/LIPIcs.DISC.2021.52
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3
[Submitted Version] View | Files available | DOI | WoS
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


6 Publications

Mark all

[6]
2021 | Published | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press; 2021:8209-8216.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[5]
2021 | Published | Journal Article | IST-REx-ID: 9827 | OA
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 2021;886:27-48. doi:10.1016/j.tcs.2021.06.041
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. 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. doi:10.4230/LIPIcs.DISC.2021.52
[Published Version] View | Files available | DOI | arXiv
 
[3]
2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[2]
2020 | Published | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3
[Submitted Version] View | Files available | DOI | WoS
 
[1]
2019 | Published | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed