| 2014 | ISAIM | Probabilistic Analysis of Random Mixed Horn Formulas. | Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen |
| 2011 | SAT | A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. | Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen |
| 2010 | SAT | Complexity Results for Linear XSAT-Problems. | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2009 | SAT | On Some Aspects of Mixed Horn Formulas. | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2008 | SAT | A CNF Class Generalizing Exact Linear Formulas. | Stefan Porschen, Ewald Speckenmeyer |
| 2007 | SAT | Algorithms for Variable-Weighted 2-SAT and Dual Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2006 | SAT | On Linear CNF Formulas. | Stefan Porschen, Ewald Speckenmeyer, Bert Randerath |
| 2004 | SAT | Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2004 | SAT | Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2003 | SAT | Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer |
| 1991 | CSL | Some Aspects of the Probabilistic Behavior of Variants of Resolution. | Peter Heusch, Ewald Speckenmeyer |
| 1989 | CSL | On the Average Time Complexity of Set Partitioning. | Ewald Speckenmeyer, Rainer Kemp |
| 1989 | WG | On Feedback Problems in Diagraphs. | Ewald Speckenmeyer |
| 1988 | CSL | Is Average Superlinear Speedup Possible? | Ewald Speckenmeyer |
| 1988 | MFCS | Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. | Ewald Speckenmeyer |
| 1987 | CSL | On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. | Ewald Speckenmeyer |
| 1987 | ICS | Superlinear Speedup for Parallel Backtracking. | Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger |