
Search the dblp DataBase
Laura HeinrichLitan:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Helmut Alt, Laura HeinrichLitan
Exact L_{infty} Nearest Neighbor Search in High Dimensions. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:157163 [Conf]
 Laura HeinrichLitan, Ursula Fissgus, St. Sutter, Paul Molitor, Thomas Rauber
Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming. [Citation Graph (0, 0)][DBLP] EuroPar, 1998, pp:273278 [Conf]
 Laura HeinrichLitan, 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:1260 [Conf]
 Laura HeinrichLitan, Marco E. Lübbecke
Rectangle Covers Revisited Computationally. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:5566 [Conf]
 Peter Braß, Laura HeinrichLitan, 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:439445 [Journal]
 Laura HeinrichLitan, Marco E. Lübbecke
Rectangle covers revisited computationally. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp: [Journal]
 Laura HeinrichLitan, 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:360368 [Journal]
Search in 0.221secs, Finished in 0.221secs
