4 Publications

Mark all

[4]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. doi:10.1016/j.tcs.2021.06.041
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52
View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi: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. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2019:27-39. doi:10.1007/978-3-030-36687-2_3
View | Files available | DOI
 

Search

Filter Publications

4 Publications

Mark all

[4]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. doi:10.1016/j.tcs.2021.06.041
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52
View | Files available | DOI | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi: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. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2019:27-39. doi:10.1007/978-3-030-36687-2_3
View | Files available | DOI
 

Search

Filter Publications