Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Gerd Wechsung
@article{DBLP:journals/jgt/MonienW18, author = {Burkhard Monien and Gerd Wechsung}, title = {Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube}, journal = {J. Graph Theory}, volume = {87}, number = {4}, pages = {561--580}, year = {2018}, url = {https://doi.org/10.1002/jgt.22175}, doi = {10.1002/JGT.22175}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MonienW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GrosseRW06, author = {Andr{\'{e}} Gro{\ss}e and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {On computing the smallest four-coloring of planar graphs and non-self-reducible sets in {P}}, journal = {Inf. Process. Lett.}, volume = {99}, number = {6}, pages = {215--221}, year = {2006}, url = {https://doi.org/10.1016/j.ipl.2006.04.007}, doi = {10.1016/J.IPL.2006.04.007}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GrosseRW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jucs/GlasserW03, author = {Christian Gla{\ss}er and Gerd Wechsung}, title = {Relativizing Function Classes}, journal = {J. Univers. Comput. Sci.}, volume = {9}, number = {1}, pages = {34--50}, year = {2003}, url = {https://doi.org/10.3217/jucs-009-01-0034}, doi = {10.3217/JUCS-009-01-0034}, timestamp = {Thu, 07 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jucs/GlasserW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HemaspaandraOW02, author = {Lane A. Hemaspaandra and Mitsunori Ogihara and Gerd Wechsung}, title = {Reducing the Number of Solutions of {NP} Functions}, journal = {J. Comput. Syst. Sci.}, volume = {64}, number = {2}, pages = {311--328}, year = {2002}, url = {https://doi.org/10.1006/jcss.2001.1815}, doi = {10.1006/JCSS.2001.1815}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraOW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GrosseRW02, author = {Andr{\'{e}} Gro{\ss}e and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones}, journal = {Theory Comput. Syst.}, volume = {35}, number = {1}, pages = {81--93}, year = {2002}, url = {https://doi.org/10.1007/s00224-001-1048-9}, doi = {10.1007/S00224-001-1048-9}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/GrosseRW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HemaspaandraW02, author = {Edith Hemaspaandra and Gerd Wechsung}, title = {The Minimization Problem for Boolean Formulas}, journal = {{SIAM} J. Comput.}, volume = {31}, number = {6}, pages = {1948--1958}, year = {2002}, url = {https://doi.org/10.1137/S0097539799362639}, doi = {10.1137/S0097539799362639}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ictcs/GrosseRW01, author = {Andr{\'{e}} Gro{\ss}e and J{\"{o}}rg Rothe and Gerd Wechsung}, editor = {Antonio Restivo and Simona Ronchi Della Rocca and Luca Roversi}, title = {Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions}, booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001, Torino, Italy, October 4-6, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2202}, pages = {339--356}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45446-2\_22}, doi = {10.1007/3-540-45446-2\_22}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/ictcs/GrosseRW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-0106041, author = {Andr{\'{e}} Gro{\ss}e and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones}, journal = {CoRR}, volume = {cs.CC/0106041}, year = {2001}, url = {https://arxiv.org/abs/cs/0106041}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106041.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-0106045, author = {Andr{\'{e}} Gro{\ss}e and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs}, journal = {CoRR}, volume = {cs.CC/0106045}, year = {2001}, url = {https://arxiv.org/abs/cs/0106045}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106045.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/HempelW00, author = {Harald Hempel and Gerd Wechsung}, title = {The Operators min and max on the Polynomial Hierarchy}, journal = {Int. J. Found. Comput. Sci.}, volume = {11}, number = {2}, pages = {315--342}, year = {2000}, url = {https://doi.org/10.1142/S0129054100000181}, doi = {10.1142/S0129054100000181}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/HempelW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/HemaspaandraOW00, author = {Lane A. Hemaspaandra and Mitsunori Ogihara and Gerd Wechsung}, editor = {Mogens Nielsen and Branislav Rovan}, title = {Reducing the Number of Solutions of {NP} Functions}, 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 = {394--404}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44612-5\_35}, doi = {10.1007/3-540-44612-5\_35}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraOW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/HemaspaandraHW99, author = {Lane A. Hemaspaandra and Harald Hempel and Gerd Wechsung}, title = {Self-Specifying Machines}, journal = {Int. J. Found. Comput. Sci.}, volume = {10}, number = {3}, pages = {263--276}, year = {1999}, url = {https://doi.org/10.1142/S0129054199000198}, doi = {10.1142/S0129054199000198}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/HemaspaandraHW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CaiHW99, author = {Jin{-}yi Cai and Lane A. Hemaspaandra and Gerd Wechsung}, title = {Robust Reductions}, journal = {Theory Comput. Syst.}, volume = {32}, number = {6}, pages = {625--647}, year = {1999}, url = {https://doi.org/10.1007/s002240000134}, doi = {10.1007/S002240000134}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/CaiHW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-9906033, author = {Jin{-}yi Cai and Lane A. Hemaspaandra and Gerd Wechsung}, title = {Robust Reductions}, journal = {CoRR}, volume = {cs.CC/9906033}, year = {1999}, url = {https://arxiv.org/abs/cs/9906033}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-9906033.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-9907035, author = {Lane A. Hemaspaandra and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {Easy Sets and Hard Certificate Schemes}, journal = {CoRR}, volume = {cs.CC/9907035}, year = {1999}, url = {https://arxiv.org/abs/cs/9907035}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907035.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-9909020, author = {Lane A. Hemaspaandra and Harald Hempel and Gerd Wechsung}, title = {Query Order}, journal = {CoRR}, volume = {cs.CC/9909020}, year = {1999}, url = {https://arxiv.org/abs/cs/9909020}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-9909020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-9910006, author = {Lane A. Hemaspaandra and Harald Hempel and Gerd Wechsung}, title = {Self-Specifying Machines}, journal = {CoRR}, volume = {cs.CC/9910006}, year = {1999}, url = {https://arxiv.org/abs/cs/9910006}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BezrukovMUW98, author = {Sergei L. Bezrukov and Burkhard Monien and Walter Unger and Gerd Wechsung}, title = {Embedding ladders and caterpillars into the hypercube}, journal = {Discret. Appl. Math.}, volume = {83}, number = {1-3}, pages = {21--29}, year = {1998}, url = {https://doi.org/10.1016/S0166-218X(97)00101-7}, doi = {10.1016/S0166-218X(97)00101-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BezrukovMUW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HemaspaandraHW98, author = {Lane A. Hemaspaandra and Harald Hempel and Gerd Wechsung}, title = {Query Order}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {2}, pages = {637--651}, year = {1998}, url = {https://doi.org/10.1137/S0097539796297632}, doi = {10.1137/S0097539796297632}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/CaiHW98, author = {Jin{-}yi Cai and Lane A. Hemaspaandra and Gerd Wechsung}, editor = {Wen{-}Lian Hsu and Ming{-}Yang Kao}, title = {Robust Reductions}, booktitle = {Computing and Combinatorics, 4th Annual International Conference, {COCOON} '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1449}, pages = {174--183}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/3-540-68535-9\_21}, doi = {10.1007/3-540-68535-9\_21}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/CaiHW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/HemaspaandraRW97, author = {Lane A. Hemaspaandra and J{\"{o}}rg Rothe and Gerd Wechsung}, title = {Easy Sets and Hard Certificate Schemes}, journal = {Acta Informatica}, volume = {34}, number = {11}, pages = {859--879}, year = {1997}, url = {https://doi.org/10.1007/s002360050109}, doi = {10.1007/S002360050109}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/HemaspaandraRW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HinrichsW97, author = {Maren Hinrichs and Gerd Wechsung}, title = {Time Bounded Frequency Computations}, journal = {Inf. Comput.}, volume = {139}, number = {2}, pages = {234--257}, year = {1997}, url = {https://doi.org/10.1006/inco.1997.2666}, doi = {10.1006/INCO.1997.2666}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/HinrichsW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/HemaspaandraRW97, author = {Lane A. Hemaspaandra and J{\"{o}}rg Rothe and Gerd Wechsung}, editor = {Gian Carlo Bongiovanni and Daniel P. Bovet and Giuseppe Di Battista}, title = {On Sets with Easy Certificates and the Existence of One-Way Permutations}, booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome, Italy, March 12-14, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1203}, pages = {264--275}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-62592-5\_78}, doi = {10.1007/3-540-62592-5\_78}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraRW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HinrichsW97, author = {Maren Hinrichs and Gerd Wechsung}, title = {Time Bounded Frequency Computations}, booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997}, pages = {185--192}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/CCC.1997.612314}, doi = {10.1109/CCC.1997.612314}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/HinrichsW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HemaspaandraW97, author = {Edith Hemaspaandra and Gerd Wechsung}, title = {The Minimization Problem for Boolean Formulas}, booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97, Miami Beach, Florida, USA, October 19-22, 1997}, pages = {575--584}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SFCS.1997.646147}, doi = {10.1109/SFCS.1997.646147}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HemaspaandraW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HempelW97, author = {Harald Hempel and Gerd Wechsung}, editor = {R{\"{u}}diger Reischuk and Michel Morvan}, title = {The Operators min and max on the Polynomial Hierarchy}, 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 = {93--104}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0023451}, doi = {10.1007/BFB0023451}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HempelW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-025, author = {Harald Hempel and Gerd Wechsung}, title = {The Operators min and max on the Polynomial Hierarchy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-025}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-025/index.html}, eprinttype = {ECCC}, eprint = {TR97-025}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-025.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/PreilowskiDW92, author = {Waldemar Preilowski and Elias Dahlhaus and Gerd Wechsung}, editor = {Ivan M. Havel and V{\'{a}}clav Koubek}, title = {New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space}, booktitle = {Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {629}, pages = {442--450}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55808-X\_43}, doi = {10.1007/3-540-55808-X\_43}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/PreilowskiDW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BeigelHW91, author = {Richard Beigel and Lane A. Hemachandra and Gerd Wechsung}, title = {Probabilistic Polynomial Time is Closed under Parity Reductions}, journal = {Inf. Process. Lett.}, volume = {37}, number = {2}, pages = {91--94}, year = {1991}, url = {https://doi.org/10.1016/0020-0190(91)90140-D}, doi = {10.1016/0020-0190(91)90140-D}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BeigelHW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HemachandraW91, author = {Lane A. Hemachandra and Gerd Wechsung}, title = {Kolmogorov Characterizations of Complexity Classes}, journal = {Theor. Comput. Sci.}, volume = {83}, number = {2}, pages = {313--322}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90282-7}, doi = {10.1016/0304-3975(91)90282-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HemachandraW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GundermannNW90, author = {Thomas Gundermann and Nasser Ali Nasser and Gerd Wechsung}, title = {A Survey on Counting Classes}, booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July 8-11, 1990}, pages = {140--153}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/SCT.1990.113963}, doi = {10.1109/SCT.1990.113963}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GundermannNW90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CaiGHHSWW89, author = {Jin{-}yi Cai and Thomas Gundermann and Juris Hartmanis and Lane A. Hemachandra and Vivian Sewelson and Klaus W. Wagner and Gerd Wechsung}, title = {The Boolean Hierarchy {II:} Applications}, journal = {{SIAM} J. Comput.}, volume = {18}, number = {1}, pages = {95--111}, year = {1989}, url = {https://doi.org/10.1137/0218007}, doi = {10.1137/0218007}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CaiGHHSWW89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BeigelHW89, author = {Richard Beigel and Lane A. Hemachandra and Gerd Wechsung}, title = {On the Power of Probabilistic Polynomial Time: P\({}^{\mbox{NP[log]}}\) subseteq {PP}}, booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference, University of Oregon, Eugene, Oregon, USA, June 19-22, 1989}, pages = {225--227}, publisher = {{IEEE} Computer Society}, year = {1989}, url = {https://doi.org/10.1109/SCT.1989.41828}, doi = {10.1109/SCT.1989.41828}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BeigelHW89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip/HemachandraW89, author = {Lane A. Hemachandra and Gerd Wechsung}, editor = {Gerhard X. Ritter}, title = {Using Randomness to Characterize the Complexity of Computation}, booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer Congress, San Francisco, USA, August 28 - September 1, 1989}, pages = {281--286}, publisher = {North-Holland/IFIP}, year = {1989}, timestamp = {Wed, 02 Feb 2022 21:17:54 +0100}, biburl = {https://dblp.org/rec/conf/ifip/HemachandraW89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CaiGHHSWW88, author = {Jin{-}yi Cai and Thomas Gundermann and Juris Hartmanis and Lane A. Hemachandra and Vivian Sewelson and Klaus W. Wagner and Gerd Wechsung}, title = {The Boolean Hierarchy {I:} Structural Properties}, journal = {{SIAM} J. Comput.}, volume = {17}, number = {6}, pages = {1232--1252}, year = {1988}, url = {https://doi.org/10.1137/0217078}, doi = {10.1137/0217078}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CaiGHHSWW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GundermannW86, author = {Thomas Gundermann and Gerd Wechsung}, editor = {Jozef Gruska and Branislav Rovan and Juraj Wiedermann}, title = {Nondeterministic Turing Machines with Modified Acceptance}, booktitle = {Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {233}, pages = {396--404}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/BFb0016264}, doi = {10.1007/BFB0016264}, timestamp = {Sat, 30 Sep 2023 09:52:35 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GundermannW86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung85, author = {Gerd Wechsung}, title = {On Sparse Complete Sets}, journal = {J. Inf. Process. Cybern.}, volume = {21}, number = {4/5}, pages = {253--254}, year = {1985}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/Wechsung85, author = {Gerd Wechsung}, title = {On Sparse Complete Sets}, journal = {Math. Log. Q.}, volume = {31}, number = {14-18}, pages = {281--287}, year = {1985}, url = {https://doi.org/10.1002/malq.19850311411}, doi = {10.1002/MALQ.19850311411}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/Wechsung85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/Wechsung85, author = {Gerd Wechsung}, editor = {Lothar Budach}, title = {On the Boolean closure of {NP}}, booktitle = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September 9-13, 1985}, series = {Lecture Notes in Computer Science}, volume = {199}, pages = {485--493}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0028832}, doi = {10.1007/BFB0028832}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/Wechsung85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung80, author = {Gerd Wechsung}, title = {A Note on the Return Complexity}, journal = {J. Inf. Process. Cybern.}, volume = {16}, number = {4}, pages = {139--146}, year = {1980}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WechsungB79, author = {Gerd Wechsung and Andreas Brandst{\"{a}}dt}, title = {A Relation Between Space, Return and Dual Return Complexities}, journal = {Theor. Comput. Sci.}, volume = {9}, pages = {127--140}, year = {1979}, url = {https://doi.org/10.1016/0304-3975(79)90010-0}, doi = {10.1016/0304-3975(79)90010-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/WechsungB79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/Wechsung79, author = {Gerd Wechsung}, editor = {Lothar Budach}, title = {The oscillation complexity and a hierarchy of context-free languages}, booktitle = {Fundamentals of Computation Theory, {FCT} 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979}, pages = {508--515}, publisher = {Akademie-Verlag, Berlin}, year = {1979}, timestamp = {Mon, 29 Jul 2019 11:58:23 +0200}, biburl = {https://dblp.org/rec/conf/fct/Wechsung79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Wechsung79, author = {Gerd Wechsung}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {A Crossing Measure for 2-Tape Turing Machines}, booktitle = {Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979}, series = {Lecture Notes in Computer Science}, volume = {74}, pages = {508--516}, publisher = {Springer}, year = {1979}, url = {https://doi.org/10.1007/3-540-09526-8\_51}, doi = {10.1007/3-540-09526-8\_51}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Wechsung79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip/Wechsung77, author = {Gerd Wechsung}, editor = {Bruce Gilchrist}, title = {A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions}, booktitle = {Information Processing, Proceedings of the 7th {IFIP} Congress 1977, Toronto, Canada, August 8-12, 1977}, pages = {831--833}, publisher = {North-Holland}, year = {1977}, timestamp = {Fri, 26 Jul 2019 22:58:45 +0200}, biburl = {https://dblp.org/rec/conf/ifip/Wechsung77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Wechsung77, author = {Gerd Wechsung}, editor = {Jozef Gruska}, title = {Properties of Complexity Classes: {A} Short Survey}, booktitle = {Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {53}, pages = {177--191}, publisher = {Springer}, year = {1977}, url = {https://doi.org/10.1007/3-540-08353-7\_136}, doi = {10.1007/3-540-08353-7\_136}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Wechsung77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/WagnerW77, author = {Klaus W. Wagner and Gerd Wechsung}, editor = {Jozef Gruska}, title = {Complexity Hierarchies of Oracles}, booktitle = {Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {53}, pages = {543--548}, publisher = {Springer}, year = {1977}, url = {https://doi.org/10.1007/3-540-08353-7\_178}, doi = {10.1007/3-540-08353-7\_178}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/WagnerW77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung76, author = {Gerd Wechsung}, title = {Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen}, journal = {J. Inf. Process. Cybern.}, volume = {12}, number = {6}, pages = {289--300}, year = {1976}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung75, author = {Gerd Wechsung}, title = {Eine algebraische Charakterisierung der linearen Sprachen}, journal = {J. Inf. Process. Cybern.}, volume = {11}, number = {1/2}, pages = {19--25}, year = {1975}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung75a, author = {Gerd Wechsung}, title = {Minimale und optimale Blumsche Ma{\ss}e}, journal = {J. Inf. Process. Cybern.}, volume = {11}, number = {10-12}, pages = {673--679}, year = {1975}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung75a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Wechsung75, author = {Gerd Wechsung}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes}, booktitle = {Mathematical Foundations of Computer Science 1975, 4th Symposium, Mari{\'{a}}nsk{\'{e}} L{\'{a}}zne, Czechoslovakia, September 1-5, 1975, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {32}, pages = {457--461}, publisher = {Springer}, year = {1975}, url = {https://doi.org/10.1007/3-540-07389-2\_233}, doi = {10.1007/3-540-07389-2\_233}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Wechsung75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Wechsung74, author = {Gerd Wechsung}, editor = {Andrzej Blikle}, title = {The Axiomatization Problem of a Theory of Linear Languages}, booktitle = {Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin near Warsaw, Poland, June 17-22, 1974, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {28}, pages = {298--302}, publisher = {Springer}, year = {1974}, url = {https://doi.org/10.1007/3-540-07162-8\_689}, doi = {10.1007/3-540-07162-8\_689}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Wechsung74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/actaC/Wechsung76, author = {Gerd Wechsung}, title = {Quasisequentielle Funktionen}, journal = {Acta Cybern.}, volume = {2}, number = {1}, pages = {23--33}, year = {1973}, url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3098}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/actaC/Wechsung76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/actaC/Wechsung76a, author = {Gerd Wechsung}, title = {Eine verbandstheoretische Klassifikation der l{\"{a}}ngentreuen Wortfunktionen}, journal = {Acta Cybern.}, volume = {2}, number = {1}, pages = {39--46}, year = {1973}, url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3100}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/actaC/Wechsung76a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/actaC/Wechsung76b, author = {Gerd Wechsung}, title = {Funktionen, die von pushdown-Automaten berechnet werden}, journal = {Acta Cybern.}, volume = {2}, number = {2}, pages = {115--134}, year = {1973}, url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3108}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/actaC/Wechsung76b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Wechsung72, author = {Gerd Wechsung}, title = {Die Gruppe der eineindeutigen l{\"{a}}ngentreuen sequentiellen Funktionen}, journal = {J. Inf. Process. Cybern.}, volume = {8}, number = {6/7}, pages = {335--351}, year = {1972}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Wechsung72.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.