共 50 条
- [21] Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time 2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 789 - 800
- [22] Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication Leibniz International Proceedings in Informatics, LIPIcs, 297
- [24] Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 205 - 218
- [25] Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
- [26] Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations 2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 898 - 909
- [27] A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1784 - 1797
- [28] Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1395 - 1411
- [29] Spectral Graph Sparsification in Nearly-Linear Time Leveraging Efficient Spectral Perturbation Analysis 2016 ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2016,