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