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 the University of Paderborn, and his research interest covers Operations Research, Boolean satisfiability problem, Horn-satisfiability, Graph theory and Parallel Search.
Ewald Speckenmeyer ^[1]

Selected Publications

^[2] ^[3]

1979

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

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. North-Holland Publishing Company, Discrete Appl. Math., Vol. 10, No. 3, 287-295
Oliver Vornberger, Burkhard Monien, Ewald Speckenmeyer (1986). Superlinear Speedup for Parallel Backtracking. Technical Report 30, University of Paderborn
Ewald Speckenmeyer (1987). On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem. Proc. Computer Science Logic 1987 (CSL '87), Springer Verlag (LNCS 329), 281-288
Ewald Speckenmeyer (1988). On Feedback Vertex Sets and Nonseparating Independent Sets in Cubic Graphs. J. Graph Theory, Vol. 12, No. 3, 405-412
Ewald Speckenmeyer (1988). On the Average Case Behavior of Backtracking for the Satisfiability and Exact Satisfiability Problem. University of Paderborn, Habilitationsschrift, Reihe Informatik, Bericht Nr. 50
Ewald Speckenmeyer (1989). Is Average Superlinear Speedup Possible? Proc. Computer Science Logic 1988 (CSL '88), Springer Verlag (LNCS 385), 301-312

Max Böhm, Ewald Speckenmeyer (1990). A Dynamic Processor Tree for Solving Game Trees in Parallel. Methods of Operations Research, Vol. 63, 479-489
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 17, 381–400.

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

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

Up one level