The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Albrecht Hoene: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lane A. Hemachandra, Albrecht Hoene
    On Sets with Efficient Implicit Membership Tests. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:11-19 [Conf]
  2. Lane A. Hemachandra, Albrecht Hoene
    Collapsing Degrees via Strong Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:393-404 [Conf]
  3. Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Selectivity. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:55-59 [Conf]
  4. Hans-Jörg Burtschick, Albrecht Hoene
    The Degree Structure of 1-L Reductions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:153-161 [Conf]
  5. William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
    On Checking Versus Evaluation of Multiple Queries. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:261-268 [Conf]
  6. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes
    Polynomial-Time Functions Generate SAT: On P-Splinters. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:259-269 [Conf]
  7. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
    Splittings, Robustness and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:175-184 [Conf]
  8. Gerhard Buntrock, Albrecht Hoene
    Reversals and Alternation. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:218-228 [Conf]
  9. Albrecht Hoene, Arfst Nickelsen
    Counting, Selecting, adn Sorting by Query-Bounded Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:196-205 [Conf]
  10. William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
    On Checking Versus Evaluation of Multiple Queries [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:1, pp:72-93 [Journal]
  11. Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Nondeterministically Selective Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:4, pp:403-416 [Journal]
  12. Lane A. Hemachandra, Albrecht Hoene
    Collapsing Degrees via Strong Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:363-380 [Journal]
  13. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
    Splittings, Robustness, and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:637-653 [Journal]
  14. Lane A. Hemachandra, Albrecht Hoene
    On Sets with Efficient Implicit Membership Tests. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1148-1156 [Journal]
  15. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young
    On Sets Polynomially Enumerable by Iteration. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:2, pp:203-225 [Journal]
  16. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
    Erratum to "Reducibility classes of P-selective sets". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:323- [Journal]
  17. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
    Reducibility Classes of P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:447-457 [Journal]

Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002