6 Publications

Mark all

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

Search

Filter Publications

6 Publications

Mark all

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

Search

Filter Publications