5 Publications

Mark all

[5]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee, B., Walulya, I., & Tsigas, P. (n.d.). Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. Elsevier. 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, B., Peri, S., & Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.52
View | Files available | DOI | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.
View | Files available | Download Published Version (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM. https://doi.org/10.1145/3288599.3288617
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2019). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. 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, B., Walulya, I., & Tsigas, P. (n.d.). Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. Elsevier. 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, B., Peri, S., & Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.52
View | Files available | DOI | arXiv
 
[3]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.
View | Files available | Download Published Version (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM. https://doi.org/10.1145/3288599.3288617
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2019). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3
View | Files available | DOI
 

Search

Filter Publications