The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ewald Speckenmeyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Burkhard Monien, Ewald Speckenmeyer
    Some Further Approximation Algorithms for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:341-349 [Conf]
  2. Peter Heusch, Ewald Speckenmeyer
    Some Aspects of the Probabilistic Behavior of Variants of Resolution. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:164-172 [Conf]
  3. Ewald Speckenmeyer
    On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:281-288 [Conf]
  4. Ewald Speckenmeyer
    Is Average Superlinear Speedup Possible? [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:301-312 [Conf]
  5. Ewald Speckenmeyer, Rainer Kemp
    On the Average Time Complexity of Set Partitioning. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:369-381 [Conf]
  6. Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger
    Superlinear Speedup for Parallel Backtracking. [Citation Graph (0, 0)][DBLP]
    ICS, 1987, pp:985-993 [Conf]
  7. Ewald Speckenmeyer
    Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:529-538 [Conf]
  8. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:172-187 [Conf]
  9. Stefan Porschen, Ewald Speckenmeyer
    Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  10. Stefan Porschen, Ewald Speckenmeyer
    Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:251-262 [Conf]
  11. Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
    On Linear CNF Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:212-225 [Conf]
  12. Max Böhm, Ewald Speckenmeyer
    Parallele dynamische Spielbaumauswertung auf Transputern. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1990, pp:80-87 [Conf]
  13. Max Böhm, Ewald Speckenmeyer
    Ein paralleler SAT-Solver auf Transputern. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1992, pp:235-244 [Conf]
  14. Thomas Seifert, Ewald Speckenmeyer
    Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1990, pp:103-110 [Conf]
  15. Thomas Seifert, Ewald Speckenmeyer
    Zur Simulation von shared-memory auf Transputernetzwerken. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1992, pp:51-60 [Conf]
  16. Ewald Speckenmeyer
    On Feedback Problems in Diagraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:218-231 [Conf]
  17. Burkhard Monien, Ewald Speckenmeyer
    Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:1, pp:115-123 [Journal]
  18. Max Böhm, Ewald Speckenmeyer
    A Fast Parallel SAT-Solver - Efficient Workload Balancing. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:17, n:3-4, pp:381-400 [Journal]
  19. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Exact 3-satisfiability is decidable in time O(20.16254n). [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:173-193 [Journal]
  20. John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp
    Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:185-200 [Journal]
  21. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
    An Algorithm for the Class of Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:89-106 [Journal]
  22. Benno Schwikowski, Ewald Speckenmeyer
    On enumerating all minimal solutions of feedback problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:253-265 [Journal]
  23. Peter Heusch, Stefan Porschen, Ewald Speckenmeyer
    Improving a fixed parameter tractability time bound for the shadow problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:772-788 [Journal]
  24. Stefan Porschen, Ewald Speckenmeyer
    Algorithms for Variable-Weighted 2-SAT and Dual Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:173-186 [Conf]
  25. Stefan Porschen, Ewald Speckenmeyer
    Satisfiability of mixed Horn formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1408-1419 [Journal]

  26. On Some Aspects of Mixed Horn Formulas. [Citation Graph (, )][DBLP]


  27. A CNF Class Generalizing Exact Linear Formulas. [Citation Graph (, )][DBLP]


  28. Complexity Results for Linear XSAT-Problems. [Citation Graph (, )][DBLP]


  29. Linear CNF formulas and satisfiability. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002