No. Title Author Year
1 An Efficient Algorithm for All-Pairs Bounded Edge Connectivity Akmal, Shyan et al. 2023
2 Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity Akmal, Shyan et al. 2022
3 An Improved Sketching Algorithm for Edit Distance Jin, Ce et al. 2021
4 Faster Algorithms for Bounded Tree Edit Distance Akmal, Shyan et al. 2021
5 Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond Ghaffari, Mohsen et al. 2020
6 An Improved FPTAS for 0-1 Knapsack Jin, Ce 2019
7 Faster Algorithms for All Pairs Non-Decreasing Paths Problem Duan, Ran et al. 2019
8 A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum Jin, Ce et al. 2018
9 Simulating Random Walks on Graphs in the Streaming Model Jin, Ce 2018
Current Page :
Number of result pages: 1
Number of documents: 9

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