共 60 条
[1]
Alistarh D, 2015, ACM SIGPLAN NOTICES, V50, P11, DOI [10.1145/2858788.2688523, 10.1145/2688500.2688523]
[2]
Brief Announcement: Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures
[J].
PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20),
2020,
:503-505
[3]
Detectable Recovery of Lock-Free Data Structures
[J].
PPOPP'22: PROCEEDINGS OF THE 27TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING,
2022,
:262-277
[4]
ELPIS: Graph-Based Similarity Search for Scalable Data Science
[J].
PROCEEDINGS OF THE VLDB ENDOWMENT,
2023, 16 (06)
:1548-1559
[5]
Bagnall Anthony J., 2019, Dagstuhl Rep., V9, P24, DOI DOI 10.4230/DAGREP.9.7.24
[6]
Braginsky A., 2012, P ACM S PAR ALG ARCH, P58, DOI 10.1145/2312005.2312016
[7]
Brown T, 2014, ACM SIGPLAN NOTICES, V49, P329, DOI [10.1145/2555243.2555267, 10.1145/2692916.2555267]
[8]
Camerra A, 2014, KNOWL INF SYST, V39, P123, DOI 10.1007/s10115-012-0606-6
[9]
Efficient Lock-free Binary Search Trees
[J].
PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14),
2014,
:322-331
[10]
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search
[J].
PROCEEDINGS OF THE VLDB ENDOWMENT,
2023, 16 (05)
:1140-1153