4 Publications

Mark all

[4]
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee, Bapi, et al. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science, Elsevier, doi:10.1016/j.tcs.2021.06.041.
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” 35th International Symposium on Distributed Computing, vol. 209, 52, 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, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2019, pp. 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, Bapi, et al. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science, Elsevier, doi:10.1016/j.tcs.2021.06.041.
View | DOI | Download None (ext.)
 
[3]
2021 | Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” 35th International Symposium on Distributed Computing, vol. 209, 52, 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, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Conference Paper | IST-REx-ID: 7213 | OA
Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2019, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.
View | Files available | DOI
 

Search

Filter Publications