Stephan Waack

Publication Activity (10 Years)

Years Active: 1981-2021
Publications (10 Years): 6

Top Venues

BMC Bioinform.

Autom. Softw. Eng.

ESEM

EUMAS/AT

Humboldt University of Berlin, Unter den Linden, Germany (PHD)

Education History

Humboldt University of Berlin, Unter den Linden, Germany

PHD

Academy of Sciences of the German Democratic Republic, Berlin, Germany

PHD

Publications

Truong Khanh Linh Dang, Thach Nguyen, Michael Habeck, Mehmet Gültas, Stephan Waack
A graph-based algorithm for detecting rigid domains in protein structures. BMC Bioinform. 22 (1) (2021)
Daniel Honsel, Verena Herbold, Stephan Waack, Jens Grabowski
Investigation and prediction of open source software evolution using automated parameter mining for agent-based simulation. Autom. Softw. Eng. 28 (1) (2021)
Tobias Ahlbrecht, Jürgen Dix, Niklas Fiekas, Jens Grabowski, Verena Herbold, Daniel Honsel, Stephan Waack, Marlon Welter
Agent-Based Simulation for Software Development Processes. EUMAS/AT (2016)
Truong Khanh Linh Dang, Cornelia Meckbach, Rebecca Tacke, Stephan Waack, Mehmet Gültas
A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence. Entropy 18 (10) (2016)
Daniel Honsel, Verena Honsel, Marlon Welter, Stephan Waack, Jens Grabowski
Monitoring Software Quality by Means of Simulation Methods. ESEM (2016)
Lennart Obermann, Stephan Waack
Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt. Frontiers Appl. Math. Stat. 2 (2016)
Cornelia Meckbach, Rebecca Tacke, Xu Hua, Stephan Waack, Edgar Wingender, Mehmet Gültas
PC-TraFF: identification of potentially collaborating transcription factors using pointwise mutual information. BMC Bioinform. 16 (2015)
Verena Honsel, Daniel Honsel, Jens Grabowski, Stephan Waack
Developer Oriented and Quality Assurance Based Simulation of Software Processes. SATToSE (2015)
Lennart Obermann, Stephan Waack
Demonstrating non-inferiority of easy interpretable methods for insolvency prediction. Expert Syst. Appl. 42 (23) (2015)
Verena Honsel, Daniel Honsel, Steffen Herbold, Jens Grabowski, Stephan Waack
Mining Software Dependency Networks for Agent-Based Simulation of Software Evolution. ASE Workshops (2015)
Zhijie Dong, Keyu Wang, Truong Khanh Linh Dang, Mehmet Gültas, Marlon Welter, Torsten Wierschin, Mario Stanke, Stephan Waack
CRF-based models of protein surfaces improve protein-protein interaction site predictions. BMC Bioinform. 15 (2014)
Mehmet Gültas, Güncel Düzgün, Sebastian Herzog, Sven Joachim Jäger, Cornelia Meckbach, Edgar Wingender, Stephan Waack
Quantum Coupled Mutation Finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming. BMC Bioinform. 15 (2014)
Thomas Brodag, Steffen Herbold, Stephan Waack
A Generalized Model of PAC Learning and its Applicability. RAIRO Theor. Informatics Appl. 48 (2) (2014)
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 Bioinform. 14 (2013)
Steffen Herbold, Uwe Bünting, Jens Grabowski, Stephan Waack
Deployable Capture/Replay Supported by Internal Messages. Adv. Comput. 85 (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 Bioinform. 13 (2012)
Steffen Herbold, Jens Grabowski, Stephan Waack
A Model for Usage-Based Testing of Event-Driven Software. SSIRI (Companion) (2011)
Steffen Herbold, Jens Grabowski, Stephan Waack
Calculation and optimization of thresholds for sets of software metrics. Empir. Softw. Eng. 16 (6) (2011)
Oliver Keller, Martin Kollmar, Mario Stanke, Stephan Waack
A novel hybrid gene prediction method employing protein multiple sequence alignments. Bioinform. 27 (6) (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)
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 Bioinform. 9 (2008)
Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
On approximation by XOR-OBDDs. Inf. Process. Lett. 102 (1) (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)
Henrik Brosenne, Matthias Homeister, Stephan Waack
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. Inf. Process. Lett. 98 (1) (2006)
Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke, Stephan Waack
P-value based visualization of codon usage data. Algorithms Mol. Biol. 1 (2006)
Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern
prediction of alternative transcripts. Nucleic Acids Res. 34 (Web-Server-Issue) (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 Bioinform. 7 (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) (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 Bioinform. 7 (2006)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69 (2) (2004)
Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern
AUGUSTUS: a web server for gene finding in eukaryotes. Nucleic Acids Res. 32 (Web-Server-Issue) (2004)
Henrik Brosenne, Matthias Homeister, Stephan Waack
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS (2003)
Mario Stanke, Stephan Waack
Gene prediction with a hidden Markov model and a new intron submodel. ECCB (2003)
Beate Bollig, Stephan Waack, Philipp Woelfel
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS (2002)
Henrik Brosenne, Matthias Homeister, Stephan Waack
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. RAIRO Theor. Informatics Appl. 36 (3) (2002)
Christoph Meinel, Stephan Waack
The "log rank" conjecture for modular communication complexity. Comput. Complex. 10 (1) (2001)
Beate Bollig, Philipp Woelfel, Stephan Waack
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication Electron. Colloquium Comput. Complex. 8 (073) (2001)
Stephan Waack
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. Inf. Comput. 166 (1) (2001)
Henrik Brosenne, Matthias Homeister, Stephan Waack
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS (2001)
Jan Behrens, Stephan Waack
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. STACS (1998)
Stephan Waack
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. STACS (1997)
Christoph Meinel, Stephan Waack
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Math. Syst. Theory 29 (6) (1996)
Christoph Meinel, Stephan Waack
The "Log Rank" Conjecture for Modular Communication Complexity Electron. Colloquium Comput. Complex. 3 (17) (1996)
Christoph Meinel, Stephan Waack
The "log Rank" Conjecture for Modular Communication Complexity. STACS (1996)
Christoph Meinel, Stephan Waack
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. Math. Syst. Theory 28 (1) (1995)
Christoph Meinel, Stephan Waack
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. MFCS (1995)
Christoph Meinel, Stephan Waack
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems Electron. Colloquium Comput. Complex. 2 (34) (1995)
Christoph Meinel, Stephan Waack
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. LATIN (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. Math. Syst. Theory 28 (6) (1995)
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 Electron. Colloquium Comput. Complex. 1 (22) (1994)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
-Branching Program Classes. J. Inf. Process. Cybern. 30 (2) (1994)
Stephan Waack
On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers. Canada-France Conference on Parallel and Distributed Computing (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 (1994)
Christoph Meinel, Stephan Waack
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. ISAAC (1993)
Matthias Krause, Christoph Meinel, Stephan Waack
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. RAIRO Theor. Informatics Appl. 26 (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)
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) (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 (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes Universität Trier, Mathematik/Informatik, Forschungsbericht (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes. STACS (1992)
Christoph Meinel, Stephan Waack
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. MFCS (1991)
Stephan Waack
On the parallel complexity of linear groups. RAIRO Theor. Informatics Appl. 25 (1991)
Stephan Waack, Matthias Krause
On Oblivious Branching Programs of Linear Length Inf. Comput. 94 (2) (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) (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)
Stephan Waack
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). MFCS (1990)
Stephan Waack
The Parallel Complexity of Some Constructions in Combinatorial Group Theory. J. Inf. Process. Cybern. 26 (5/6) (1990)
Matthias Krause, Stephan Waack
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT (1989)
Matthias Krause, Christoph Meinel, Stephan Waack
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress (1989)
Matthias Krause, Christoph Meinel, Stephan Waack
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. Computational Complexity Conference (1989)
Klaus Kriegel, Stephan Waack
Lower Bounds on The Complexity of Real-Time Branching Programs. RAIRO Theor. Informatics Appl. 22 (4) (1988)
Matthias Krause, Christoph Meinel, Stephan Waack
. MFCS (1988)
Klaus Kriegel, Stephan Waack
Exponential Lower Bounds for Real-Time Branching Programs. FCT (1987)
Klaus Kriegel, Stephan Waack
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). FCT (1985)
Lothar Budach, Stephan Waack
On the Halting Problem for Automata in Cones. J. Inf. Process. Cybern. 18 (9) (1982)
Stephan Waack
Tape Complexity of Word Problems. FCT (1981)

Stephan Waack.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stephan Waack