Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stephan Waack
@article{DBLP:journals/ase/HonselHWG21,
author = {Daniel Honsel and
Verena Herbold and
Stephan Waack and
Jens Grabowski},
title = {Investigation and prediction of open source software evolution using
automated parameter mining for agent-based simulation},
journal = {Autom. Softw. Eng.},
volume = {28},
number = {1},
pages = {3},
year = {2021},
url = {https://doi.org/10.1007/s10515-021-00280-3},
doi = {10.1007/S10515-021-00280-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ase/HonselHWG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/DangNHGW21,
author = {Truong Khanh Linh Dang and
Thach Nguyen and
Michael Habeck and
Mehmet G{\"{u}}ltas and
Stephan Waack},
title = {A graph-based algorithm for detecting rigid domains in protein structures},
journal = {{BMC} Bioinform.},
volume = {22},
number = {1},
pages = {66},
year = {2021},
url = {https://doi.org/10.1186/s12859-021-03966-3},
doi = {10.1186/S12859-021-03966-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/DangNHGW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/entropy/DangMTWG16,
author = {Truong Khanh Linh Dang and
Cornelia Meckbach and
Rebecca Tacke and
Stephan Waack and
Mehmet G{\"{u}}ltas},
title = {A Novel Sequence-Based Feature for the Identification of DNA-Binding
Sites in Proteins Using Jensen-Shannon Divergence},
journal = {Entropy},
volume = {18},
number = {10},
pages = {379},
year = {2016},
url = {https://doi.org/10.3390/e18100379},
doi = {10.3390/E18100379},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entropy/DangMTWG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fams/ObermannW16,
author = {Lennart Obermann and
Stephan Waack},
title = {Interpretable Multiclass Models for Corporate Credit Rating Capable
of Expressing Doubt},
journal = {Frontiers Appl. Math. Stat.},
volume = {2},
pages = {16},
year = {2016},
url = {https://doi.org/10.3389/fams.2016.00016},
doi = {10.3389/FAMS.2016.00016},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fams/ObermannW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esem/HonselHWWG16,
author = {Daniel Honsel and
Verena Honsel and
Marlon Welter and
Stephan Waack and
Jens Grabowski},
title = {Monitoring Software Quality by Means of Simulation Methods},
booktitle = {Proceedings of the 10th {ACM/IEEE} International Symposium on Empirical
Software Engineering and Measurement, {ESEM} 2016, Ciudad Real, Spain,
September 8-9, 2016},
pages = {11:1--11:6},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2961111.2962617},
doi = {10.1145/2961111.2962617},
timestamp = {Tue, 06 Nov 2018 16:57:26 +0100},
biburl = {https://dblp.org/rec/conf/esem/HonselHWWG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eumas/AhlbrechtDFGHHW16,
author = {Tobias Ahlbrecht and
J{\"{u}}rgen Dix and
Niklas Fiekas and
Jens Grabowski and
Verena Herbold and
Daniel Honsel and
Stephan Waack and
Marlon Welter},
editor = {Natalia Criado Pacheco and
Carlos Carrascosa and
Nardine Osman and
Vicente Juli{\'{a}}n Inglada},
title = {Agent-Based Simulation for Software Development Processes},
booktitle = {Multi-Agent Systems and Agreement Technologies - 14th European Conference,
{EUMAS} 2016, and 4th International Conference, {AT} 2016, Valencia,
Spain, December 15-16, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10207},
pages = {333--340},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-59294-7\_28},
doi = {10.1007/978-3-319-59294-7\_28},
timestamp = {Thu, 08 Sep 2022 19:48:32 +0200},
biburl = {https://dblp.org/rec/conf/eumas/AhlbrechtDFGHHW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/MeckbachTHWWG15,
author = {Cornelia Meckbach and
Rebecca Tacke and
Xu Hua and
Stephan Waack and
Edgar Wingender and
Mehmet G{\"{u}}ltas},
title = {PC-TraFF: identification of potentially collaborating transcription
factors using pointwise mutual information},
journal = {{BMC} Bioinform.},
volume = {16},
pages = {400:1--400:21},
year = {2015},
url = {https://doi.org/10.1186/s12859-015-0827-2},
doi = {10.1186/S12859-015-0827-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/MeckbachTHWWG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eswa/ObermannW15,
author = {Lennart Obermann and
Stephan Waack},
title = {Demonstrating non-inferiority of easy interpretable methods for insolvency
prediction},
journal = {Expert Syst. Appl.},
volume = {42},
number = {23},
pages = {9117--9128},
year = {2015},
url = {https://doi.org/10.1016/j.eswa.2015.08.009},
doi = {10.1016/J.ESWA.2015.08.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eswa/ObermannW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kbse/HonselHHGW15,
author = {Verena Honsel and
Daniel Honsel and
Steffen Herbold and
Jens Grabowski and
Stephan Waack},
title = {Mining Software Dependency Networks for Agent-Based Simulation of
Software Evolution},
booktitle = {30th {IEEE/ACM} International Conference on Automated Software Engineering
Workshops, {ASE} Workshops 2015, Lincoln, NE, USA, November 9-13,
2015},
pages = {102--108},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/ASEW.2015.9},
doi = {10.1109/ASEW.2015.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kbse/HonselHHGW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sattose/HonselHGW15,
author = {Verena Honsel and
Daniel Honsel and
Jens Grabowski and
Stephan Waack},
editor = {Anya Helene Bagge and
Tom Mens and
Haidar Osman},
title = {Developer Oriented and Quality Assurance Based Simulation of Software
Processes},
booktitle = {Post-proceedings of the 8th Seminar on Advanced Techniques and Tools
for Software Evolution, Mons, Belgium, July 6-8, 2015},
series = {{CEUR} Workshop Proceedings},
volume = {1820},
pages = {5--13},
publisher = {CEUR-WS.org},
year = {2015},
url = {https://ceur-ws.org/Vol-1820/paper-01.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:14 +0100},
biburl = {https://dblp.org/rec/conf/sattose/HonselHGW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/GultasDHJMWW14,
author = {Mehmet G{\"{u}}ltas and
G{\"{u}}ncel D{\"{u}}zg{\"{u}}n and
Sebastian Herzog and
Sven Joachim J{\"{a}}ger and
Cornelia Meckbach and
Edgar Wingender and
Stephan Waack},
title = {Quantum Coupled Mutation Finder: Predicting functionally or structurally
important sites in proteins using quantum Jensen-Shannon divergence
and {CUDA} programming},
journal = {{BMC} Bioinform.},
volume = {15},
pages = {96},
year = {2014},
url = {https://doi.org/10.1186/1471-2105-15-96},
doi = {10.1186/1471-2105-15-96},
timestamp = {Sat, 28 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/GultasDHJMWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/DongWDGWWSW14,
author = {Zhijie Dong and
Keyu Wang and
Truong Khanh Linh Dang and
Mehmet G{\"{u}}ltas and
Marlon Welter and
Torsten Wierschin and
Mario Stanke and
Stephan Waack},
title = {CRF-based models of protein surfaces improve protein-protein interaction
site predictions},
journal = {{BMC} Bioinform.},
volume = {15},
pages = {277},
year = {2014},
url = {https://doi.org/10.1186/1471-2105-15-277},
doi = {10.1186/1471-2105-15-277},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/DongWDGWWSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BrodagHW14,
author = {Thomas Brodag and
Steffen Herbold and
Stephan Waack},
title = {A Generalized Model of {PAC} Learning and its Applicability},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {48},
number = {2},
pages = {209--245},
year = {2014},
url = {https://doi.org/10.1051/ita/2014005},
doi = {10.1051/ITA/2014005},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BrodagHW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/HammesfahrOMWK13,
author = {Bj{\"{o}}rn Hammesfahr and
Florian Odronitz and
Stefanie M{\"{u}}hlhausen and
Stephan Waack and
Martin Kollmar},
title = {GenePainter: a fast tool for aligning gene structures of eukaryotic
protein families, visualizing the alignments and mapping gene structures
onto protein structures},
journal = {{BMC} Bioinform.},
volume = {14},
pages = {77},
year = {2013},
url = {https://doi.org/10.1186/1471-2105-14-77},
doi = {10.1186/1471-2105-14-77},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/HammesfahrOMWK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gcb/2013,
editor = {Tim Bei{\ss}barth and
Martin Kollmar and
Andreas Leha and
Burkhard Morgenstern and
Anne{-}Kathrin Schultz and
Stephan Waack and
Edgar Wingender},
title = {German Conference on Bioinformatics 2013, {GCB} 2013, September 10-13,
2013, G{\"{o}}ttingen, Germany},
series = {OASIcs},
volume = {34},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
isbn = {978-3-939897-59-0},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gcb/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ac/HerboldBGW12,
author = {Steffen Herbold and
Uwe B{\"{u}}nting and
Jens Grabowski and
Stephan Waack},
title = {Deployable Capture/Replay Supported by Internal Messages},
journal = {Adv. Comput.},
volume = {85},
pages = {327--367},
year = {2012},
url = {https://doi.org/10.1016/B978-0-12-396526-4.00007-2},
doi = {10.1016/B978-0-12-396526-4.00007-2},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ac/HerboldBGW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/GultasHTW12,
author = {Mehmet G{\"{u}}ltas and
Martin Haubrock and
Nesrin T{\"{u}}ys{\"{u}}z and
Stephan Waack},
title = {Coupled Mutation Finder: {A} new entropy-based method quantifying
phylogenetic noise for the detection of compensatory mutations},
journal = {{BMC} Bioinform.},
volume = {13},
pages = {225},
year = {2012},
url = {https://doi.org/10.1186/1471-2105-13-225},
doi = {10.1186/1471-2105-13-225},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/GultasHTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/KellerKSW11,
author = {Oliver Keller and
Martin Kollmar and
Mario Stanke and
Stephan Waack},
title = {A novel hybrid gene prediction method employing protein multiple sequence
alignments},
journal = {Bioinform.},
volume = {27},
number = {6},
pages = {757--763},
year = {2011},
url = {https://doi.org/10.1093/bioinformatics/btr010},
doi = {10.1093/BIOINFORMATICS/BTR010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/KellerKSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ese/HerboldGW11,
author = {Steffen Herbold and
Jens Grabowski and
Stephan Waack},
title = {Calculation and optimization of thresholds for sets of software metrics},
journal = {Empir. Softw. Eng.},
volume = {16},
number = {6},
pages = {812--841},
year = {2011},
url = {https://doi.org/10.1007/s10664-011-9162-z},
doi = {10.1007/S10664-011-9162-Z},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ese/HerboldGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icst/HerboldGWB11,
author = {Steffen Herbold and
Jens Grabowski and
Stephan Waack and
Uwe B{\"{u}}nting},
title = {Improved Bug Reporting and Reproduction through Non-intrusive {GUI}
Usage Monitoring and Automated Replaying},
booktitle = {Fourth {IEEE} International Conference on Software Testing, Verification
and Validation, {ICST} 2012, Berlin, Germany, 21-25 March, 2011, Workshop
Proceedings},
pages = {232--241},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/ICSTW.2011.66},
doi = {10.1109/ICSTW.2011.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icst/HerboldGWB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ssiri/HerboldGW11,
author = {Steffen Herbold and
Jens Grabowski and
Stephan Waack},
title = {A Model for Usage-Based Testing of Event-Driven Software},
booktitle = {Fifth International Conference on Secure Software Integration and
Reliability Improvement, {SSIRI} 2011, 27-29 June, 2011, Jeju Island,
Korea - Companion Volume},
pages = {172--178},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/SSIRI-C.2011.32},
doi = {10.1109/SSIRI-C.2011.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ssiri/HerboldGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/stt/HerboldGNW10,
author = {Steffen Herbold and
Jens Grabowski and
Helmut Neukirchen and
Stephan Waack},
title = {Retrospective Analysis of Software Projects using k-Means Clustering},
journal = {Softwaretechnik-Trends},
volume = {30},
number = {2},
year = {2010},
url = {http://pi.informatik.uni-siegen.de/stt/30\_2/01\_Fachgruppenberichte/WSR2010/07-herbold+.pdf},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/stt/HerboldGNW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/KellerOSKW08,
author = {Oliver Keller and
Florian Odronitz and
Mario Stanke and
Martin Kollmar and
Stephan Waack},
title = {Scipio: Using protein sequences to determine the precise exon/intron
structures of genes and their orthologs in closely related species},
journal = {{BMC} Bioinform.},
volume = {9},
year = {2008},
url = {https://doi.org/10.1186/1471-2105-9-278},
doi = {10.1186/1471-2105-9-278},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/KellerOSKW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrosenneDHW07,
author = {Henrik Brosenne and
Carsten Damm and
Matthias Homeister and
Stephan Waack},
title = {On approximation by XOR-OBDDs},
journal = {Inf. Process. Lett.},
volume = {102},
number = {1},
pages = {17--21},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.10.011},
doi = {10.1016/J.IPL.2006.10.011},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrosenneDHW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdl/WernerGNRWZ07,
author = {Edith Werner and
Jens Grabowski and
Helmut Neukirchen and
Nils R{\"{o}}ttger and
Stephan Waack and
Benjamin Zeiss},
editor = {Emmanuel Gaudin and
Elie Najm and
Rick Reed},
title = {{TTCN-3} Quality Engineering: Using Learning Techniques to Evaluate
Metric Sets},
booktitle = {{SDL} 2007: Design for Dependable Systems, 13th International {SDL}
Forum, Paris, France, September 18-21, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4745},
pages = {54--68},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74984-4\_4},
doi = {10.1007/978-3-540-74984-4\_4},
timestamp = {Tue, 12 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sdl/WernerGNRWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/MeinickeBFW06,
author = {Peter Meinicke and
Thomas Brodag and
Wolfgang Florian Fricke and
Stephan Waack},
title = {P-value based visualization of codon usage data},
journal = {Algorithms Mol. Biol.},
volume = {1},
year = {2006},
url = {https://doi.org/10.1186/1748-7188-1-10},
doi = {10.1186/1748-7188-1-10},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/MeinickeBFW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/StankeSMW06,
author = {Mario Stanke and
Oliver Sch{\"{o}}ffmann and
Burkhard Morgenstern and
Stephan Waack},
title = {Gene prediction in eukaryotes with a generalized hidden Markov model
that uses hints from external sources},
journal = {{BMC} Bioinform.},
volume = {7},
pages = {62},
year = {2006},
url = {https://doi.org/10.1186/1471-2105-7-62},
doi = {10.1186/1471-2105-7-62},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/StankeSMW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/WaackKABDFSMM06,
author = {Stephan Waack and
Oliver Keller and
Roman Asper and
Thomas Brodag and
Carsten Damm and
Wolfgang Florian Fricke and
Katharina Surovcik and
Peter Meinicke and
Rainer Merkl},
title = {Score-based prediction of genomic islands in prokaryotic genomes using
hidden Markov models},
journal = {{BMC} Bioinform.},
volume = {7},
pages = {142},
year = {2006},
url = {https://doi.org/10.1186/1471-2105-7-142},
doi = {10.1186/1471-2105-7-142},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/WaackKABDFSMM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrosenneHW06,
author = {Henrik Brosenne and
Matthias Homeister and
Stephan Waack},
title = {Nondeterministic ordered binary decision diagrams with repeated tests
and various modes of acceptance},
journal = {Inf. Process. Lett.},
volume = {98},
number = {1},
pages = {6--10},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.11.011},
doi = {10.1016/J.IPL.2005.11.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrosenneHW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/StankeKGHWM06,
author = {Mario Stanke and
Oliver Keller and
Irfan Gunduz and
Alec Hayes and
Stephan Waack and
Burkhard Morgenstern},
title = {{AUGUSTUS:} \emph{ab initio} prediction of alternative transcripts},
journal = {Nucleic Acids Res.},
volume = {34},
number = {Web-Server-Issue},
pages = {435--439},
year = {2006},
url = {https://doi.org/10.1093/nar/gkl200},
doi = {10.1093/NAR/GKL200},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nar/StankeKGHWM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BolligWW06,
author = {Beate Bollig and
Stephan Waack and
Philipp Woelfel},
title = {Parity graph-driven read-once branching programs and an exponential
lower bound for integer multiplication},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {86--99},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.035},
doi = {10.1016/J.TCS.2006.05.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BolligWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DammKMW04,
author = {Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {On relations between counting communication complexity classes},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {259--280},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.002},
doi = {10.1016/J.JCSS.2004.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DammKMW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/StankeSWM04,
author = {Mario Stanke and
Rasmus Steinkamp and
Stephan Waack and
Burkhard Morgenstern},
title = {{AUGUSTUS:} a web server for gene finding in eukaryotes},
journal = {Nucleic Acids Res.},
volume = {32},
number = {Web-Server-Issue},
pages = {309--312},
year = {2004},
url = {https://doi.org/10.1093/nar/gkh379},
doi = {10.1093/NAR/GKH379},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nar/StankeSWM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0009525,
author = {Rainer Merkl and
Stephan Waack},
title = {Bioinformatik interaktiv - Algorithmen und Praxis},
publisher = {Wiley-VCH},
year = {2003},
isbn = {978-3-527-30662-6},
timestamp = {Tue, 12 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0009525.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eccb/StankeW03,
author = {Mario Stanke and
Stephan Waack},
title = {Gene prediction with a hidden Markov model and a new intron submodel},
booktitle = {Proceedings of the European Conference on Computational Biology {(ECCB}
2003), September 27-30, 2003, Paris, France},
pages = {215--225},
year = {2003},
timestamp = {Mon, 27 Oct 2003 15:56:17 +0100},
biburl = {https://dblp.org/rec/conf/eccb/StankeW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrosenneHW03,
author = {Henrik Brosenne and
Matthias Homeister and
Stephan Waack},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {290--299},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_23},
doi = {10.1007/978-3-540-45138-9\_23},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrosenneHW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BrosenneHW02,
author = {Henrik Brosenne and
Matthias Homeister and
Stephan Waack},
title = {Characterizing the Complexity of Boolean Functions represented by
Well-Structured Graph-Driven Parity-FBDDs},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {36},
number = {3},
pages = {229--247},
year = {2002},
url = {https://doi.org/10.1051/ita:2002011},
doi = {10.1051/ITA:2002011},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BrosenneHW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BolligWW02,
author = {Beate Bollig and
Stephan Waack and
Philipp Woelfel},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Parity Graph-driven Read-Once Branching Programs and an Exponential
Lower Bound for Integer Multiplication},
booktitle = {Foundations of Information Technology in the Era of Networking and
Mobile Computing, {IFIP} 17\({}^{\mbox{th}}\) World Computer Congress
- {TC1} Stream / 2\({}^{\mbox{nd}}\) {IFIP} International Conference
on Theoretical Computer Science {(TCS} 2002), August 25-30, 2002,
Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {83--94},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_8},
doi = {10.1007/978-0-387-35608-2\_8},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/BolligWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MeinelW01,
author = {Christoph Meinel and
Stephan Waack},
title = {The "log rank" conjecture for modular communication complexity},
journal = {Comput. Complex.},
volume = {10},
number = {1},
pages = {70--91},
year = {2001},
url = {https://doi.org/10.1007/PL00001612},
doi = {10.1007/PL00001612},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MeinelW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Waack01,
author = {Stephan Waack},
title = {On the Descriptive and Algorithmic Power of Parity Ordered Binary
Decision Diagrams},
journal = {Inf. Comput.},
volume = {166},
number = {1},
pages = {61--70},
year = {2001},
url = {https://doi.org/10.1006/inco.2000.3022},
doi = {10.1006/INCO.2000.3022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Waack01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrosenneHW01,
author = {Henrik Brosenne and
Matthias Homeister and
Stephan Waack},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {212--223},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_19},
doi = {10.1007/3-540-44683-4\_19},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrosenneHW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-073,
author = {Beate Bollig and
Philipp Woelfel and
Stephan Waack},
title = {Parity Graph-driven Read-Once Branching Programs and an Exponential
Lower Bound for Integer Multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-073}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-073/index.html},
eprinttype = {ECCC},
eprint = {TR01-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BehrensW98,
author = {Jan Behrens and
Stephan Waack},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Equivalence Test and Ordering Transformation for Parity-OBDDs of Different
Variable Ordering},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {227--237},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028564},
doi = {10.1007/BFB0028564},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BehrensW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Waack97,
author = {Stephan Waack},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {On the Descriptive and Algorithmic Power of Parity Ordered Binary
Decision Diagrams},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {201--212},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023460},
doi = {10.1007/BFB0023460},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Waack97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MeinelW96,
author = {Christoph Meinel and
Stephan Waack},
title = {Lower Bounds for the Majority Communication Complexity of Various
Graph Accessibility Problems},
journal = {Math. Syst. Theory},
volume = {29},
number = {6},
pages = {649--659},
year = {1996},
url = {https://doi.org/10.1007/bf01301969},
doi = {10.1007/BF01301969},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MeinelW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MeinelW96,
author = {Christoph Meinel and
Stephan Waack},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The "log Rank" Conjecture for Modular Communication Complexity},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {619--630},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_50},
doi = {10.1007/3-540-60922-9\_50},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MeinelW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-017,
author = {Christoph Meinel and
Stephan Waack},
title = {The "Log Rank" Conjecture for Modular Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-017}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-017/index.html},
eprinttype = {ECCC},
eprint = {TR96-017},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MeinelW95,
author = {Christoph Meinel and
Stephan Waack},
title = {Separating Complexity Classes Related to Bounded Alternating {\textbackslash}omega-Branching
Programs},
journal = {Math. Syst. Theory},
volume = {28},
number = {1},
pages = {21--39},
year = {1995},
url = {https://doi.org/10.1007/BF01294594},
doi = {10.1007/BF01294594},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MeinelW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KrauseW95,
author = {Matthias Krause and
Stephan Waack},
title = {Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two
Circuits Having Nearly Symmetric Gates with Unbounded Fan-In},
journal = {Math. Syst. Theory},
volume = {28},
number = {6},
pages = {553--564},
year = {1995},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KrauseW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MeinelW95,
author = {Christoph Meinel and
Stephan Waack},
editor = {Ricardo A. Baeza{-}Yates and
Eric Goles Ch. and
Patricio V. Poblete},
title = {Lower Bounds for the Modular Communication Complexity of Various Graph
Accessibility Problems},
booktitle = {{LATIN} '95: Theoretical Informatics, Second Latin American Symposium,
Valpara{\'{\i}}so, Chile, April 3-7, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {911},
pages = {427--435},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59175-3\_107},
doi = {10.1007/3-540-59175-3\_107},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/MeinelW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MeinelW95,
author = {Christoph Meinel and
Stephan Waack},
editor = {Jir{\'{\i}} Wiedermann and
Petr H{\'{a}}jek},
title = {Lower Bounds for the Majority Communication Complexity of Various
Graph Accessibility Problems},
booktitle = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {969},
pages = {299--308},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60246-1\_136},
doi = {10.1007/3-540-60246-1\_136},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MeinelW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-034,
author = {Christoph Meinel and
Stephan Waack},
title = {Lower Bounds for the Majority Communication Complexity of Various
Graph Accessibility Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-034}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-034/index.html},
eprinttype = {ECCC},
eprint = {TR95-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/DammKMW94,
author = {Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Separating Oblivious Linear Length MOD\({}_{\mbox{p}}\)-Branching
Program Classes},
journal = {J. Inf. Process. Cybern.},
volume = {30},
number = {2},
pages = {63--75},
year = {1994},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/DammKMW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cfcp/Waack94,
author = {Stephan Waack},
editor = {Michel Cosnard and
Afonso Ferreira and
Joseph G. Peters},
title = {On the Parallel Complexity of Iterated Multiplication in Rings of
Algebraic Integers},
booktitle = {Parallel and Distributed Computing, First Canada-France Conference,
Montr{\'{e}}al, Canada, May 19-21, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {805},
pages = {35--44},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58078-6\_4},
doi = {10.1007/3-540-58078-6\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/cfcp/Waack94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-022,
author = {Christoph Meinel and
Stephan Waack},
title = {The M{\"{o}}bius Function, Variations Ranks, and Theta(n)-Bounds
on the Modular Communication Complexity of the Undirected Graph Connectivity
Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR94-022}},
year = {1994},
url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-022/index.html},
eprinttype = {ECCC},
eprint = {TR94-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI94-04,
author = {Christoph Meinel and
Stephan Waack},
title = {The M{\"{o}}bius Function, Variations Ranks, and Theta(n)-Bounds
on the Modular Communication Complexity of the Undirected Graph Connectivity
Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {94-04},
year = {1994},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI94-04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MeinelW93,
author = {Christoph Meinel and
Stephan Waack},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {Separating Complexity Classes Related to Bounded Alternating omega-Branching
Programs},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {379--388},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_269},
doi = {10.1007/3-540-57568-5\_269},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MeinelW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HromkovicKMW92,
author = {Juraj Hromkovic and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Branching Programs Provide Lower Bounds on the Areas of Multilective
Deterministic and Nondeterministic VLSI-Circuits},
journal = {Inf. Comput.},
volume = {96},
number = {2},
pages = {168--178},
year = {1992},
url = {https://doi.org/10.1016/0890-5401(92)90046-I},
doi = {10.1016/0890-5401(92)90046-I},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HromkovicKMW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/KrauseMW92,
author = {Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Separating complexity classes related to certain input oblivious logarithmic
space-bounded turing machines},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {26},
pages = {345--362},
year = {1992},
url = {https://doi.org/10.1051/ita/1992260403451},
doi = {10.1051/ITA/1992260403451},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/KrauseMW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MeinelW92,
author = {Christoph Meinel and
Stephan Waack},
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Upper and Lower Bounds for Certain Graph Accessibility Problems on
Bounded Alternating omega-Branching Programs},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
pages = {273--290},
publisher = {Cambridge University Press},
year = {1992},
timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MeinelW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DammKMW92,
author = {Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
editor = {Alain Finkel and
Matthias Jantzen},
title = {Separating Counting Communication Complexity Classes},
booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer
Science, Cachan, France, February 13-15, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {577},
pages = {281--292},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55210-3\_190},
doi = {10.1007/3-540-55210-3\_190},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DammKMW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-01,
author = {Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Separating Counting Communication Complexity Classes},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-01},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-04,
author = {Christoph Meinel and
Stephan Waack},
title = {Upper and Lower Bounds for Certain Graph-Accessability-Problems on
Bounded Alternating (omega)-Branching Programs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-04},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/WaackK91,
author = {Stephan Waack and
Matthias Krause},
title = {On Oblivious Branching Programs of Linear Length},
journal = {Inf. Comput.},
volume = {94},
number = {2},
pages = {232--249},
year = {1991},
url = {https://doi.org/10.1016/0890-5401(91)90039-5},
doi = {10.1016/0890-5401(91)90039-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/WaackK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Waack91,
author = {Stephan Waack},
title = {On the parallel complexity of linear groups},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {25},
pages = {323--354},
year = {1991},
url = {https://doi.org/10.1051/ita/1991250403231},
doi = {10.1051/ITA/1991250403231},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Waack91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrauseMW91,
author = {Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Separating the Eraser Turing Machine Classes L{\_}e, NL{\_}e, co-NL{\_}e
and P{\_}e},
journal = {Theor. Comput. Sci.},
volume = {86},
number = {2},
pages = {267--275},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90021-S},
doi = {10.1016/0304-3975(91)90021-S},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrauseMW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KrauseW91,
author = {Matthias Krause and
Stephan Waack},
title = {Variation Ranks of Communication Matrices and Lower Bounds for Depth
Two Circuits Having Symmetric Gates with Unbounded Fan-In},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {777--782},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185448},
doi = {10.1109/SFCS.1991.185448},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KrauseW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MeinelW91,
author = {Christoph Meinel and
Stephan Waack},
editor = {Andrzej Tarlecki},
title = {Upper and Lower Bounds for Certain Graph-Accessibility Problems on
Bounded Alternating Omega-Branching Programs},
booktitle = {Mathematical Foundations of Computer Science 1991, 16th International
Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {520},
pages = {337--345},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54345-7\_77},
doi = {10.1007/3-540-54345-7\_77},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MeinelW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Waack90,
author = {Stephan Waack},
title = {The Parallel Complexity of Some Constructions in Combinatorial Group
Theory},
journal = {J. Inf. Process. Cybern.},
volume = {26},
number = {5/6},
pages = {265--281},
year = {1990},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Waack90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Waack90,
author = {Stephan Waack},
editor = {Branislav Rovan},
title = {The Parallel Complexity of Some Constructions in Combinatorial Group
Theory (Abstract)},
booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {452},
pages = {492--498},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0029647},
doi = {10.1007/BFB0029647},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Waack90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Waack89,
author = {Stephan Waack},
title = {Obere und untere Schranken f{\"{u}}r Schaltkreise und Verzweigungsprogramme},
school = {Academy of Sciences of the German Democratic Republic, Berlin, Germany},
year = {1989},
url = {https://d-nb.info/900514817},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Waack89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KrauseMW89,
author = {Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic
Space-Bounded Turing Machines},
booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
pages = {240--249},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SCT.1989.41831},
doi = {10.1109/SCT.1989.41831},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KrauseMW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KrauseW89,
author = {Matthias Krause and
Stephan Waack},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {On Oblivious Branching Programs of Linear Length (Extended Abstract)},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {287--296},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_28},
doi = {10.1007/3-540-51498-8\_28},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/KrauseW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/KrauseMW89,
author = {Matthias Krause and
Christoph Meinel and
Stephan Waack},
editor = {Gerhard X. Ritter},
title = {Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded
Turing Machines},
booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer
Congress, San Francisco, USA, August 28 - September 1, 1989},
pages = {287--292},
publisher = {North-Holland/IFIP},
year = {1989},
timestamp = {Wed, 02 Feb 2022 21:17:54 +0100},
biburl = {https://dblp.org/rec/conf/ifip/KrauseMW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/KriegelW88,
author = {Klaus Kriegel and
Stephan Waack},
title = {Lower Bounds on The Complexity of Real-Time Branching Programs},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {22},
number = {4},
pages = {447--459},
year = {1988},
url = {https://doi.org/10.1051/ita/1988220404471},
doi = {10.1051/ITA/1988220404471},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/KriegelW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrauseMW88,
author = {Matthias Krause and
Christoph Meinel and
Stephan Waack},
editor = {Michal Chytil and
Ladislav Janiga and
V{\'{a}}clav Koubek},
title = {Separating the Eraser Turing Machine Classes L\({}_{\mbox{e}}\), NL\({}_{\mbox{e}}\),
co-NL\({}_{\mbox{e}}\) and P\({}_{\mbox{e}}\)},
booktitle = {Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad,
Czechoslovakia, August 29 - September 2, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {324},
pages = {405--413},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0017163},
doi = {10.1007/BFB0017163},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KrauseMW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KriegelW87,
author = {Klaus Kriegel and
Stephan Waack},
editor = {Lothar Budach and
Rais Gatic Bakharajev and
Oleg Borisovic Lipanov},
title = {Exponential Lower Bounds for Real-Time Branching Programs},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'87,
Kazan, USSR, June 22-26, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {278},
pages = {263--267},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18740-5\_55},
doi = {10.1007/3-540-18740-5\_55},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/KriegelW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KriegelW85,
author = {Klaus Kriegel and
Stephan Waack},
editor = {Lothar Budach},
title = {Lower bounds for Boolean formulae of depth 3 and the topology of the
n-cube (preliminary version)},
booktitle = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September
9-13, 1985},
series = {Lecture Notes in Computer Science},
volume = {199},
pages = {227--233},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0028806},
doi = {10.1007/BFB0028806},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/KriegelW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Waack83,
author = {Stephan Waack},
title = {Raumkomplexit{\"{a}}t von Wortproblemen endlicher Gruppenpr{\"{a}}sentationen},
school = {Humboldt University of Berlin, Unter den Linden, Germany},
year = {1983},
url = {https://d-nb.info/831139234},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Waack83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/BudachW82,
author = {Lothar Budach and
Stephan Waack},
title = {On the Halting Problem for Automata in Cones},
journal = {J. Inf. Process. Cybern.},
volume = {18},
number = {9},
pages = {489--499},
year = {1982},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/BudachW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Waack81,
author = {Stephan Waack},
editor = {Ferenc G{\'{e}}cseg},
title = {Tape Complexity of Word Problems},
booktitle = {Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981
International FCT-Conference, Szeged, Hungary, August 24-28, 1981},
series = {Lecture Notes in Computer Science},
volume = {117},
pages = {467--471},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/3-540-10854-8\_50},
doi = {10.1007/3-540-10854-8\_50},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Waack81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-10-29 21:34 CET 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:
