| 2011 | SODA | Randomized Variants of Johnson's Algorithm for MAX SAT. | Matthias Poloczek, Georg Schnitger |
| 2009 | STACS | Ambiguity and Communication. | Juraj Hromkovic, Georg Schnitger |
| 2008 | DLT | On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. | Juraj Hromkovic, Georg Schnitger |
| 2006 | STACS | Regular Expressions and NFAs Without | Georg Schnitger |
| 2005 | ICALP | NFAs With and Without | Juraj Hromkovic, Georg Schnitger |
| 2005 | STACS | Minimizing NFA's and Regular Expressions. | Gregor Gramlich, Georg Schnitger |
| 2003 | ICALP | Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. | Juraj Hromkovic, Georg Schnitger |
| 2003 | ICALP | Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. | Juraj Hromkovic, Georg Schnitger |
| 2001 | DLT | On the Power of Randomized Pushdown Automata. | Juraj Hromkovic, Georg Schnitger |
| 2001 | STACS | On Multipartition Communication Complexity. | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
| 2000 | ICALP | Measures of Nondeterminism in Finite Automata. | Juraj Hromkovic, Juhani Karhumki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
| 1999 | ICALP | On the Power of Las Vegas II. Two-Way Finite Automata. | Juraj Hromkovic, Georg Schnitger |
| 1998 | COLT | Neural Networks and Efficient Associative Memory. | Matthias Miltrup, Georg Schnitger |
| 1997 | MFCS | Communication Complexity and Sequential Compuation. | Juraj Hromkovic, Georg Schnitger |
| 1997 | STACS | 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 |
| 1996 | STOC | Nondeterministic Communication with a Limited Number of Advice Bits. | Juraj Hromkovic, Georg Schnitger |
| 1994 | MFCS | A Comparison of Two Lower Bound Methods for Communication Complexity. | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
| 1991 | FOCS | On the Computational Power of Sigmoid versus Boolean Threshold Circuits | Wolfgang Maass, Georg Schnitger, Eduardo D. Sontag |
| 1989 | STACS | On the Complexity of Approximating the Independent Set Problem. | Piotr Berman, Georg Schnitger |
| 1989 | STACS | Rounds versus Time for the Two Person Pebble Game (Extended Abstract). | Bala Kalyanasundaram, Georg Schnitger |
| 1989 | SPAA | The Communication Complexity of Several Problems in Matrix Computation. | Jeff I. Chu, Georg Schnitger |
| 1988 | STOC | On the Power of White Pebbles (Extended Abstract) | Bala Kalyanasundaram, Georg Schnitger |
| 1987 | ISMIS | Relating Boltzmann Machines to Conventional Models of Computation. | Ian Parberry, Georg Schnitger |
| 1987 | STOC | Two Tapes Are Better than One for Off-Line Turing Machines | Wolfgang Maass, Georg Schnitger, Endre Szemerdi |
| 1984 | STOC | Lower Bounds on Communication Complexity | Pavol Duris, Zvi Galil, Georg Schnitger |
| 1983 | FOCS | On Depth-Reduction and Grates | Georg Schnitger |
| 1982 | FOCS | Three Applications of Kolmogorov-Complexity | Stefan Reisch, Georg Schnitger |