No. Title Author Year
1 Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction Künnemann, Marvin et al. 2020
2 When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation Bringmann, Karl et al. 2020
3 A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties Bringmann, Karl et al. 2019
4 Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance Bringmann, Karl et al. 2019
5 On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress Künnemann, Marvin 2018
6 Tight Conditional Lower Bounds for Longest Common Increasing Subsequence Duraj, Lech et al. 2018
7 On the Fine-Grained Complexity of One-Dimensional Dynamic Programming Künnemann, Marvin et al. 2017
8 Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem Doerr, Benjamin et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 8


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