No. Title Author Year
1 Fine-grained Algorithms and Complexity Vassilevska Williams, Virginia 2018
2 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
3 Further Limitations of the Known Approaches for Matrix Multiplication Alman, Josh et al. 2018
4 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
5 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
6 Metatheorems for Dynamic Weighted Matching Stubbs, Daniel et al. 2017
7 Preserving Distances in Very Faulty Graphs Bodwin, Greg et al. 2017
8 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
9 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
10 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 13

DROPS-Home | Fulltext Search | Imprint Published by LZI