Polynomial-Time Functions Generate SAT: On P-Splinters. - Lane A. Hemachandra; Albrecht Hoene; Dirk Siefkes (MFCS, 1989)

Reversals and Alternation. - Gerhard Buntrock; Albrecht Hoene (STACS, 1989)

Polynomielle Splinter. - Albrecht Hoene (1990)

Collapsing Degrees via Strong Computation (Extended Abstract). - Lane A. Hemachandra; Albrecht Hoene (ICALP, 1991)

On Sets with Efficient Implicit Membership Tests. - Lane A. Hemachandra; Albrecht Hoene (SIAM J. Comput., 1991)

On Sets Polynomially Enumerable by Iteration. - Lane A. Hemachandra; Albrecht Hoene; Dirk Siefkes; Paul Young (Theor. Comput. Sci., 1991)

The Degree Structure of 1-L Reductions. - Hans-Jörg Burtschick; Albrecht Hoene (MFCS, 1992)

Selectivity. - Lane A. Hemachandra; Albrecht Hoene; Mitsunori Ogiwara; Alan L. Selman; Thomas Thierauf; Jie Wang 002 (ICCI, 1993)

Counting, Selecting, adn Sorting by Query-Bounded Machines. - Albrecht Hoene; Arfst Nickelsen (STACS, 1993)

Collapsing Degrees via Strong Computation. - Lane A. Hemachandra; Albrecht Hoene (J. Comput. Syst. Sci., 1993)

On Checking Versus Evaluation of Multiple Queries - William I. Gasarch; Lane A. Hemachandra; Albrecht Hoene (Inf. Comput., 1993)

Nondeterministically Selective Sets. - Lane A. Hemaspaandra; Albrecht Hoene; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman; Thomas Thierauf; Jie Wang 002 (Int. J. Found. Comput. Sci., 1995)

Reducibility Classes of P-Selective Sets. - Lane A. Hemaspaandra; Albrecht Hoene; Mitsunori Ogihara (Theor. Comput. Sci., 1996)

Splittings, Robustness, and Structure of Complete Sets. - Harry Buhrman; Albrecht Hoene; Leen Torenvliet (SIAM J. Comput., 1998)

Erratum to "Reducibility classes of P-selective sets". - Lane A. Hemaspaandra; Albrecht Hoene; Mitsunori Ogihara (Theor. Comput. Sci., 2000)