BibTeX records: John G. Geske

• > Home > Persons > John G. Geske

@article{DBLP:journals/iandc/GeskeHS91,
  author       = {John G. Geske and
                  Dung T. Huynh and
                  Joel I. Seiferas},
  title        = {A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity
                  Classes},
  journal      = {Inf. Comput.},
  volume       = {92},
  number       = {1},
  pages        = {97--104},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90022-T},
  doi          = {10.1016/0890-5401(91)90022-T},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/GeskeHS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icci/GeskeK90,
  author       = {John G. Geske and
                  Diane Kakihara},
  editor       = {Selim G. Akl and
                  Frantisek Fiala and
                  Waldemar W. Koczkodaj},
  title        = {Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space},
  booktitle    = {Advances in Computing and Information - ICCI'90, International Conference
                  on Computing and Information, Niagara Falls, Canada, May 23-26, 1990,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {468},
  pages        = {44--51},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-53504-7\_60},
  doi          = {10.1007/3-540-53504-7\_60},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/icci/GeskeK90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GeskeHS87,
  author       = {John G. Geske and
                  Dung T. Huynh and
                  Alan L. Selman},
  editor       = {Franz{-}Josef Brandenburg and
                  Guy Vidal{-}Naquet and
                  Martin Wirsing},
  title        = {A Hierarchy Theorem for Almost Everywhere Complex Sets With Application
                  to Polynomial Complexity Degrees},
  booktitle    = {{STACS} 87, 4th Annual Symposium on Theoretical Aspects of Computer
                  Science, Passau, Germany, February 19-21, 1987, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {247},
  pages        = {125--135},
  publisher    = {Springer},
  year         = {1987},
  url          = {https://doi.org/10.1007/BFb0039600},
  doi          = {10.1007/BFB0039600},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GeskeHS87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GeskeG86,
  author       = {John G. Geske and
                  Joachim Grollmann},
  title        = {Relativizations of Unambiguous and Random Polynomial Time Classes},
  journal      = {{SIAM} J. Comput.},
  volume       = {15},
  number       = {2},
  pages        = {511--519},
  year         = {1986},
  url          = {https://doi.org/10.1137/0215035},
  doi          = {10.1137/0215035},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GeskeG86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}