Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Detlef Sieling
@incollection{DBLP:books/sp/voecking2011/Sieling11, author = {Detlef Sieling}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Playing Poker by Email}, booktitle = {Algorithms Unplugged}, pages = {169--180}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-15328-0\_18}, doi = {10.1007/978-3-642-15328-0\_18}, timestamp = {Wed, 14 Jun 2017 20:29:01 +0200}, biburl = {https://dblp.org/rec/books/sp/voecking2011/Sieling11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/10/BolligSSWCH10, author = {Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener and Yves Crama and Peter L. Hammer}, editor = {Yves Crama and Peter L. Hammer}, title = {Binary Decision Diagrams}, booktitle = {Boolean Models and Methods in Mathematics, Computer Science, and Engineering}, pages = {473--505}, publisher = {Cambridge University Press}, year = {2010}, url = {https://doi.org/10.1017/cbo9780511780448.013}, doi = {10.1017/CBO9780511780448.013}, timestamp = {Mon, 16 Sep 2019 14:43:07 +0200}, biburl = {https://dblp.org/rec/books/cu/10/BolligSSWCH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Sieling09, author = {Detlef Sieling}, title = {Minimization Problems for Parity OBDDs}, journal = {Theory Comput. Syst.}, volume = {44}, number = {3}, pages = {391--413}, year = {2009}, url = {https://doi.org/10.1007/s00224-007-9084-8}, doi = {10.1007/S00224-007-9084-8}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Sieling09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Sieling08, author = {Detlef Sieling}, title = {Minimization of decision trees is hard to approximate}, journal = {J. Comput. Syst. Sci.}, volume = {74}, number = {3}, pages = {394--403}, year = {2008}, url = {https://doi.org/10.1016/j.jcss.2007.06.014}, doi = {10.1016/J.JCSS.2007.06.014}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Sieling08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/Sieling08, author = {Detlef Sieling}, editor = {Berthold V{\"{o}}cking and Helmut Alt and Martin Dietzfelbinger and R{\"{u}}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, title = {Poker per E-Mail}, booktitle = {Taschenbuch der Algorithmen}, series = {eXamen.press}, pages = {181--192}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-76394-9\_18}, doi = {10.1007/978-3-540-76394-9\_18}, timestamp = {Tue, 16 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/Sieling08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SauerhoffS05, author = {Martin Sauerhoff and Detlef Sieling}, title = {Quantum branching programs and space-bounded nonuniform quantum complexity}, journal = {Theor. Comput. Sci.}, volume = {334}, number = {1-3}, pages = {177--225}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2004.12.031}, doi = {10.1016/J.TCS.2004.12.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SauerhoffS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SavickyS05, author = {Petr Savick{\'{y}} and Detlef Sieling}, title = {A hierarchy result for read-once branching programs with restricted parity nondeterminism}, journal = {Theor. Comput. Sci.}, volume = {340}, number = {3}, pages = {594--605}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2005.03.016}, doi = {10.1016/J.TCS.2005.03.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SavickyS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Sieling03, author = {Detlef Sieling}, title = {Minimization of Decision Trees Is Hard to Approximate}, booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark}, pages = {84--92}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/CCC.2003.1214412}, doi = {10.1109/CCC.2003.1214412}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Sieling03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Sieling02, author = {Detlef Sieling}, title = {The complexity of minimizing and learning OBDDs and FBDDs}, journal = {Discret. Appl. Math.}, volume = {122}, number = {1-3}, pages = {263--282}, year = {2002}, url = {https://doi.org/10.1016/S0166-218X(01)00324-9}, doi = {10.1016/S0166-218X(01)00324-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Sieling02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Sieling02, author = {Detlef Sieling}, title = {The Nonapproximability of {OBDD} Minimization}, journal = {Inf. Comput.}, volume = {172}, number = {2}, pages = {103--138}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3076}, doi = {10.1006/INCO.2001.3076}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Sieling02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Sieling02, author = {Detlef Sieling}, title = {Lower Bounds for Linearly Transformed OBDDs and FBDDs}, journal = {J. Comput. Syst. Sci.}, volume = {64}, number = {2}, pages = {419--438}, year = {2002}, url = {https://doi.org/10.1006/jcss.2001.1818}, doi = {10.1006/JCSS.2001.1818}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Sieling02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR02-054, author = {Detlef Sieling}, title = {Minimization of Decision Trees is Hard to Approximate}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR02-054}}, year = {2002}, url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-054/index.html}, eprinttype = {ECCC}, eprint = {TR02-054}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-054.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fmsd/SielingW01, author = {Detlef Sieling and Ingo Wegener}, title = {A Comparison of Free BDDs and Transformed BDDs}, journal = {Formal Methods Syst. Des.}, volume = {19}, number = {3}, pages = {223--236}, year = {2001}, url = {https://doi.org/10.1023/A:1011229414976}, doi = {10.1023/A:1011229414976}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fmsd/SielingW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sttt/DrechslerS01, author = {Rolf Drechsler and Detlef Sieling}, title = {Binary decision diagrams in theory and practice}, journal = {Int. J. Softw. Tools Technol. Transf.}, volume = {3}, number = {2}, pages = {112--136}, year = {2001}, url = {https://doi.org/10.1007/s100090100056}, doi = {10.1007/S100090100056}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sttt/DrechslerS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR01-017, author = {Petr Savick{\'{y}} and Detlef Sieling}, title = {A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR01-017}}, year = {2001}, url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-017/index.html}, eprinttype = {ECCC}, eprint = {TR01-017}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Sieling00, author = {Detlef Sieling}, title = {A separation of syntactic and nonsyntactic (1, +k)-branching programs}, journal = {Comput. Complex.}, volume = {9}, number = {3-4}, pages = {247--263}, year = {2000}, url = {https://doi.org/10.1007/PL00001608}, doi = {10.1007/PL00001608}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Sieling00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Sieling00, author = {Detlef Sieling}, editor = {Jos{\'{e}} D. P. Rolim and Andrei Z. Broder and Andrea Corradini and Roberto Gorrieri and Reiko Heckel and Juraj Hromkovic and Ugo Vaccaro and J. B. Wells}, title = {Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms}, booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000}, pages = {259--262}, publisher = {Carleton Scientific, Waterloo, Ontario, Canada}, year = {2000}, timestamp = {Sat, 04 Apr 2020 17:15:23 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Sieling00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/SavickyS00, author = {Petr Savick{\'{y}} and Detlef Sieling}, editor = {Mogens Nielsen and Branislav Rovan}, title = {A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism}, booktitle = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1893}, pages = {650--659}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44612-5\_60}, doi = {10.1007/3-540-44612-5\_60}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/SavickyS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Sieling99, author = {Detlef Sieling}, editor = {C. Pandu Rangan and Venkatesh Raman and Ramaswamy Ramanujam}, title = {Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1738}, pages = {356--368}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46691-6\_29}, doi = {10.1007/3-540-46691-6\_29}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Sieling99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Sieling99, author = {Detlef Sieling}, editor = {Miroslaw Kutylowski and Leszek Pacholski and Tomasz Wierzbicki}, title = {The Complexity of Minimizing FBDDs}, booktitle = {Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1672}, pages = {251--261}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48340-3\_23}, doi = {10.1007/3-540-48340-3\_23}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Sieling99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-001, author = {Detlef Sieling}, title = {The Complexity of Minimizing FBDDs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-001}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-001/index.html}, eprinttype = {ECCC}, eprint = {TR99-001}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-019, author = {Detlef Sieling}, title = {Lower Bounds for Linear Transformed OBDDs and FBDDs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-019}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-019/index.html}, eprinttype = {ECCC}, eprint = {TR99-019}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LobbingSW98, author = {Martin L{\"{o}}bbing and Detlef Sieling and Ingo Wegener}, title = {Parity OBDDs Cannot be Handled Efficiently Enough}, journal = {Inf. Process. Lett.}, volume = {67}, number = {4}, pages = {163--168}, year = {1998}, url = {https://doi.org/10.1016/S0020-0190(98)00113-6}, doi = {10.1016/S0020-0190(98)00113-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LobbingSW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Sieling98, author = {Detlef Sieling}, title = {Variable orderings and the size of OBDDs for random partially symmetric Boolean functions}, journal = {Random Struct. Algorithms}, volume = {13}, number = {1}, pages = {49--70}, year = {1998}, url = {https://doi.org/10.1002/(SICI)1098-2418(199808)13:1\&\#60;49::AID-RSA3\&\#62;3.0.CO;2-S}, doi = {10.1002/(SICI)1098-2418(199808)13:1\&\#60;49::AID-RSA3\&\#62;3.0.CO;2-S}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Sieling98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcad/DrechslerSS98, author = {Rolf Drechsler and Martin Sauerhoff and Detlef Sieling}, title = {The complexity of the inclusion operation on OFDD's}, journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.}, volume = {17}, number = {5}, pages = {457--459}, year = {1998}, url = {https://doi.org/10.1109/43.703943}, doi = {10.1109/43.703943}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcad/DrechslerSS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BolligSSW98, author = {Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener}, title = {Hierarchy Theorems for \emph{k}OBDDs and \emph{k}IBDDs}, journal = {Theor. Comput. Sci.}, volume = {205}, number = {1-2}, pages = {45--60}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(97)00034-0}, doi = {10.1016/S0304-3975(97)00034-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BolligSSW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Sieling98, author = {Detlef Sieling}, editor = {Michel Morvan and Christoph Meinel and Daniel Krob}, title = {On the Existence of Polynomial Time Approximation Schemes for {OBDD} Minimization (Extended Abstract)}, 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 = {205--215}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0028562}, doi = {10.1007/BFB0028562}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Sieling98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-001, author = {Detlef Sieling}, title = {On the Existence of Polynomial Time Approximation Schemes for {OBDD} Minimization}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-001}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-001/index.html}, eprinttype = {ECCC}, eprint = {TR98-001}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-045, author = {Detlef Sieling}, title = {A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-045}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-045/index.html}, eprinttype = {ECCC}, eprint = {TR98-045}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-045.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/Sieling97, author = {Detlef Sieling}, editor = {Ernst W. Mayr and Hans J{\"{u}}rgen Pr{\"{o}}mel and Angelika Steger}, title = {Derandomization}, booktitle = {Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)}, series = {Lecture Notes in Computer Science}, volume = {1367}, pages = {41--62}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0053013}, doi = {10.1007/BFB0053013}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Sieling97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Sieling96, author = {Detlef Sieling}, title = {New Lower Bounds and Hierarchy Results for Restricted Branching Programs}, journal = {J. Comput. Syst. Sci.}, volume = {53}, number = {1}, pages = {79--87}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0050}, doi = {10.1006/JCSS.1996.0050}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Sieling96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Sieling95, author = {Detlef Sieling}, title = {Algorithmen und untere Schranken f{\"{u}}r verallgemeinerte OBDDs}, school = {Technical University of Dortmund, Germany}, year = {1995}, url = {https://d-nb.info/943185815}, isbn = {978-3-8265-0454-9}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Sieling95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SielingW95, author = {Detlef Sieling and Ingo Wegener}, title = {Graph Driven BDDs - {A} New Data Structure for Boolean Functions}, journal = {Theor. Comput. Sci.}, volume = {141}, number = {1{\&}2}, pages = {283--310}, year = {1995}, url = {https://doi.org/10.1016/0304-3975(94)00078-W}, doi = {10.1016/0304-3975(94)00078-W}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SielingW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-002, author = {Detlef Sieling}, title = {New Lower Bounds and Hierarchy Results for Restricted Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-002}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-002/index.html}, eprinttype = {ECCC}, eprint = {TR95-002}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-002.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SielingW94, author = {Detlef Sieling and Ingo Wegener}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {New Lower Bounds and Hierarchy Results for Restricted Branching Programs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {359--370}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_61}, doi = {10.1007/3-540-59071-4\_61}, timestamp = {Sun, 02 Oct 2022 16:17:33 +0200}, biburl = {https://dblp.org/rec/conf/wg/SielingW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR94-026, author = {Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener}, title = {On the Power of Different Types of Restricted Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR94-026}}, year = {1994}, url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-026/index.html}, eprinttype = {ECCC}, eprint = {TR94-026}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-026.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SielingW93, author = {Detlef Sieling and Ingo Wegener}, title = {Reduction of OBDDs in Linear Time}, journal = {Inf. Process. Lett.}, volume = {48}, number = {3}, pages = {139--144}, year = {1993}, url = {https://doi.org/10.1016/0020-0190(93)90256-9}, doi = {10.1016/0020-0190(93)90256-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SielingW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ppl/SielingW93, author = {Detlef Sieling and Ingo Wegener}, title = {NC-Algorithms for Operations on Binary Decision Diagrams}, journal = {Parallel Process. Lett.}, volume = {3}, pages = {3--12}, year = {1993}, url = {https://doi.org/10.1142/S0129626493000022}, doi = {10.1142/S0129626493000022}, timestamp = {Tue, 24 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ppl/SielingW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.