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