default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Waack
Person information
- affiliation: University of Göttingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j40]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): 3 (2021)- [j39]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): 66 (2021)
2010 – 2019
- 2016
- [j38]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): 379 (2016) - [j37]Lennart Obermann, Stephan Waack:
Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt. Frontiers Appl. Math. Stat. 2: 16 (2016) - [c30]Daniel Honsel, Verena Honsel, Marlon Welter, Stephan Waack, Jens Grabowski:
Monitoring Software Quality by Means of Simulation Methods. ESEM 2016: 11:1-11:6 - [c29]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: 333-340 - 2015
- [j36]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: 400:1-400:21 (2015) - [j35]Lennart Obermann, Stephan Waack:
Demonstrating non-inferiority of easy interpretable methods for insolvency prediction. Expert Syst. Appl. 42(23): 9117-9128 (2015) - [c28]Verena Honsel, Daniel Honsel, Steffen Herbold, Jens Grabowski, Stephan Waack:
Mining Software Dependency Networks for Agent-Based Simulation of Software Evolution. ASE Workshops 2015: 102-108 - [c27]Verena Honsel, Daniel Honsel, Jens Grabowski, Stephan Waack:
Developer Oriented and Quality Assurance Based Simulation of Software Processes. SATToSE 2015: 5-13 - 2014
- [j34]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: 96 (2014) - [j33]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: 277 (2014) - [j32]Thomas Brodag, Steffen Herbold, Stephan Waack:
A Generalized Model of PAC Learning and its Applicability. RAIRO Theor. Informatics Appl. 48(2): 209-245 (2014) - 2013
- [j31]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: 77 (2013) - [e1]Tim Beißbarth, Martin Kollmar, Andreas Leha, Burkhard Morgenstern, Anne-Kathrin Schultz, Stephan Waack, Edgar Wingender:
German Conference on Bioinformatics 2013, GCB 2013, September 10-13, 2013, Göttingen, Germany. OASIcs 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-59-0 [contents] - 2012
- [j30]Steffen Herbold, Uwe Bünting, Jens Grabowski, Stephan Waack:
Deployable Capture/Replay Supported by Internal Messages. Adv. Comput. 85: 327-367 (2012) - [j29]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: 225 (2012) - 2011
- [j28]Oliver Keller, Martin Kollmar, Mario Stanke, Stephan Waack:
A novel hybrid gene prediction method employing protein multiple sequence alignments. Bioinform. 27(6): 757-763 (2011) - [j27]Steffen Herbold, Jens Grabowski, Stephan Waack:
Calculation and optimization of thresholds for sets of software metrics. Empir. Softw. Eng. 16(6): 812-841 (2011) - [c26]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 - [c25]Steffen Herbold, Jens Grabowski, Stephan Waack:
A Model for Usage-Based Testing of Event-Driven Software. SSIRI (Companion) 2011: 172-178 - 2010
- [j26]Steffen Herbold, Jens Grabowski, Helmut Neukirchen, Stephan Waack:
Retrospective Analysis of Software Projects using k-Means Clustering. Softwaretechnik-Trends 30(2) (2010)
2000 – 2009
- 2008
- [j25]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) - 2007
- [j24]Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack:
On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007) - [c24]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 - 2006
- [j23]Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke, Stephan Waack:
P-value based visualization of codon usage data. Algorithms Mol. Biol. 1 (2006) - [j22]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: 62 (2006) - [j21]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: 142 (2006) - [j20]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) - [j19]Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern:
AUGUSTUS: ab initio prediction of alternative transcripts. Nucleic Acids Res. 34(Web-Server-Issue): 435-439 (2006) - [j18]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) - 2004
- [j17]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004) - [j16]Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern:
AUGUSTUS: a web server for gene finding in eukaryotes. Nucleic Acids Res. 32(Web-Server-Issue): 309-312 (2004) - 2003
- [b3]Rainer Merkl, Stephan Waack:
Bioinformatik interaktiv - Algorithmen und Praxis. Wiley-VCH 2003, ISBN 978-3-527-30662-6, pp. I-XIV, 1-347 - [c23]Mario Stanke, Stephan Waack:
Gene prediction with a hidden Markov model and a new intron submodel. ECCB 2003: 215-225 - [c22]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299 - 2002
- [j15]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): 229-247 (2002) - [c21]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 - 2001
- [j14]Christoph Meinel, Stephan Waack:
The "log rank" conjecture for modular communication complexity. Comput. Complex. 10(1): 70-91 (2001) - [j13]Stephan Waack:
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. Inf. Comput. 166(1): 61-70 (2001) - [c20]Henrik Brosenne, Matthias Homeister, Stephan Waack:
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS 2001: 212-223 - [i7]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. TR01 (2001)
1990 – 1999
- 1998
- [c19]Jan Behrens, Stephan Waack:
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering. STACS 1998: 227-237 - 1997
- [c18]Stephan Waack:
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams. STACS 1997: 201-212 - 1996
- [j12]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Math. Syst. Theory 29(6): 649-659 (1996) - [c17]Christoph Meinel, Stephan Waack:
The "log Rank" Conjecture for Modular Communication Complexity. STACS 1996: 619-630 - [i6]Christoph Meinel, Stephan Waack:
The "Log Rank" Conjecture for Modular Communication Complexity. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j11]Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. Math. Syst. Theory 28(1): 21-39 (1995) - [j10]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): 553-564 (1995) - [c16]Christoph Meinel, Stephan Waack:
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. LATIN 1995: 427-435 - [c15]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. MFCS 1995: 299-308 - [i5]Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j9]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Oblivious Linear Length MODp-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994) - [c14]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 - [i4]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. TR94 (1994) - [i3]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) - 1993
- [c13]Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. ISAAC 1993: 379-388 - 1992
- [j8]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) - [j7]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. RAIRO Theor. Informatics Appl. 26: 345-362 (1992) - [c12]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 - [c11]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. STACS 1992: 281-292 - [i2]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992) - [i1]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) - 1991
- [j6]Stephan Waack, Matthias Krause:
On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (1991) - [j5]Stephan Waack:
On the parallel complexity of linear groups. RAIRO Theor. Informatics Appl. 25: 323-354 (1991) - [j4]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) - [c10]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 - [c9]Christoph Meinel, Stephan Waack:
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. MFCS 1991: 337-345 - 1990
- [j3]Stephan Waack:
The Parallel Complexity of Some Constructions in Combinatorial Group Theory. J. Inf. Process. Cybern. 26(5/6): 265-281 (1990) - [c8]Stephan Waack:
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). MFCS 1990: 492-498
1980 – 1989
- 1989
- [b2]Stephan Waack:
Obere und untere Schranken für Schaltkreise und Verzweigungsprogramme. Academy of Sciences of the German Democratic Republic, Berlin, Germany, 1989 - [c7]Matthias Krause, Christoph Meinel, Stephan Waack:
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. SCT 1989: 240-249 - [c6]Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296 - [c5]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292 - 1988
- [j2]Klaus Kriegel, Stephan Waack:
Lower Bounds on The Complexity of Real-Time Branching Programs. RAIRO Theor. Informatics Appl. 22(4): 447-459 (1988) - [c4]Matthias Krause, Christoph Meinel, Stephan Waack:
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. MFCS 1988: 405-413 - 1987
- [c3]Klaus Kriegel, Stephan Waack:
Exponential Lower Bounds for Real-Time Branching Programs. FCT 1987: 263-267 - 1985
- [c2]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 - 1983
- [b1]Stephan Waack:
Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen. Humboldt University of Berlin, Unter den Linden, Germany, 1983 - 1982
- [j1]Lothar Budach, Stephan Waack:
On the Halting Problem for Automata in Cones. J. Inf. Process. Cybern. 18(9): 489-499 (1982) - 1981
- [c1]Stephan Waack:
Tape Complexity of Word Problems. FCT 1981: 467-471
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
