J. Geske

Retrospective Theses and Dissertations 1987 On the structure of intractable sets

J. Geske, 2015 .

On the structure of intractable sets (binary relation)

J. Geske, 1987 .

Frsq : A Binary Image Coding Method

W. Grosky, P. Stanchev, J. Geske, 2002 .

A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees

Alan L. Selman, Dung T. Huynh, John G. Geske, 1987, Symposium on Theoretical Aspects of Computer Science.

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes

Joel I. Seiferas, Dung T. Huynh, John G. Geske, 1991, Inf. Comput..

Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space

John G. Geske, Diane Kakihara, J. Geske, 1991, ICCI.

On the structure of intractable sets

John George Geske, J. Geske, 1987 .

Relativizations of Unambiguous and Random Polynomial Time Classes

Joachim Grollmann, John G. Geske, J. Geske, 1986, SIAM J. Comput..