No. Title Author Year
1 On Complexity of 1-Center in Various Metrics Abboud, Amir et al. 2023
2 3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time Seddighin, Masoud et al. 2022
3 Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems Le Gall, François et al. 2022
4 Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence Cheng, Kuan et al. 2021
5 Greedy Algorithms for Online Survivable Network Design Dehghani, Sina et al. 2018
6 Stochastic k-Server: How Should Uber Work? Dehghani, Sina et al. 2017
7 Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering Dehghani, Sina et al. 2016
8 Price of Competition and Dueling Games Dehghani, Sina et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 8

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