Georg Zetzsche

145 papers A* 24A 9B 11C 2Journal 81Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures. Proc. ACM Program. Lang. C. Aiswarya, Pascal Baumann, Prakash Saivasan, Lia Schütze, Georg Zetzsche
2026	—	`conf`	Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking). TACAS (1) Kilian Lichtner, Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2026	J	`jnl`	General Decidability Results for Systems with Continuous Counters. Proc. ACM Program. Lang. A. R. Balasubramanian, Matthew Hague, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2026	J	`jnl`	Length Generalization Bounds for Transformers. CoRR Andy Yang, Pascal Bergsträßer, Georg Zetzsche, David Chiang, Anthony W. Lin
2026	J	`jnl`	The complexity of downward closures of indexed languages. CoRR Richard Mandel, Corto Mascle, Georg Zetzsche
2025	A*	`conf`	A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. LICS Yousef Shakiba, Henry Sinclair-Banks, Georg Zetzsche
2025	J	`jnl`	A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. CoRR Yousef Shakiba, Henry Sinclair-Banks, Georg Zetzsche
2025	J	`jnl`	Bounded treewidth, multiple context-free grammars, and downward closures. CoRR C. Aiswarya, Pascal Baumann, Prakash Saivasan, Lia Schütze, Georg Zetzsche
2025	J	`jnl`	Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking). CoRR Kilian Lichtner, Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2025	J	`jnl`	General Decidability Results for Systems with Continuous Counters. CoRR A. R. Balasubramanian, Matthew Hague, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2025	J	`jnl`	NoPE: The Counting Power of Transformers with No Positional Encodings. CoRR Chris Köcher, Alexander Kozachinskiy, Anthony Widjaja Lin, Marco Sälzer, Georg Zetzsche
2025	A*	`conf`	Presburger Functional Synthesis: Complexity and Tractable Normal Forms. KR S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche
2025	J	`jnl`	Presburger Functional Synthesis: Complexity and Tractable Normal Forms. CoRR S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche
2025	J	`jnl`	Softmax Transformers are Turing-Complete. CoRR Hongjian Jiang, Michael Hahn, Georg Zetzsche, Anthony Widjaja Lin
2025	B	`conf`	The Complexity of Separability for Semilinear Sets and Parikh Automata. MFCS Elias Rojas Collins, Chris Köcher, Georg Zetzsche
2025	—	`conf`	Unboundedness Problems for Formal Languages (Invited Talk). FSTTCS Georg Zetzsche
2024	A*	`conf`	An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. ICALP Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche
2024	J	`jnl`	An efficient quantifier elimination procedure for Presburger arithmetic. CoRR Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche
2024	A	`conf`	Directed Regular and Context-Free Languages. STACS Moses Ganardi, Irmak Saglam, Georg Zetzsche
2024	J	`jnl`	Directed Regular and Context-Free Languages. CoRR Moses Ganardi, Irmak Saglam, Georg Zetzsche
2024	J	`jnl`	Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2024	J	`jnl`	Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2024	A*	`conf`	Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
2024	J	`jnl`	Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities. CoRR Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
2024	A*	`conf`	Slice closures of indexed languages and word equations with counting constraints. LICS Laura Ciobanu, Georg Zetzsche
2024	J	`jnl`	Slice closures of indexed languages and word equations with counting constraints. CoRR Laura Ciobanu, Georg Zetzsche
2024	J	`jnl`	The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective. CoRR Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche
2024	A*	`conf`	The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective. NeurIPS Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche
2024	J	`jnl`	The complexity of separability for semilinear sets and Parikh automata. CoRR Elias Rojas Collins, Chris Köcher, Georg Zetzsche
2024	A*	`conf`	Verifying Unboundedness via Amalgamation. LICS Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
2024	J	`jnl`	Verifying Unboundedness via Amalgamation. CoRR Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
2023	A*	`conf`	Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023	J	`jnl`	Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023	A*	`conf`	Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023	J	`jnl`	Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023	—	`conf`	Counter Machines with Infrequent Reversals. FSTTCS Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche
2023	J	`jnl`	Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
2023	J	`jnl`	Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. Moses Ganardi, Markus Lohrey, Georg Zetzsche
2023	B	`conf`	Monus Semantics in Vector Addition Systems with States. CONCUR Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023	J	`jnl`	Monus semantics in vector addition systems with states. CoRR Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023	B	`conf`	Priority Downward Closures. CONCUR Ashwani Anand, Georg Zetzsche
2023	J	`jnl`	Priority Downward Closures. CoRR Ashwani Anand, Georg Zetzsche
2023	J	`jnl`	Ramsey Quantifiers in Linear Arithmetics. CoRR Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2023	J	`jnl`	Reachability in Continuous Pushdown VASS. CoRR A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023	A	`conf`	Regular Separability in Büchi VASS. STACS Pascal Baumann, Roland Meyer, Georg Zetzsche
2023	J	`jnl`	Regular Separability in Büchi VASS. CoRR Pascal Baumann, Roland Meyer, Georg Zetzsche
2023	—	`conf`	Regular Separators for VASS Coverability Languages. FSTTCS Chris Köcher, Georg Zetzsche
2023	B	`conf`	Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
2023	J	`jnl`	Unboundedness problems for machines with reversal-bounded counters. CoRR Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
2022	J	`jnl`	Context-bounded verification of thread pools. Proc. ACM Program. Lang. Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2022	A	`conf`	Existential Definability over the Subword Ordering. STACS Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
2022	J	`jnl`	Existential Definability over the Subword Ordering. CoRR Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
2022	J	`jnl`	General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. Log. Methods Comput. Sci. Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2022	B	`conf`	Membership Problems in Finite Groups. MFCS Markus Lohrey, Andreas Rosowski, Georg Zetzsche
2022	J	`jnl`	Membership Problems in Finite Groups. CoRR Markus Lohrey, Andreas Rosowski, Georg Zetzsche
2022	A*	`conf`	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2022	J	`jnl`	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
2022	—	`ed.`	Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings RP Anthony W. Lin, Georg Zetzsche, Igor Potapov
2022	A*	`conf`	Reachability in Bidirected Pushdown VASS. ICALP Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
2022	J	`jnl`	Reachability in Bidirected Pushdown VASS. CoRR Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
2022	A*	`conf`	The Complexity of Bidirected Reachability in Valence Systems. LICS Moses Ganardi, Rupak Majumdar, Georg Zetzsche
2021	A	`conf`	A Characterization of Wreath Products Where Knapsack Is Decidable. STACS Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche
2021	J	`jnl`	Context-Bounded Verification of Thread Pools. CoRR Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2021	J	`jnl`	Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proc. ACM Program. Lang. Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2021	—	`conf`	General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. TACAS (1) Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2021	J	`jnl`	General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. CoRR Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2021	—	`conf`	Recent Advances on Reachability Problems for Valence Systems (Invited Talk). RP Georg Zetzsche
2021	B	`conf`	Scope-Bounded Reachability in Valence Systems. CONCUR Aneesh K. Shetty, S. Krishna, Georg Zetzsche
2021	J	`jnl`	Scope-Bounded Reachability in Valence Systems. CoRR Aneesh K. Shetty, S. Krishna, Georg Zetzsche
2021	J	`jnl`	The complexity of bidirected reachability in valence systems. CoRR Moses Ganardi, Rupak Majumdar, Georg Zetzsche
2021	J	`jnl`	The emptiness problem for valence automata over graph monoids. Inf. Comput. Georg Zetzsche
2020	A*	`conf`	An Approach to Regular Separability in Vector Addition Systems. LICS Wojciech Czerwinski, Georg Zetzsche
2020	J	`jnl`	An Approach to Regular Separability in Vector Addition Systems. CoRR Wojciech Czerwinski, Georg Zetzsche
2020	J	`jnl`	Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs. CoRR Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2020	A*	`conf`	Extensions of ω-Regular Languages. LICS Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
2020	J	`jnl`	Extensions of ω-Regular Languages. CoRR Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
2020	B	`conf`	Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. MFCS Markus Lohrey, Georg Zetzsche
2020	A*	`conf`	Rational Subsets of Baumslag-Solitar Groups. ICALP Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
2020	J	`jnl`	Rational subsets of Baumslag-Solitar groups. CoRR Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
2020	A*	`conf`	The Complexity of Bounded Context Switching with Dynamic Thread Creation. ICALP Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2020	A*	`conf`	The Complexity of Knapsack Problems in Wreath Products. ICALP Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
2020	J	`jnl`	The complexity of bounded context switching with dynamic thread creation. CoRR Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2020	J	`jnl`	The complexity of knapsack problems in wreath products. CoRR Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
2019	—	`conf`	Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP Sylvain Schmitz, Georg Zetzsche
2019	J	`jnl`	Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. CoRR Sylvain Schmitz, Georg Zetzsche
2019	B	`conf`	Languages Ordered by the Subword Order. FoSSaCS Dietrich Kuske, Georg Zetzsche
2019	J	`jnl`	Languages ordered by the subword order. CoRR Dietrich Kuske, Georg Zetzsche
2019	A*	`conf`	Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. LICS Christoph Haase, Georg Zetzsche
2019	—	`conf`	Regular Separability and Intersection Emptiness Are Independent Problems. FSTTCS Ramanathan S. Thinniyam, Georg Zetzsche
2019	J	`jnl`	Regular Separability and Intersection Emptiness are Independent Problems. CoRR Ramanathan S. Thinniyam, Georg Zetzsche
2018	B	`conf`	Bounded Context Switching for Valence Systems. CONCUR Roland Meyer, Sebastian Muskalla, Georg Zetzsche
2018	J	`jnl`	Bounded Context Switching for Valence Systems. CoRR Roland Meyer, Sebastian Muskalla, Georg Zetzsche
2018	A	`conf`	Knapsack Problems for Wreath Products. STACS Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
2018	J	`jnl`	Knapsack in Graph Groups. Theory Comput. Syst. Markus Lohrey, Georg Zetzsche
2018	J	`jnl`	PTL-separability and closures for WQOs on words. CoRR Georg Zetzsche
2018	A*	`conf`	Separability by piecewise testable languages and downward closures beyond subwords. LICS Georg Zetzsche
2018	A*	`conf`	Unboundedness Problems for Languages of Vector Addition Systems. ICALP Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
2018	J	`jnl`	Unboundedness problems for languages of vector addition systems. CoRR Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
2017	J	`jnl`	A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
2017	J	`jnl`	Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering. CoRR Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2017	A*	`conf`	Decidability, complexity, and expressiveness of first-order logic over the subword ordering. LICS Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2017	J	`jnl`	Knapsack Problems for Wreath Products. CoRR Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
2017	J	`jnl`	On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. Georg Zetzsche, Dietrich Kuske, Markus Lohrey
2017	A	`conf`	The Complexity of Knapsack in Graph Groups. STACS Markus Lohrey, Georg Zetzsche
2017	J	`jnl`	The Emptiness Problem for Valence Automata over Graph Monoids. CoRR Georg Zetzsche
2016	J	`jnl`	Complexity of regular abstractions of one-counter languages. CoRR Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
2016	A*	`conf`	First-order logic with reachability for infinite-state systems. LICS Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche
2016	—	`conf`	Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. AMS-EMS-SPM Joint Meeting Daniel König, Markus Lohrey, Georg Zetzsche
2016	A	`conf`	Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. STACS Markus Lohrey, Georg Zetzsche
2016	J	`jnl`	Monoids as Storage Mechanisms. Bull. EATCS Georg Zetzsche
2016	—	`—`	Monoids as Storage Mechanisms. Georg Zetzsche
2016	J	`jnl`	Permutations of context-free, ET0L and indexed languages. CoRR Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche
2016	J	`jnl`	Permutations of context-free, ET0L and indexed languages. Discret. Math. Theor. Comput. Sci. Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche
2016	A*	`conf`	The Complexity of Downward Closure Comparisons. ICALP Georg Zetzsche
2016	J	`jnl`	The Complexity of Knapsack in Graph Groups. CoRR Markus Lohrey, Georg Zetzsche
2016	J	`jnl`	The complexity of downward closure comparisons. CoRR Georg Zetzsche
2016	A*	`conf`	The complexity of regular abstractions of one-counter languages. LICS Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
2015	—	`conf`	An Approach to Computing Downward Closures. ICALP (2) Georg Zetzsche
2015	J	`jnl`	An approach to computing downward closures. CoRR Georg Zetzsche
2015	A	`conf`	Computing Downward Closures for Stacked Counter Automata. STACS Georg Zetzsche
2015	J	`jnl`	Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. CoRR Daniel König, Markus Lohrey, Georg Zetzsche
2015	J	`jnl`	Knapsack in graph groups, HNN-extensions and amalgamated products. CoRR Markus Lohrey, Georg Zetzsche
2015	J	`jnl`	Rational subsets and submonoids of wreath products. Inf. Comput. Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2015	—	`conf`	The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets. RP Georg Zetzsche
2014	J	`jnl`	Computing downward closures for stacked counter automata. CoRR Georg Zetzsche
2014	A	`conf`	On Boolean closed full trios and rational Kripke frames. STACS Markus Lohrey, Georg Zetzsche
2014	—	`conf`	The Monoid of Queue Actions. MFCS (1) Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
2014	J	`jnl`	The monoid of queue actions. CoRR Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
2013	J	`jnl`	Rational Subsets and Submonoids of Wreath Products CoRR Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2013	—	`conf`	Rational Subsets and Submonoids of Wreath Products. ICALP (2) Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
2013	B	`conf`	Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. MFCS P. Buckheister, Georg Zetzsche
2013	J	`jnl`	Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. CoRR P. Buckheister, Georg Zetzsche
2013	J	`jnl`	Silent Transitions in Automata with Storage CoRR Georg Zetzsche
2013	—	`conf`	Silent Transitions in Automata with Storage. ICALP (2) Georg Zetzsche
2011	C	`conf`	A Sufficient Condition for Erasing Productions to Be Avoidable. Developments in Language Theory Georg Zetzsche
2011	—	`conf`	On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. ICALP (2) Georg Zetzsche
2011	J	`jnl`	On the capabilities of grammars, automata, and transducers controlled by monoids CoRR Georg Zetzsche
2011	J	`jnl`	Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars. Int. J. Found. Comput. Sci. Georg Zetzsche
2010	—	`conf`	On Erasing Productions in Random Context Grammars. ICALP (2) Georg Zetzsche
2009	C	`conf`	Erasing in Petri Net Languages and Matrix Grammars. Developments in Language Theory Georg Zetzsche
2009	J	`jnl`	Multiset Pushdown Automata. Fundam. Informaticae Manfred Kudlek, Patrick Totzke, Georg Zetzsche
2009	J	`jnl`	Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. Fundam. Informaticae Manfred Kudlek, Patrick Totzke, Georg Zetzsche
2008	B	`conf`	Labeled Step Sequences in Petri Nets. Petri Nets Matthias Jantzen, Georg Zetzsche
2008	J	`jnl`	Language Classes Defined by Concurrent Finite Automata. Fundam. Informaticae Matthias Jantzen, Manfred Kudlek, Georg Zetzsche
2008	J	`jnl`	Petri Net Controlled Finite Automata. Fundam. Informaticae Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, Georg Zetzsche