No. Title Author Year
1 Membership Problems in Finite Groups Lohrey, Markus et al. 2022
2 Streaming Word Problems Lohrey, Markus et al. 2022
3 Subgroup Membership in GL(2,Z) Lohrey, Markus 2021
4 Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems Bartholdi, Laurent et al. 2020
5 Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups Lohrey, Markus et al. 2020
6 The Complexity of Knapsack Problems in Wreath Products Figelius, Michael et al. 2020
7 Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131) Diekert, Volker et al. 2019
8 Compressed Decision Problems in Hyperbolic Groups Holt, Derek et al. 2019
9 Sliding Window Property Testing for Regular Languages Ganardi, Moses et al. 2019
10 The Power Word Problem Lohrey, Markus et al. 2019
11 Automata Theory on Sliding Windows Ganardi, Moses et al. 2018
12 Average Case Analysis of Leaf-Centric Binary Tree Sources Seelbach Benkner, Louisa et al. 2018
13 Knapsack Problems for Wreath Products Ganardi, Moses et al. 2018
14 Randomized Sliding Window Algorithms for Regular Languages Ganardi, Moses et al. 2018
15 Sliding Windows over Context-Free Languages Ganardi, Moses et al. 2018
16 Circuit Evaluation for Finite Semirings Ganardi, Moses et al. 2017
17 Compression of Unordered XML Trees Lohrey, Markus et al. 2017
18 Computation over Compressed Structured Data (Dagstuhl Seminar 16431) Bille, Philip et al. 2017
19 Counting Problems for Parikh Images Haase, Christoph et al. 2017
20 The Complexity of Knapsack in Graph Groups Lohrey, Markus et al. 2017
21 Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products Lohrey, Markus et al. 2016
22 On the Parallel Complexity of Bisimulation on Finite Systems Ganardi, Moses et al. 2016
23 Querying Regular Languages over Sliding Windows Ganardi, Moses et al. 2016
24 Temporal Logics with Local Constraints (Invited Talk) Carapelle, Claudia et al. 2015
25 Approximation of smallest linear tree grammar Jez, Artur et al. 2014
26 Constructing Small Tree Grammars and Small Circuits for Formulas Hucke, Danny et al. 2014
27 On Boolean closed full trios and rational Kripke frames Lohrey, Markus et al. 2014
28 Compression of Rewriting Systems for Termination Analysis Bau, Alexander et al. 2013
29 The First-Order Theory of Ground Tree Rewrite Graphs Göller, Stefan et al. 2011
30 Branching-time Model Checking of One-counter Processes Göller, Stefan et al. 2010
Current Page :
Number of result pages: 2
Number of documents: 37


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