3 Publications

Mark all

[3]
2021 | Journal Article | IST-REx-ID: 9827
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science (n.d.).
View | DOI | Download None (ext.)
 
[2]
2019 | 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, 2019, pp. 27–39.
View | Files available | DOI
 
[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.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

3 Publications

Mark all

[3]
2021 | Journal Article | IST-REx-ID: 9827
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science (n.d.).
View | DOI | Download None (ext.)
 
[2]
2019 | 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, 2019, pp. 27–39.
View | Files available | DOI
 
[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.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications