Three Applications of Kolmogorov-Complexity - Stefan Reisch; Georg Schnitger (FOCS, 1982)

A Family of Graphs with Expensive Depth Reduction. - Georg Schnitger (Theor. Comput. Sci., 1982)

Elementare Analyse zweier probabilistischer Algorithmen und Tiefenreduktion azyklisch gerichteter Graphen. - Georg Schnitger (1982)

On Depth-Reduction and Grates - Georg Schnitger (FOCS, 1983)

An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. - Wolfgang Maass 001; Georg Schnitger (SCT, 1986)

Two Tapes Are Better than One for Off-Line Turing Machines - Wolfgang Maass 001; Georg Schnitger; Endre Szemerédi (STOC, 1987)

Lower Bounds on Communication Complexity - Pavol Duris; Zvi Galil; Georg Schnitger (Inf. Comput., 1987)

On the Power of White Pebbles (Extended Abstract) - Bala Kalyanasundaram; Georg Schnitger (STOC, 1988)

Parallel Computation with Threshold Functions. - Ian Parberry; Georg Schnitger (J. Comput. Syst. Sci., 1988)

Rounds versus Time for the Two Person Pebble Game (Extended Abstract). - Bala Kalyanasundaram; Georg Schnitger (STACS, 1989)

Relating Boltzmann machines to conventional models of computation. - Ian Parberry; Georg Schnitger (Neural Networks, 1989)

Rounds Versus Time for the Two Person Pebble Game - Bala Kalyanasundaram; Georg Schnitger (Inf. Comput., 1990)

On the Computational Power of Sigmoid versus Boolean Threshold Circuits - Wolfgang Maass 001; Georg Schnitger; Eduardo D. Sontag (FOCS, 1991)

On the power of white pebbles. - Bala Kalyanasundaram; Georg Schnitger (Comb., 1991)

The communication complexity of several problems in matrix computation. - Jeff I. Chu; Georg Schnitger (J. Complex., 1991)

The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. - Martin Dietzfelbinger; Wolfgang Maass 001; Georg Schnitger (Theor. Comput. Sci., 1991)

Communication Complexity and Lower Bounds for Sequential Computation. - Bala Kalyanasundaram; Georg Schnitger (Informatik, 1992)

The Power of Approximation: A Comparison of Activation Functions. - Bhaskar DasGupta; Georg Schnitger (NIPS, 1992)

The Probabilistic Communication Complexity of Set Intersection. - Bala Kalyanasundaram; Georg Schnitger (SIAM J. Discret. Math., 1992)

A note on the complexity of reliability in neural networks. - Piotr Berman; Ian Parberry; Georg Schnitger (IEEE Trans. Neural Networks, 1992)

On the Complexity of Approximating the Independent Set Problem - Piotr Berman; Georg Schnitger (Inf. Comput., 1992)

Two Tapes Versus One for Off-Line Turing Machines. - Wolfgang Maass 001; Georg Schnitger; Endre Szemerédi; György Turán (Comput. Complex., 1993)

Communication Complexity of Matrix Computation over Finite Fields. - Jeff I. Chu; Georg Schnitger (Math. Syst. Theory, 1995)

Analog versus discrete neural networks. - Bhaskar DasGupta; Georg Schnitger (Neural Comput., 1996)

A Comparison of Two Lower-Bound Methods for Communication Complexity. - Martin Dietzfelbinger; Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 1996)

Communication Complexity and Sequential Compuation. - Juraj Hromkovic; Georg Schnitger (MFCS, 1997)

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (STACS, 1997)

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (Electron. Colloquium Comput. Complex., 1997)

Neural Networks and Efficient Associative Memory. - Matthias Miltrup; Georg Schnitger (COLT, 1998)

Measures of Nondeterminism in Finite Automata - Juraj Hromkovic; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger; Sebastian Seibert (Electron. Colloquium Comput. Complex., 2000)

On the Power of Randomized Pushdown Automata. - Juraj Hromkovic; Georg Schnitger (Developments in Language Theory, 2001)

