No. Title Author Year
1 Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121) Gál, Anna et al. 2019
2 Computing Kernels in Parallel: Lower and Upper Bounds Bannach, Max et al. 2019
3 On the Descriptive Complexity of Color Coding Bannach, Max et al. 2019
4 Computing Hitting Set Kernels By AC^0-Circuits Bannach, Max et al. 2018
5 Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) Tantau, Till 2017
6 Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) Gál, Anna et al. 2017
7 Parallel Multivariate Meta-Theorems Bannach, Max et al. 2017
8 Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification Tantau, Till 2015
9 Fast Parallel Fixed-parameter Algorithms via Color Coding Bannach, Max et al. 2015
10 Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth Elberfeld, Michael et al. 2012
11 Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise Manthey, Bodo et al. 2007
12 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: 12


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