Stephan Waack

81 papers A* 1A 5B 12C 1Journal 47Unranked 11
YearRankTypeTitle / Venue / Authors
2021 J jnl
A graph-based algorithm for detecting rigid domains in protein structures.
BMC Bioinform.
Truong Khanh Linh Dang, Thach Nguyen, Michael Habeck, Mehmet Gültas, Stephan Waack
2021 J jnl
Investigation and prediction of open source software evolution using automated parameter mining for agent-based simulation.
Autom. Softw. Eng.
Daniel Honsel, Verena Herbold, Stephan Waack, Jens Grabowski
2016 J jnl
A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence.
Entropy
Truong Khanh Linh Dang, Cornelia Meckbach, Rebecca Tacke, Stephan Waack, Mehmet Gültas
2016 — conf
Agent-Based Simulation for Software Development Processes.
EUMAS/AT
Tobias Ahlbrecht, Jürgen Dix, Niklas Fiekas, Jens Grabowski, Verena Herbold, Daniel Honsel, Stephan Waack, Marlon Welter
2016 J jnl
Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt.
Frontiers Appl. Math. Stat.
Lennart Obermann, Stephan Waack
2016 A conf
Monitoring Software Quality by Means of Simulation Methods.
ESEM
Daniel Honsel, Verena Honsel, Marlon Welter, Stephan Waack, Jens Grabowski
2015 J jnl
Demonstrating non-inferiority of easy interpretable methods for insolvency prediction.
Expert Syst. Appl.
Lennart Obermann, Stephan Waack
2015 — conf
Developer Oriented and Quality Assurance Based Simulation of Software Processes.
SATToSE
Verena Honsel, Daniel Honsel, Jens Grabowski, Stephan Waack
2015 — conf
Mining Software Dependency Networks for Agent-Based Simulation of Software Evolution.
ASE Workshops
Verena Honsel, Daniel Honsel, Steffen Herbold, Jens Grabowski, Stephan Waack
2015 J jnl
PC-TraFF: identification of potentially collaborating transcription factors using pointwise mutual information.
BMC Bioinform.
Cornelia Meckbach, Rebecca Tacke, Xu Hua, Stephan Waack, Edgar Wingender, Mehmet Gültas
2014 J jnl
A Generalized Model of PAC Learning and its Applicability.
RAIRO Theor. Informatics Appl.
Thomas Brodag, Steffen Herbold, Stephan Waack
2014 J jnl
CRF-based models of protein surfaces improve protein-protein interaction site predictions.
BMC Bioinform.
Zhijie Dong, Keyu Wang, Truong Khanh Linh Dang, Mehmet Gültas, Marlon Welter, Torsten Wierschin, Mario Stanke, Stephan Waack
2014 J jnl
Quantum Coupled Mutation Finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming.
BMC Bioinform.
Mehmet Gültas, Güncel Düzgün, Sebastian Herzog, Sven Joachim Jäger, Cornelia Meckbach, Edgar Wingender, Stephan Waack
2013 J jnl
GenePainter: a fast tool for aligning gene structures of eukaryotic protein families, visualizing the alignments and mapping gene structures onto protein structures.
BMC Bioinform.
Björn Hammesfahr, Florian Odronitz, Stefanie Mühlhausen, Stephan Waack, Martin Kollmar
2013 — ed.
German Conference on Bioinformatics 2013, GCB 2013, Göttingen, Germany, September 10-13, 2013
GCB
Tim Beißbarth, Martin Kollmar, Andreas Leha, Burkhard Morgenstern, Anne-Kathrin Schultz, Stephan Waack, Edgar Wingender
2012 J jnl
Coupled Mutation Finder: A new entropy-based method quantifying phylogenetic noise for the detection of compensatory mutations.
BMC Bioinform.
Mehmet Gültas, Martin Haubrock, Nesrin Tüysüz, Stephan Waack
2012 J jnl
Deployable Capture/Replay Supported by Internal Messages.
Adv. Comput.
Steffen Herbold, Uwe Bünting, Jens Grabowski, Stephan Waack
2011 — conf
A Model for Usage-Based Testing of Event-Driven Software.
SSIRI (Companion)
Steffen Herbold, Jens Grabowski, Stephan Waack
2011 J jnl
A novel hybrid gene prediction method employing protein multiple sequence alignments.
Bioinform.
Oliver Keller, Martin Kollmar, Mario Stanke, Stephan Waack
2011 J jnl
Calculation and optimization of thresholds for sets of software metrics.
Empir. Softw. Eng.
Steffen Herbold, Jens Grabowski, Stephan Waack
2011 — conf
Improved Bug Reporting and Reproduction through Non-intrusive GUI Usage Monitoring and Automated Replaying.
ICST Workshops
Steffen Herbold, Jens Grabowski, Stephan Waack, Uwe Bünting
2010 J jnl
Retrospective Analysis of Software Projects using k-Means Clustering.
Softwaretechnik-Trends
Steffen Herbold, Jens Grabowski, Helmut Neukirchen, Stephan Waack
2008 J jnl
Scipio: Using protein sequences to determine the precise exon/intron structures of genes and their orthologs in closely related species.
BMC Bioinform.
Oliver Keller, Florian Odronitz, Mario Stanke, Martin Kollmar, Stephan Waack
2007 J jnl
On approximation by XOR-OBDDs.
Inf. Process. Lett.
Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
2007 — conf
TTCN-3 Quality Engineering: Using Learning Techniques to Evaluate Metric Sets.
SDL Forum
Edith Werner, Jens Grabowski, Helmut Neukirchen, Nils Röttger, Stephan Waack, Benjamin Zeiss
2006 J jnl
AUGUSTUS:
Nucleic Acids Res.
Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern
2006 J jnl
Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources.
BMC Bioinform.
Mario Stanke, Oliver Schöffmann, Burkhard Morgenstern, Stephan Waack
2006 J jnl
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance.
Inf. Process. Lett.
Henrik Brosenne, Matthias Homeister, Stephan Waack
2006 J jnl
P-value based visualization of codon usage data.
Algorithms Mol. Biol.
Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke, Stephan Waack
2006 J jnl
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.
Theor. Comput. Sci.
Beate Bollig, Stephan Waack, Philipp Woelfel
2006 J jnl
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models.
BMC Bioinform.
Stephan Waack, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl
2004 J jnl
AUGUSTUS: a web server for gene finding in eukaryotes.
Nucleic Acids Res.
Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern
2004 J jnl
On relations between counting communication complexity classes.
J. Comput. Syst. Sci.
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
2003 — book
Bioinformatik interaktiv - Algorithmen und Praxis.
Rainer Merkl, Stephan Waack
2003 C conf
Gene prediction with a hidden Markov model and a new intron submodel.
ECCB
Mario Stanke, Stephan Waack
2003 B conf
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.
MFCS
Henrik Brosenne, Matthias Homeister, Stephan Waack
2002 J jnl
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs.
RAIRO Theor. Informatics Appl.
Henrik Brosenne, Matthias Homeister, Stephan Waack
2002 — conf
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
IFIP TCS
Beate Bollig, Stephan Waack, Philipp Woelfel
2001 B conf
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.
MFCS
Henrik Brosenne, Matthias Homeister, Stephan Waack
2001 J jnl
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.
Inf. Comput.
Stephan Waack
2001 J jnl
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Electron. Colloquium Comput. Complex.
Beate Bollig, Philipp Woelfel, Stephan Waack
2001 J jnl
The "log rank" conjecture for modular communication complexity.
Comput. Complex.
Christoph Meinel, Stephan Waack
1998 A conf
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.
STACS
Jan Behrens, Stephan Waack
1997 A conf
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.
STACS
Stephan Waack
1996 J jnl
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems.
Math. Syst. Theory
Christoph Meinel, Stephan Waack
1996 J jnl
The "Log Rank" Conjecture for Modular Communication Complexity
Electron. Colloquium Comput. Complex.
Christoph Meinel, Stephan Waack
1996 A conf
The "log Rank" Conjecture for Modular Communication Complexity.
STACS
Christoph Meinel, Stephan Waack
1995 J jnl
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
Electron. Colloquium Comput. Complex.
Christoph Meinel, Stephan Waack
1995 B conf
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems.
MFCS
Christoph Meinel, Stephan Waack
1995 B conf
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.
LATIN
Christoph Meinel, Stephan Waack
1995 J jnl
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs.
Math. Syst. Theory
Christoph Meinel, Stephan Waack
1995 J jnl
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.
Math. Syst. Theory
Matthias Krause, Stephan Waack
1994 — conf
On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers.
Canada-France Conference on Parallel and Distributed Computing
Stephan Waack
1994 J jnl
Separating Oblivious Linear Length MOD
J. Inf. Process. Cybern.
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
1994 J jnl
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.
Christoph Meinel, Stephan Waack
1994 J jnl
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
Christoph Meinel, Stephan Waack
1993 B conf
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs.
ISAAC
Christoph Meinel, Stephan Waack
1992 J jnl
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
Inf. Comput.
Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
1992 J jnl
Separating Counting Communication Complexity Classes
Universität Trier, Mathematik/Informatik, Forschungsbericht
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
1992 A conf
Separating Counting Communication Complexity Classes.
STACS
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
1992 J jnl
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines.
RAIRO Theor. Informatics Appl.
Matthias Krause, Christoph Meinel, Stephan Waack
1992 — conf
Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs.
Complexity Theory: Current Research
Christoph Meinel, Stephan Waack
1992 J jnl
Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs
Universität Trier, Mathematik/Informatik, Forschungsbericht
Christoph Meinel, Stephan Waack
1991 J jnl
On Oblivious Branching Programs of Linear Length
Inf. Comput.
Stephan Waack, Matthias Krause
1991 J jnl
On the parallel complexity of linear groups.
RAIRO Theor. Informatics Appl.
Stephan Waack
1991 J jnl
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e.
Theor. Comput. Sci.
Matthias Krause, Christoph Meinel, Stephan Waack
1991 B conf
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs.
MFCS
Christoph Meinel, Stephan Waack
1991 A* conf
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In
FOCS
Matthias Krause, Stephan Waack
1990 B conf
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
MFCS
Stephan Waack
1990 J jnl
The Parallel Complexity of Some Constructions in Combinatorial Group Theory.
J. Inf. Process. Cybern.
Stephan Waack
1989 — —
Obere und untere Schranken für Schaltkreise und Verzweigungsprogramme.
Stephan Waack
1989 B conf
On Oblivious Branching Programs of Linear Length (Extended Abstract).
FCT
Matthias Krause, Stephan Waack
1989 — conf
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines.
IFIP Congress
Matthias Krause, Christoph Meinel, Stephan Waack
1989 — conf
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines.
SCT
Matthias Krause, Christoph Meinel, Stephan Waack
1988 J jnl
Lower Bounds on The Complexity of Real-Time Branching Programs.
RAIRO Theor. Informatics Appl.
Klaus Kriegel, Stephan Waack
1988 B conf
Separating the Eraser Turing Machine Classes L
MFCS
Matthias Krause, Christoph Meinel, Stephan Waack
1987 B conf
Exponential Lower Bounds for Real-Time Branching Programs.
FCT
Klaus Kriegel, Stephan Waack
1985 B conf
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).
FCT
Klaus Kriegel, Stephan Waack
1983 — —
Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen.
Stephan Waack
1982 J jnl
On the Halting Problem for Automata in Cones.
J. Inf. Process. Cybern.
Lothar Budach, Stephan Waack
1981 B conf
Tape Complexity of Word Problems.
FCT
Stephan Waack