Stephan Waack

According to our database1, Stephan Waack authored at least 73 papers between 1981 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence.
Entropy, 2016

Agent-Based Simulation for Software Development Processes.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2016

Monitoring Software Quality by Means of Simulation Methods.
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 Bioinformatics, 2015

Developer Oriented and Quality Assurance Based Simulation of Software Processes.
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
A Generalized Model of PAC Learning and its Applicability.
RAIRO - Theor. Inf. and Applic., 2014

Quantum Coupled Mutation Finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming.
BMC Bioinformatics, 2014

CRF-based models of protein surfaces improve protein-protein interaction site predictions.
BMC Bioinformatics, 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 Bioinformatics, 2013

2012
Coupled Mutation Finder: A new entropy-based method quantifying phylogenetic noise for the detection of compensatory mutations.
BMC Bioinformatics, 2012

Deployable Capture/Replay Supported by Internal Messages.
Advances in Computers, 2012

2011
Calculation and optimization of thresholds for sets of software metrics.
Empirical Software Engineering, 2011

A novel hybrid gene prediction method employing protein multiple sequence alignments.
Bioinformatics, 2011

A Model for Usage-Based Testing of Event-Driven Software.
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
Retrospective Analysis of Software Projects using k-Means Clustering.
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 Bioinformatics, 2008

2007
On approximation by XOR-OBDDs.
Inf. Process. Lett., 2007

TTCN-3 Quality Engineering: Using Learning Techniques to Evaluate Metric Sets.
Proceedings of the SDL 2007: Design for Dependable Systems, 2007

2006
AUGUSTUS: ab initio prediction of alternative transcripts.
Nucleic Acids Research, 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 Bioinformatics, 2006

Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources.
BMC Bioinformatics, 2006

P-value based visualization of codon usage data.
Algorithms for Molecular Biology, 2006

2004
AUGUSTUS: a web server for gene finding in eukaryotes.
Nucleic Acids Research, 2004

On relations between counting communication complexity classes.
J. Comput. Syst. Sci., 2004

2003
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.
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.
ITA, 2002

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Electronic Colloquium on Computational Complexity (ECCC), 2001

Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.
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

1997
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996
The "Log Rank" Conjecture for Modular Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC), 1996

The "log Rank" Conjecture for Modular Communication Complexity.
Proceedings of the STACS 96, 1996

1995
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs.
Mathematical Systems Theory, 1995

Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In.
Mathematical Systems Theory, 1995

Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
Electronic Colloquium on Computational Complexity (ECCC), 1995

Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems.
Proceedings of the Mathematical Foundations of Computer Science 1995, 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 MODp-Branching Program Classes.
Elektronische Informationsverarbeitung und Kybernetik, 1994

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

On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers.
Proceedings of the Parallel and Distributed Computing, 1994

1993
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

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.
ITA, 1992

Separating Counting Communication Complexity Classes.
Proceedings of the STACS 92, 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
On Oblivious Branching Programs of Linear Length
Inf. Comput., October, 1991

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e.
Theor. Comput. Sci., 1991

On the parallel complexity of linear groups.
ITA, 1991

Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs.
Proceedings of the Mathematical Foundations of Computer Science 1991, 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.
Elektronische Informationsverarbeitung und Kybernetik, 1990

The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989
Obere und untere Schranken für Schaltkreise und Verzweigungsprogramme.
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

On Oblivious Branching Programs of Linear Length (Extended Abstract).
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
Lower Bounds on The Complexity of Real-Time Branching Programs.
ITA, 1988

Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
Exponential Lower Bounds for Real-Time Branching Programs.
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
Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen.
PhD thesis, 1983

1982
On the Halting Problem for Automata in Cones.
Elektronische Informationsverarbeitung und Kybernetik, 1982

1981
Tape Complexity of Word Problems.
Proceedings of the Fundamentals of Computation Theory, 1981


  Loading...