No. Title Author Year
1 Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time Gu, Yong et al. 2021
2 Hardness of KT Characterizes Parallel Cryptography Ren, Hanlin et al. 2021
3 Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time Ren, Hanlin 2020
4 Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time Duan, Ran et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI