Bapi Chatterjee
Alistarh Group
6 Publications
2021 | Published | Conference Paper | IST-REx-ID: 11436 | 
V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in 35th AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9827 |
B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” Theoretical Computer Science, vol. 886. Elsevier, pp. 27–48, 2021.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10216 |
B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10432 |
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7213 |
S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 5947 |
B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Grants
6 Publications
2021 | Published | Conference Paper | IST-REx-ID: 11436 |
V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in 35th AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9827 |
B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” Theoretical Computer Science, vol. 886. Elsevier, pp. 27–48, 2021.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10216 |
B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10432 |
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7213 |
S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 5947 |
B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv