Stephan Waack

Björn Hammesfahr, Florian Odronitz, Stefanie Mühlhausen, Stephan Waack, Martin Kollmar: GenePainter: a fast tool for aligning gene structures of eukaryotic protein families, visualizing the alignments and mapping gene structures onto protein structures. BMC Bioinformatics 14: 77 (2013)

Steffen Herbold, Uwe Bünting, Jens Grabowski, Stephan Waack: Deployable Capture/Replay Supported by Internal Messages. Advances in Computers 85: 327-367 (2012)

Mehmet Gültas, Martin Haubrock, Nesrin Tüysüz, Stephan Waack: Coupled Mutation Finder: A new entropy-based method quantifying phylogenetic noise for the detection of compensatory mutations. BMC Bioinformatics 13: 225 (2012)

Oliver Keller, Martin Kollmar, Mario Stanke, Stephan Waack: A novel hybrid gene prediction method employing protein multiple sequence alignments. Bioinformatics 27(6): 757-763 (2011)

Steffen Herbold, Jens Grabowski, Stephan Waack: Calculation and optimization of thresholds for sets of software metrics. Empirical Software Engineering 16(6): 812-841 (2011)

Steffen Herbold, Jens Grabowski, Stephan Waack, Uwe Bünting: Improved Bug Reporting and Reproduction through Non-intrusive GUI Usage Monitoring and Automated Replaying. ICST Workshops 2011: 232-241

Steffen Herbold, Jens Grabowski, Stephan Waack: A Model for Usage-Based Testing of Event-Driven Software. SSIRI (Companion) 2011: 172-178

Steffen Herbold, Jens Grabowski, Helmut Neukirchen, Stephan Waack: Retrospective Analysis of Software Projects using k-Means Clustering. Softwaretechnik-Trends 30(2) (2010)

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 9 (2008)

Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack: On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007)

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

Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke, Stephan Waack: P-value based visualization of codon usage data. Algorithms for Molecular Biology 1 (2006)

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)

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)

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)

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)

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)

Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004)

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)

Rainer Merkl, Stephan Waack: Bioinformatik interaktiv - Algorithmen und Praxis. Wiley-VCH 2003, isbn 978-3-527-30662-6, pp. I-XIV, 1-347

Mario Stanke, Stephan Waack: Gene prediction with a hidden Markov model and a new intron submodel. ECCB 2003: 215-225

Henrik Brosenne, Matthias Homeister, Stephan Waack: Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299

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)

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

Christoph Meinel, Stephan Waack: The "log rank" conjecture for modular communication complexity. Computational Complexity 10(1): 70-91 (2001)

Stephan Waack: On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. Inf. Comput. 166(1): 61-70 (2001)

Henrik Brosenne, Matthias Homeister, Stephan Waack: Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS 2001: 212-223

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)

Jan Behrens, Stephan Waack: Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. STACS 1998: 227-237

Stephan Waack: On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. STACS 1997: 201-212

Christoph Meinel, Stephan Waack: Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Mathematical Systems Theory 29(6): 649-659 (1996)

Christoph Meinel, Stephan Waack: The "log Rank" Conjecture for Modular Communication Complexity. STACS 1996: 619-630

Christoph Meinel, Stephan Waack: The ``Log Rank'' Conjecture for Modular Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 3(17) (1996)

Christoph Meinel, Stephan Waack: Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. Mathematical Systems Theory 28(1): 21-39 (1995)

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)

Christoph Meinel, Stephan Waack: Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. LATIN 1995: 427-435

Christoph Meinel, Stephan Waack: Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. MFCS 1995: 299-308

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)

Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Oblivious Linear Length MOD_p-Branching Program Classes. Elektronische Informationsverarbeitung und Kybernetik 30(2): 63-75 (1994)

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

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)

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)

Christoph Meinel, Stephan Waack: Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. ISAAC 1993: 379-388

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)

Matthias Krause, Christoph Meinel, Stephan Waack: Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. ITA 26: 345-362 (1992)

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

Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes. STACS 1992: 281-292

Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992)

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)

Stephan Waack, Matthias Krause: On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (1991)

Stephan Waack: On the parallel complexity of linear groups. ITA 25: 323-354 (1991)

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)

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

Christoph Meinel, Stephan Waack: Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. MFCS 1991: 337-345

Stephan Waack: The Parallel Complexity of Some Constructions in Combinatorial Group Theory. Elektronische Informationsverarbeitung und Kybernetik 26(5/6): 265-281 (1990)

Stephan Waack: The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). MFCS 1990: 492-498

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

Matthias Krause, Stephan Waack: On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296

Matthias Krause, Christoph Meinel, Stephan Waack: Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292

Klaus Kriegel, Stephan Waack: Lower Bounds on The Complexity of Real-Time Branching Programs. ITA 22(4): 447-459 (1988)

Matthias Krause, Christoph Meinel, Stephan Waack: Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. MFCS 1988: 405-413

Klaus Kriegel, Stephan Waack: Exponential Lower Bounds for Real-Time Branching Programs. FCT 1987: 263-267

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

Lothar Budach, Stephan Waack: On the Halting Problem for Automata in Cones. Elektronische Informationsverarbeitung und Kybernetik 18(9): 489-499 (1982)

Stephan Waack: Tape Complexity of Word Problems. FCT 1981: 467-471