The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Othar Hansson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Othar Hansson, Andrew Mayer, Marco Valtorta
    A New Result on the Complexity of Heuristic Estimates for the A* Algorithm. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:55, n:1, pp:129-143 [Journal]
  2. Othar Hansson, Andrew Mayer
    Probabilistic heuristic estimates. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:2, n:, pp:209-220 [Journal]
  3. Stuart J. Russell, Lewis Stiller, Othar Hansson
    PNPACK: Computing with Probabilities in Java. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1997, v:9, n:11, pp:1333-1339 [Journal]
  4. Othar Hansson, Andrew Mayer, Moti Yung
    Criticizing solutions to relaxed models yields powerful admissible heuristics. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:63, n:3, pp:207-227 [Journal]

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