Stephan Waack
Affiliations:- University of Göttingen, Germany
According to our database1,
Stephan Waack
authored at least 69 papers
between 1981 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2021
BMC Bioinform., 2021
Investigation and prediction of open source software evolution using automated parameter mining for agent-based simulation.
Autom. Softw. Eng., 2021
2016
Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt.
Frontiers Appl. Math. Stat., 2016
A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence.
Entropy, 2016
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2016
Proceedings of the 10th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement, 2016
2015
Demonstrating non-inferiority of easy interpretable methods for insolvency prediction.
Expert Syst. Appl., 2015
PC-TraFF: identification of potentially collaborating transcription factors using pointwise mutual information.
BMC Bioinform., 2015
Proceedings of the Post-proceedings of the 8th Seminar on Advanced Techniques and Tools for Software Evolution, 2015
Mining Software Dependency Networks for Agent-Based Simulation of Software Evolution.
Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering Workshops, 2015
2014
RAIRO Theor. Informatics Appl., 2014
Quantum Coupled Mutation Finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming.
BMC Bioinform., 2014
CRF-based models of protein surfaces improve protein-protein interaction site predictions.
BMC Bioinform., 2014
2013
GenePainter: a fast tool for aligning gene structures of eukaryotic protein families, visualizing the alignments and mapping gene structures onto protein structures.
BMC Bioinform., 2013
2012
Coupled Mutation Finder: A new entropy-based method quantifying phylogenetic noise for the detection of compensatory mutations.
BMC Bioinform., 2012
2011
Empir. Softw. Eng., 2011
A novel hybrid gene prediction method employing protein multiple sequence alignments.
Bioinform., 2011
Proceedings of the Fifth International Conference on Secure Software Integration and Reliability Improvement, 2011
Improved Bug Reporting and Reproduction through Non-intrusive GUI Usage Monitoring and Automated Replaying.
Proceedings of the Fourth IEEE International Conference on Software Testing, 2011
2010
Softwaretechnik-Trends, 2010
2008
Scipio: Using protein sequences to determine the precise exon/intron structures of genes and their orthologs in closely related species.
BMC Bioinform., 2008
2007
Proceedings of the SDL 2007: Design for Dependable Systems, 2007
2006
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.
Theor. Comput. Sci., 2006
Nucleic Acids Res., 2006
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance.
Inf. Process. Lett., 2006
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models.
BMC Bioinform., 2006
Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources.
BMC Bioinform., 2006
2004
J. Comput. Syst. Sci., 2004
2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Gene prediction with a hidden Markov model and a new intron submodel.
Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003
Bioinformatik interaktiv - Algorithmen und Praxis.
Wiley-VCH, ISBN: 978-3-527-30662-6, 2003
2002
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs.
RAIRO Theor. Informatics Appl., 2002
2001
Inf. Comput., 2001
Comput. Complex., 2001
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001
1998
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.
Proceedings of the STACS 98, 1998
1995
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs.
Math. Syst. Theory, 1995
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.
Math. Syst. Theory, 1995
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
Electron. Colloquium Comput. Complex., 1995
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
1994
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
Separating Oblivious Linear Length MOD<sub>p</sub>-Branching Program Classes.
J. Inf. Process. Cybern., 1994
On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers.
Proceedings of the Parallel and Distributed Computing, 1994
1992
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
Inf. Comput., February, 1992
Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992
Separating Counting Communication Complexity Classes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines.
RAIRO Theor. Informatics Appl., 1992
Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs.
Proceedings of the Complexity Theory: Current Research, 1992
1991
Theor. Comput. Sci., 1991
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
The Parallel Complexity of Some Constructions in Combinatorial Group Theory.
J. Inf. Process. Cybern., 1990
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
PhD thesis, 1989
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
Proceedings of the Fundamentals of Computation Theory, 1989
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989
1988
RAIRO Theor. Informatics Appl., 1988
Separating the Eraser Turing Machine Classes L<sub>e</sub>, NL<sub>e</sub>, co-NL<sub>e</sub> and P<sub>e</sub>.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
1987
Proceedings of the Fundamentals of Computation Theory, 1987
1985
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).
Proceedings of the Fundamentals of Computation Theory, 1985
1983
1982
On the Halting Problem for Automata in Cones.
J. Inf. Process. Cybern., 1982
1981
Proceedings of the Fundamentals of Computation Theory, 1981