| 2016 | ESEM | Monitoring Software Quality by Means of Simulation Methods. | Daniel Honsel, Verena Honsel, Marlon Welter, Stephan Waack, Jens Grabowski |
| 2016 | EUMAS | Agent-Based Simulation for Software Development Processes. | Tobias Ahlbrecht, Jrgen Dix, Niklas Fiekas, Jens Grabowski, Verena Herbold, Daniel Honsel, Stephan Waack, Marlon Welter |
| 2011 | ICST | Improved Bug Reporting and Reproduction through Non-intrusive GUI Usage Monitoring and Automated Replaying. | Steffen Herbold, Jens Grabowski, Stephan Waack, Uwe Bnting |
| 2003 | ECCB | Gene prediction with a hidden Markov model and a new intron submodel. | Mario Stanke, Stephan Waack |
| 2003 | MFCS | Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. | Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 2001 | MFCS | Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. | Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 1998 | STACS | Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. | Jan Behrens, Stephan Waack |
| 1997 | STACS | On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. | Stephan Waack |
| 1996 | STACS | The "log Rank" Conjecture for Modular Communication Complexity. | Christoph Meinel, Stephan Waack |
| 1995 | LATIN | Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. | Christoph Meinel, Stephan Waack |
| 1995 | MFCS | Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. | Christoph Meinel, Stephan Waack |
| 1993 | ISAAC | Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. | Christoph Meinel, Stephan Waack |
| 1992 | STACS | Separating Counting Communication Complexity Classes. | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
| 1991 | FOCS | Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In | Matthias Krause, Stephan Waack |
| 1991 | MFCS | Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. | Christoph Meinel, Stephan Waack |
| 1990 | MFCS | The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). | Stephan Waack |
| 1989 | FCT | On Oblivious Branching Programs of Linear Length (Extended Abstract). | Matthias Krause, Stephan Waack |
| 1988 | MFCS | Separating the Eraser Turing Machine Classes L | Matthias Krause, Christoph Meinel, Stephan Waack |
| 1987 | FCT | Exponential Lower Bounds for Real-Time Branching Programs. | Klaus Kriegel, Stephan Waack |
| 1985 | FCT | Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). | Klaus Kriegel, Stephan Waack |
| 1981 | FCT | Tape Complexity of Word Problems. | Stephan Waack |