4 Publications

Mark all

[4]
2021 | 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. Elsevier.
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
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.
View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
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, 2019, vol. 881, pp. 27–39.
View | Files available | DOI
 

Search

Filter Publications

4 Publications

Mark all

[4]
2021 | 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. Elsevier.
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
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.
View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
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, 2019, vol. 881, pp. 27–39.
View | Files available | DOI
 

Search

Filter Publications