The SCEAS System
Navigation Menu

Search the dblp DataBase


Laura Heinrich-Litan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Helmut Alt, Laura Heinrich-Litan
    Exact Linfty Nearest Neighbor Search in High Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:157-163 [Conf]
  2. Laura Heinrich-Litan, Ursula Fissgus, St. Sutter, Paul Molitor, Thomas Rauber
    Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:273-278 [Conf]
  3. Laura Heinrich-Litan, Paul Molitor, Dirk Möller
    Least Upper Bounds on the Sizes of Symmetric Variable Order based OBDDs. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1996, pp:126-0 [Conf]
  4. Laura Heinrich-Litan, Marco E. Lübbecke
    Rectangle Covers Revisited Computationally. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:55-66 [Conf]
  5. Peter Braß, Laura Heinrich-Litan, Pat Morin
    Computing the Center of Area of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:439-445 [Journal]
  6. Laura Heinrich-Litan, Marco E. Lübbecke
    Rectangle covers revisited computationally. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  7. Laura Heinrich-Litan, Paul Molitor
    Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:4, pp:360-368 [Journal]

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