The SCEAS System
Navigation Menu

Search the dblp DataBase


Michael Reid: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard E. Korf, Michael Reid
    Complexity Analysis of Admissible Heuristic Search. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:305-310 [Conf]
  2. Richard E. Korf, Michael Reid, Stefan Edelkamp
    Time complexity of iterative-deepening-A*. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:199-218 [Journal]
  3. Robert Hochberg, Michael Reid
    Tiling with notched cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:255-261 [Journal]
  4. Michael Reid
    Klarner systems and tiling boxes with polyominoes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:1, pp:89-105 [Journal]
  5. Michael Reid
    Tiling Rectangles and Half Strips with Congruent Polyominoes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:1, pp:106-123 [Journal]
  6. Michael Reid
    Tiling a Square with Eight Congruent Polyominoes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:158- [Journal]
  7. Michael Reid, Douglas S. Jungreis, Dave Witte
    Distances forbidden by some two-coloring of Q2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:1, pp:53-56 [Journal]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002