No. Title Author Year
1 Computing Hitting Set Kernels By AC^0-Circuits Bannach, Max et al. 2018
2 Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) Tantau, Till 2017
3 Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) Gál, Anna et al. 2017
4 Parallel Multivariate Meta-Theorems Bannach, Max et al. 2017
5 Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification Tantau, Till 2015
6 Fast Parallel Fixed-parameter Algorithms via Color Coding Bannach, Max et al. 2015
7 Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth Elberfeld, Michael et al. 2012
8 Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise Manthey, Bodo et al. 2007
9 Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space Jakoby, Andreas et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 9


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