25,161
edits
Changes
Created page with "'''Home * People * Ewald Speckenmeyer''' FILE:EwaldSpeckenmeyer.jpg|border|right|thumb|link=http://scale.uni-koeln.de/15674.html?&L=0| Ewald Speckenmeyer..."
'''[[Main Page|Home]] * [[People]] * Ewald Speckenmeyer'''
[[FILE:EwaldSpeckenmeyer.jpg|border|right|thumb|link=http://scale.uni-koeln.de/15674.html?&L=0| Ewald Speckenmeyer <ref>[http://scale.uni-koeln.de/15674.html?&L=0 Lehrstuhl Prof. Dr. E. Speckenmeyer]</ref> ]]
'''Ewald Speckenmeyer''',<br/>
a German mathematician, computer scientist and professor at the [https://en.wikipedia.org/wiki/University_of_Cologne University of Cologne]. He holds a Ph.D. in Computer Science from [[Paderborn University]], and his research interest include [https://en.wikipedia.org/wiki/Operations_research Operations Research], [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem Boolean satisfiability problem], [https://en.wikipedia.org/wiki/Horn-satisfiability Horn-satisfiability], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], and [[Parallel Search|parallel search]].
=Selected Publications=
<ref>[http://scale.uni-koeln.de/15387.html?&L=0 Publikationen - Lehrstuhl Prof. Dr. E. Speckenmeyer]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/s/Speckenmeyer:Ewald dblp: Ewald Speckenmeyer]</ref>
==1979==
* [[Burkhard Monien]], [[Ewald Speckenmeyer]] ('''1979'''). ''3-Satisfiability is Testable in O(1,62^r)''. [[Paderborn University|Universität-GH Paderborn]], Reihe Informatik, Bericht Nr. 3
==1980 ...==
* [[Ewald Speckenmeyer]] ('''1983'''). ''Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen''. [[Paderborn University|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''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 329, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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?'' [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 385, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-76602-2_12 Parallele Dynamische Spielbaumauswertung auf Transputern]''. Parallele Datenverarbeitung mit dem Transputer. Informatik-Fachberichte (German), [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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''. [https://link.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 17
==2000 ...==
* [http://www.proteomics.fr/Sysbio/People/Benno_Schwikowski Benno Schwikowski], [[Ewald Speckenmeyer]] ('''2002'''). ''On enumerating all minimal solutions of feedback problems''. [http://www.journals.elsevier.com/discrete-applied-mathematics/ Discrete Applied Mathematics], Vol. 117
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [[Ewald Speckenmeyer]] ('''2004'''). ''Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2004.html#PorschenS04 SAT 2004]
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [[Ewald Speckenmeyer]] ('''2007'''). ''Satisfiability of mixed Horn formulas''. [http://www.journals.elsevier.com/discrete-applied-mathematics/ Discrete Applied Mathematics], Vol. 155
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Schmidt:Tatjana.html Tatjana Schmidt], [[Ewald Speckenmeyer]] ('''2009'''). ''On Some Aspects of Mixed Horn Formulas''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2009.html#PorschenSS09 SAT 2009]
==2010 ...==
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Schmidt:Tatjana.html Tatjana Schmidt], [[Ewald Speckenmeyer]] ('''2010'''). ''Complexity Results for Linear XSAT-Problems''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2010.html#PorschenSS10 SAT 2010]
=External Links=
* [http://scale.uni-koeln.de/15674.html?&L=0 Lehrstuhl Prof. Dr. E. Speckenmeyer]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=129980 The Mathematics Genealogy Project - Ewald Speckenmeyer]
* [http://rutcor.rutgers.edu/~boros/LSDO/EwaldSpeckenmeyer.html Ewald Speckenmeyer's tutorial]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:EwaldSpeckenmeyer.jpg|border|right|thumb|link=http://scale.uni-koeln.de/15674.html?&L=0| Ewald Speckenmeyer <ref>[http://scale.uni-koeln.de/15674.html?&L=0 Lehrstuhl Prof. Dr. E. Speckenmeyer]</ref> ]]
'''Ewald Speckenmeyer''',<br/>
a German mathematician, computer scientist and professor at the [https://en.wikipedia.org/wiki/University_of_Cologne University of Cologne]. He holds a Ph.D. in Computer Science from [[Paderborn University]], and his research interest include [https://en.wikipedia.org/wiki/Operations_research Operations Research], [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem Boolean satisfiability problem], [https://en.wikipedia.org/wiki/Horn-satisfiability Horn-satisfiability], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Parallel_computing parallel computing], and [[Parallel Search|parallel search]].
=Selected Publications=
<ref>[http://scale.uni-koeln.de/15387.html?&L=0 Publikationen - Lehrstuhl Prof. Dr. E. Speckenmeyer]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/s/Speckenmeyer:Ewald dblp: Ewald Speckenmeyer]</ref>
==1979==
* [[Burkhard Monien]], [[Ewald Speckenmeyer]] ('''1979'''). ''3-Satisfiability is Testable in O(1,62^r)''. [[Paderborn University|Universität-GH Paderborn]], Reihe Informatik, Bericht Nr. 3
==1980 ...==
* [[Ewald Speckenmeyer]] ('''1983'''). ''Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen''. [[Paderborn University|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''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 329, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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?'' [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 385, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-76602-2_12 Parallele Dynamische Spielbaumauswertung auf Transputern]''. Parallele Datenverarbeitung mit dem Transputer. Informatik-Fachberichte (German), [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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''. [https://link.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 17
==2000 ...==
* [http://www.proteomics.fr/Sysbio/People/Benno_Schwikowski Benno Schwikowski], [[Ewald Speckenmeyer]] ('''2002'''). ''On enumerating all minimal solutions of feedback problems''. [http://www.journals.elsevier.com/discrete-applied-mathematics/ Discrete Applied Mathematics], Vol. 117
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [[Ewald Speckenmeyer]] ('''2004'''). ''Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2004.html#PorschenS04 SAT 2004]
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [[Ewald Speckenmeyer]] ('''2007'''). ''Satisfiability of mixed Horn formulas''. [http://www.journals.elsevier.com/discrete-applied-mathematics/ Discrete Applied Mathematics], Vol. 155
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Schmidt:Tatjana.html Tatjana Schmidt], [[Ewald Speckenmeyer]] ('''2009'''). ''On Some Aspects of Mixed Horn Formulas''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2009.html#PorschenSS09 SAT 2009]
==2010 ...==
* [http://www.htw-berlin.de/organisation/?typo3state=persons&lsfid=4594 Stefan Porschen], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Schmidt:Tatjana.html Tatjana Schmidt], [[Ewald Speckenmeyer]] ('''2010'''). ''Complexity Results for Linear XSAT-Problems''. [http://www.informatik.uni-trier.de/~ley/db/conf/sat/sat2010.html#PorschenSS10 SAT 2010]
=External Links=
* [http://scale.uni-koeln.de/15674.html?&L=0 Lehrstuhl Prof. Dr. E. Speckenmeyer]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=129980 The Mathematics Genealogy Project - Ewald Speckenmeyer]
* [http://rutcor.rutgers.edu/~boros/LSDO/EwaldSpeckenmeyer.html Ewald Speckenmeyer's tutorial]
=References=
<references />
'''[[People|Up one level]]'''
