No. Title Author Year
1 Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs Lincoln, Andrea et al. 2020
2 Faster Random k-CNF Satisfiability Lincoln, Andrea et al. 2020
3 Monochromatic Triangles, Intermediate Matrix Products, and Convolutions Lincoln, Andrea et al. 2020
4 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
5 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
6 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 6


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