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


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