No. Title Author Year
1 Dynamic Matching Algorithms Under Vertex Updates Le, Hung et al. 2022
2 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk) Vassilevska Williams, Virginia 2021
3 Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths Chan, Timothy M. et al. 2021
4 Distributed Distance Approximation Ancona, Bertie et al. 2021
5 Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths Gu, Yuzhou et al. 2021
6 Fine-Grained Hardness for Edit Distance to a Fixed Sequence Abboud, Amir et al. 2021
7 Improved Approximation for Longest Common Subsequence over Small Alphabets Akmal, Shyan et al. 2021
8 Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph Dalirrooyfard, Mina et al. 2020
9 Monochromatic Triangles, Intermediate Matrix Products, and Convolutions Lincoln, Andrea et al. 2020
10 OV Graphs Are (Probably) Hard Instances Alman, Josh et al. 2020
11 Towards Optimal Set-Disjointness and Set-Intersection Data Structures Kopelowitz, Tsvi et al. 2020
12 Fine-grained Algorithms and Complexity Vassilevska Williams, Virginia 2018
13 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
14 Further Limitations of the Known Approaches for Matrix Multiplication Alman, Josh et al. 2018
15 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
16 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
17 Metatheorems for Dynamic Weighted Matching Stubbs, Daniel et al. 2017
18 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
19 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
20 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
21 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
22 Fine-Grained Algorithms and Complexity (Invited Talk) Vassilevska Williams, Virginia 2016
23 RNA-Folding - From Hardness to Algorithms (Invited Talk) Vassilevska Williams, Virginia 2016
24 Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) Vassilevska Williams, Virginia 2015
Current Page :
Number of result pages: 1
Number of documents: 24

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