On Multi-Partition Communication Complexity of Triangle-Freeness - Stasys Jukna; Georg Schnitger (Electron. Colloquium Comput. Complex., 2001)

On Multipartition Communication Complexity - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (Electron. Colloquium Comput. Complex., 2001)

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. - Juraj Hromkovic; Georg Schnitger (Inf. Comput., 2001)

On the power of Las Vegas II: Two-way finite automata. - Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 2001)

Triangle-Freeness Is Hard To Detect. - Stasys Jukna; Georg Schnitger (Comb. Probab. Comput., 2002)

Communication Complexity Method for Measuring Nondeterminism in Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger (Inf. Comput., 2002)

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. - Juraj Hromkovic; Georg Schnitger (ICALP, 2003)

Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. - Juraj Hromkovic; Georg Schnitger (ICALP, 2003)

Nondeterministic Communication with a Limited Number of Advice Bits. - Juraj Hromkovic; Georg Schnitger (SIAM J. Comput., 2003)

On multi-partition communication complexity. - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (Inf. Comput., 2004)

Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. - Juraj Hromkovic; Georg Schnitger (DCFS, 2005)

NFAs With and Without epsilon-Transitions. - Juraj Hromkovic; Georg Schnitger (ICALP, 2005)

On the power of randomized multicounter machines. - Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 2005)

Regular Expressions and NFAs Without epsilon-Transitions. - Georg Schnitger (STACS, 2006)

On the Greedy Superstring Conjecture. - Maik Weinard; Georg Schnitger (SIAM J. Discret. Math., 2006)

Minimizing nfa's and regular expressions. - Gregor Gramlich; Georg Schnitger (J. Comput. Syst. Sci., 2007)

Comparing the size of NFAs with and without epsilon-transitions. - Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 2007)

08381 Abstracts Collection - Computational Complexity of Discrete Problems. - Peter Bro Miltersen; Rüdiger Reischuk; Georg Schnitger; Dieter van Melkebeek (Computational Complexity of Discrete Problems, 2008)

08381 Executive Summary - Computational Complexity of Discrete Problems. - Peter Bro Miltersen; Rüdiger Reischuk; Georg Schnitger; Dieter van Melkebeek (Computational Complexity of Discrete Problems, 2008)

On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. - Juraj Hromkovic; Georg Schnitger (Developments in Language Theory, 2008)

Lower Bounds on the Size of Sweeping Automata. - Juraj Hromkovic; Georg Schnitger (J. Autom. Lang. Comb., 2009)

On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. - Juraj Hromkovic; Holger Petersen 001; Georg Schnitger (Theor. Comput. Sci., 2009)

Circuits with arbitrary gates for random operators - Stasys Jukna; Georg Schnitger (CoRR, 2010)

On probabilistic pushdown automata. - Juraj Hromkovic; Georg Schnitger (Inf. Comput., 2010)

Randomized Variants of Johnson's Algorithm for MAX SAT. - Matthias Poloczek; Georg Schnitger (SODA, 2011)

Min-rank conjecture for log-depth circuits. - Stasys Jukna; Georg Schnitger (J. Comput. Syst. Sci., 2011)

Ambiguity and Communication. - Juraj Hromkovic; Georg Schnitger (Theory Comput. Syst., 2011)

Yet harder knapsack problems. - Stasys Jukna; Georg Schnitger (Theor. Comput. Sci., 2011)

Fast equality test for straight-line compressed strings. - Manfred Schmidt-Schauß; Georg Schnitger (Inf. Process. Lett., 2012)

Cutting planes cannot approximate some integer programs. - Stasys Jukna; Georg Schnitger (Oper. Res. Lett., 2012)

On the optimality of Bellman-Ford-Moore shortest path algorithm. - Stasys Jukna; Georg Schnitger (Theor. Comput. Sci., 2016)

Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. - Matthias Poloczek; Georg Schnitger; David P. Williamson; Anke van Zuylen (SIAM J. Comput., 2017)

Probabilism versus Alternation for Automata. - Georg Schnitger (Adventures Between Lower Bounds and Higher Altitudes, 2018)