The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephan Waack: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephan Waack
    On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:35-44 [Conf]
  2. Matthias Krause, Christoph Meinel, Stephan Waack
    Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:240-249 [Conf]
  3. Christoph Meinel, Stephan Waack
    Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:273-290 [Conf]
  4. Mario Stanke, Stephan Waack
    Gene prediction with a hidden Markov model and a new intron submodel. [Citation Graph (0, 0)][DBLP]
    ECCB, 2003, pp:215-225 [Conf]
  5. Matthias Krause, Stephan Waack
    On Oblivious Branching Programs of Linear Length (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:287-296 [Conf]
  6. Klaus Kriegel, Stephan Waack
    Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:227-233 [Conf]
  7. Klaus Kriegel, Stephan Waack
    Exponential Lower Bounds for Real-Time Branching Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:263-267 [Conf]
  8. Stephan Waack
    Tape Complexity of Word Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:467-471 [Conf]
  9. Matthias Krause, Stephan Waack
    Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:777-782 [Conf]
  10. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:287-292 [Conf]
  11. Beate Bollig, Stephan Waack, Philipp Woelfel
    Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:83-94 [Conf]
  12. Christoph Meinel, Stephan Waack
    Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:379-388 [Conf]
  13. Christoph Meinel, Stephan Waack
    Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:427-435 [Conf]
  14. Henrik Brosenne, Matthias Homeister, Stephan Waack
    Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:212-223 [Conf]
  15. Henrik Brosenne, Matthias Homeister, Stephan Waack
    Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:290-299 [Conf]
  16. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:405-413 [Conf]
  17. Christoph Meinel, Stephan Waack
    Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:299-308 [Conf]
  18. Christoph Meinel, Stephan Waack
    Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:337-345 [Conf]
  19. Stephan Waack
    The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:492-498 [Conf]
  20. Jan Behrens, Stephan Waack
    Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:227-237 [Conf]
  21. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Counting Communication Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:281-292 [Conf]
  22. Christoph Meinel, Stephan Waack
    The "log Rank" Conjecture for Modular Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:619-630 [Conf]
  23. Stephan Waack
    On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:201-212 [Conf]
  24. Mario Stanke, Oliver Schöffmann, Burkhard Morgenstern, Stephan Waack
    Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:62- [Journal]
  25. Stephan Waack, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl
    Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:142- [Journal]
  26. Christoph Meinel, Stephan Waack
    The "log rank" conjecture for modular communication complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:1, pp:70-91 [Journal]
  27. Beate Bollig, Philipp Woelfel, Stephan Waack
    Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:073, pp:- [Journal]
  28. Christoph Meinel, Stephan Waack
    The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:22, pp:- [Journal]
  29. Lothar Budach, Stephan Waack
    On the Halting Problem for Automata in Cones. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1982, v:18, n:9, pp:489-499 [Journal]
  30. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Oblivious Linear Length MODp-Branching Program Classes. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:2, pp:63-75 [Journal]
  31. Stephan Waack
    The Parallel Complexity of Some Constructions in Combinatorial Group Theory. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1990, v:26, n:5/6, pp:265-281 [Journal]
  32. Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
    Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:2, pp:168-178 [Journal]
  33. Stephan Waack
    On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:166, n:1, pp:61-70 [Journal]
  34. Stephan Waack, Matthias Krause
    On Oblivious Branching Programs of Linear Length [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:2, pp:232-249 [Journal]
  35. Henrik Brosenne, Matthias Homeister, Stephan Waack
    Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:1, pp:6-10 [Journal]
  36. Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
    On approximation by XOR-OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:1, pp:17-21 [Journal]
  37. Henrik Brosenne, Matthias Homeister, Stephan Waack
    Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:3, pp:229-247 [Journal]
  38. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:345-362 [Journal]
  39. Klaus Kriegel, Stephan Waack
    Lower Bounds on The Complexity of Real-Time Branching Programs. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:4, pp:447-459 [Journal]
  40. Stephan Waack
    On the parallel complexity of linear groups. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:323-354 [Journal]
  41. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    On relations between counting communication complexity classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:259-280 [Journal]
  42. Matthias Krause, Stephan Waack
    Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:6, pp:553-564 [Journal]
  43. Christoph Meinel, Stephan Waack
    Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:1, pp:21-39 [Journal]
  44. Christoph Meinel, Stephan Waack
    Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:6, pp:649-659 [Journal]
  45. Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern
    AUGUSTUS: a web server for gene finding in eukaryotes. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2004, v:32, n:Web-Server-Issue, pp:309-312 [Journal]
  46. Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern
    AUGUSTUS: ab initio prediction of alternative transcripts. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2006, v:34, n:Web-Server-Issue, pp:435-439 [Journal]
  47. Beate Bollig, Stephan Waack, Philipp Woelfel
    Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:86-99 [Journal]
  48. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:267-275 [Journal]
  49. Edith Werner, Jens Grabowski, Helmut Neukirchen, Nils Röttger, Stephan Waack, Benjamin Zeiss
    TTCN-3 Quality Engineering: Using Learning Techniques to Evaluate Metric Sets. [Citation Graph (0, 0)][DBLP]
    SDL Forum, 2007, pp:54-68 [Conf]

  50. Scipio: Using protein sequences to determine the precise exon/intron structures of genes and their orthologs in closely related species. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002