BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × Italy
1 × Portugal
1 × Switzerland
2 × United Kingdom
3 × Germany
4 × USA
Collaborated with:
S.Porschen B.Randerath ∅ T.Schmidt P.Heusch R.Kemp A.Wotzlaw E.Boros P.L.Hammer A.Kogan K.Makino B.Simeone O.Cepek
Talks about:
problem (6) satisfi (4) linear (4) some (4) formula (3) complex (3) averag (3) time (3) sat (3) algorithm (2)

Person: Ewald Speckenmeyer

DBLP DBLP: Speckenmeyer:Ewald

Contributed to:

SAT 20112011
SAT 20102010
SAT 20092009
SAT 20082008
SAT 20072007
SAT 20062006
SAT 20042005
SAT 20032003
SAT 20022002
SAT 20012001
CSL 19911991
CSL 19891989
CSL 19881988
CSL 19871987

Wrote 14 papers:

SAT-2011-SpeckenmeyerWP #approach #graph #satisfiability
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (ES, AW, SP), pp. 134–144.
SAT-2010-PorschenSS #complexity #linear #problem
Complexity Results for Linear XSAT-Problems (SP, TS, ES), pp. 251–263.
SAT-2009-PorschenSS #aspect-oriented #on the
On Some Aspects of Mixed Horn Formulas (SP, TS, ES), pp. 86–100.
SAT-2008-PorschenS #linear
A CNF Class Generalizing Exact Linear Formulas (SP, ES), pp. 231–245.
SAT-2007-PorschenS #algorithm #problem #satisfiability
Algorithms for Variable-Weighted 2-SAT and Dual Problems (SP, ES), pp. 173–186.
SAT-2006-PorschenSR #linear #on the
On Linear CNF Formulas (SP, ES, BR), pp. 212–225.
SAT-J-2004-PorschenS05 #bound #problem
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.
SAT-2003-PorschenRS #algorithm #linear #problem #satisfiability
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
SAT-2002-PorschenRS #decidability #satisfiability
X3SAT is decidable in time O(2n/5) (SP, BR, ES), p. 10.
SAT-2001-RanderathSBHKMSC #graph #problem #satisfiability
A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.
CSL-1991-HeuschS #aspect-oriented #behaviour #probability
Some Aspects of the Probabilistic Behavior of Variants of Resolution (PH, ES), pp. 164–172.
CSL-1989-SpeckenmeyerK #clustering #complexity #on the #set
On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.
CSL-1988-Speckenmeyer #question
Is Average Superlinear Speedup Possible? (ES), pp. 301–312.
CSL-1987-Speckenmeyer #backtracking #complexity #on the #problem #satisfiability
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.