| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Steffen Herbold, Uwe Bünting, Jens Grabowski, Stephan Waack |
Deployable Capture/Replay Supported by Internal Messages.  |
Advances in Computers  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Keller, Martin Kollmar, Mario Stanke, Stephan Waack |
A novel hybrid gene prediction method employing protein multiple sequence alignments. |
Bioinformatics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Herbold, Jens Grabowski, Stephan Waack |
Calculation and optimization of thresholds for sets of software metrics. |
Empirical Software Engineering |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Keller, Florian Odronitz, Mario Stanke, Martin Kollmar, Stephan Waack |
Scipio: Using protein sequences to determine the precise exon/intron structures of genes and their orthologs in closely related species. |
BMC Bioinformatics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack |
On approximation by XOR-OBDDs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Brosenne, Matthias Homeister, Stephan Waack |
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Stephan Waack, Philipp Woelfel |
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke, Stephan Waack |
P-value based visualization of codon usage data. |
Algorithms for Molecular Biology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern |
AUGUSTUS: ab initio prediction of alternative transcripts. |
Nucleic Acids Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
On relations between counting communication complexity classes. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern |
AUGUSTUS: a web server for gene finding in eukaryotes. |
Nucleic Acids Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Merkl, Stephan Waack |
Bioinformatik interaktiv - Algorithmen und Praxis. |
|
2003 |
RDF |
|
| 1 | Mario Stanke, Stephan Waack |
Gene prediction with a hidden Markov model and a new intron submodel. |
ECCB |
2003 |
DBLP BibTeX RDF |
|
| 1 | Henrik Brosenne, Matthias Homeister, Stephan Waack |
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Brosenne, Matthias Homeister, Stephan Waack |
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. |
ITA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Stephan Waack, Philipp Woelfel |
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stephan Waack |
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
The "log rank" conjecture for modular communication complexity. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Brosenne, Matthias Homeister, Stephan Waack |
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Behrens, Stephan Waack |
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Waack |
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
The ``Log Rank'' Conjecture for Modular Communication Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. |
Mathematical Systems Theory |
1996 |
DBLP BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
The "log Rank" Conjecture for Modular Communication Complexity. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1995 |
DBLP BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. |
LATIN |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1994 |
RDF |
|
| 1 | 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) |
1994 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Oblivious Linear Length MODp-Branching Program Classes. |
Elektronische Informationsverarbeitung und Kybernetik |
1994 |
DBLP BibTeX RDF |
|
| 1 | Stephan Waack |
On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers. |
Canada-France Conference on Parallel and Distributed Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1992 |
RDF |
|
| 1 | 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 |
1992 |
RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. |
ITA |
1992 |
DBLP BibTeX RDF |
|
| 1 | 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. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
complexity of Boolean function, communication complexity and distributed computing, probabilism, lower bound arguments, separation of complexity classes |
| 1 | Christoph Meinel, Stephan Waack |
Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs. |
Complexity Theory: Current Research |
1992 |
DBLP BibTeX RDF |
|
| 1 | 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. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Waack |
On the parallel complexity of linear groups. |
ITA |
1991 |
DBLP BibTeX RDF |
|
| 1 | Stephan Waack, Matthias Krause |
On Oblivious Branching Programs of Linear Length |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Stephan Waack |
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. |
MFCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
MOD m gate, communication matrices, depth two circuits, symmetric gates, unbounded fan-in, exponential lower bound, variation rank, threshold gate |
| 1 | Stephan Waack |
The Parallel Complexity of Some Constructions in Combinatorial Group Theory. |
Elektronische Informationsverarbeitung und Kybernetik |
1990 |
DBLP BibTeX RDF |
|
| 1 | Stephan Waack |
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Stephan Waack |
On Oblivious Branching Programs of Linear Length (Extended Abstract). |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. |
IFIP Congress |
1989 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Klaus Kriegel, Stephan Waack |
Lower Bounds on The Complexity of Real-Time Branching Programs. |
ITA |
1988 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Christoph Meinel, Stephan Waack |
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Kriegel, Stephan Waack |
Exponential Lower Bounds for Real-Time Branching Programs. |
FCT |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Kriegel, Stephan Waack |
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). |
FCT |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Lothar Budach, Stephan Waack |
On the Halting Problem for Automata in Cones. |
Elektronische Informationsverarbeitung und Kybernetik |
1982 |
DBLP BibTeX RDF |
|
| 1 | Stephan Waack |
Tape Complexity of Word Problems. |
FCT |
1981 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")