No. Title Author Year
1 Monochromatic Triangles, Intermediate Matrix Products, and Convolutions Lincoln, Andrea et al. 2020
2 OV Graphs Are (Probably) Hard Instances Alman, Josh et al. 2020
3 Fine-grained Algorithms and Complexity Vassilevska Williams, Virginia 2018
4 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
5 Further Limitations of the Known Approaches for Matrix Multiplication Alman, Josh et al. 2018
6 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
7 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
8 Metatheorems for Dynamic Weighted Matching Stubbs, Daniel et al. 2017
9 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
10 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
11 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
12 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
13 Fine-Grained Algorithms and Complexity (Invited Talk) Vassilevska Williams, Virginia 2016
14 RNA-Folding - From Hardness to Algorithms (Invited Talk) Vassilevska Williams, Virginia 2016
15 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: 15


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