Ewald Speckenmeyer

Home * People * Ewald Speckenmeyer



Ewald Speckenmeyer, a German mathematician, computer scientist and professor at the University of Cologne. He holds a Ph.D. in Computer Science from Paderborn University, and his research interest include Operations Research, Boolean satisfiability problem, Horn-satisfiability, graph theory, parallel computing, and parallel search.

=Selected Publications=

1979

 * Burkhard Monien, Ewald Speckenmeyer (1979). 3-Satisfiability is Testable in O(1,62^r). Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 3

1980 ...

 * Ewald Speckenmeyer (1983). Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Universität-GH Paderborn, Ph.D. thesis, advisor Burkhard Monien (German)
 * Burkhard Monien, Ewald Speckenmeyer (1985). Solving Satisfiability in Less than 2n. Discrete Appl. Math., Vol. 10, No. 3
 * Oliver Vornberger, Burkhard Monien, Ewald Speckenmeyer (1986). Superlinear Speedup for Parallel Backtracking. Technical Report 30, Paderborn University
 * Ewald Speckenmeyer (1987). On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem. LNCS 329, Springer
 * Ewald Speckenmeyer (1988). On Feedback Vertex Sets and Nonseparating Independent Sets in Cubic Graphs. Journal of Graph Theory, Vol. 12, No. 3
 * Ewald Speckenmeyer (1988). On the Average Case Behavior of Backtracking for the Satisfiability and Exact Satisfiability Problem. Paderborn University, Habilitationsschrift, Reihe Informatik, Bericht Nr. 50
 * Ewald Speckenmeyer (1989). Is Average Superlinear Speedup Possible? LNCS 385, Springer

1990 ...

 * Max Böhm, Ewald Speckenmeyer (1990). A Dynamic Processor Tree for Solving Game Trees in Parallel. Methods of Operations Research, Vol. 63
 * Max Böhm, Ewald Speckenmeyer (1991). Parallele Dynamische Spielbaumauswertung auf Transputern. Parallele Datenverarbeitung mit dem Transputer. Informatik-Fachberichte (German), Springer
 * Max Böhm, Ewald Speckenmeyer (1992). Ein paralleler SAT-Solver auf Transputern. Transputer-Anwender-Treffen 1992: 235-244
 * Max Böhm, Ewald Speckenmeyer (1996). A fast parallel SAT-solver – efficient workload balancing. Annals of Mathematics and Artificial Intelligence, Vol. 17

2000 ...

 * Benno Schwikowski, Ewald Speckenmeyer (2002). On enumerating all minimal solutions of feedback problems. Discrete Applied Mathematics, Vol. 117
 * Stefan Porschen, Ewald Speckenmeyer (2004). Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. SAT 2004
 * Stefan Porschen, Ewald Speckenmeyer (2007). Satisfiability of mixed Horn formulas. Discrete Applied Mathematics, Vol. 155
 * Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer (2009). On Some Aspects of Mixed Horn Formulas. SAT 2009

2010 ...

 * Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer (2010). Complexity Results for Linear XSAT-Problems. SAT 2010

=External Links=
 * Lehrstuhl Prof. Dr. E. Speckenmeyer
 * The Mathematics Genealogy Project - Ewald Speckenmeyer
 * Ewald Speckenmeyer's tutorial

=References=

Up one level