The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William T. Laaser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Neil D. Jones, William T. Laaser
    Complete Problems for Deterministic Polynomial Time. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:1, pp:105-117 [Journal]
  2. Neil D. Jones, William T. Laaser
    Complete Problems for Deterministic Polynomial Time [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:40-46 [Conf]
  3. Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe
    Finding Extrema with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:591-600 [Journal]
  4. Neil D. Jones, Y. Edmund Lien, William T. Laaser
    New Problems Complete for Nondeterministic Loc Space. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1976, v:10, n:, pp:1-17 [Journal]

Search in 0.025secs, Finished in 0.025secs
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