Search the dblp DataBase
Helmut Alt :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Helmut Alt The Nearest Neighbor. [Citation Graph (0, 0)][DBLP ] Computational Discrete Mathematics, 2001, pp:13-24 [Conf ] Helmut Alt , Marc Glisse , Xavier Goaoc On the worst-case complexity of the silhouette of a polytope. [Citation Graph (0, 0)][DBLP ] CCCG, 2003, pp:51-55 [Conf ] Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1987, pp:308-315 [Conf ] Helmut Alt , Christian Knauer , Günter Rote , Sue Whitesides The complexity of (un)folding. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2003, pp:164-170 [Conf ] Helmut Alt , Otfried Schwarzkopf The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1995, pp:89-97 [Conf ] Helmut Alt , Emo Welzl , Barbara Wolfers Piecewise Linear Approximation of Bézier-Curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1997, pp:433-435 [Conf ] Helmut Alt , Esther M. Arkin , Hervé Brönnimann , Jeff Erickson , Sándor P. Fekete , Christian Knauer , Jonathan Lenchner , Joseph S. B. Mitchell , Kim Whittlesey Minimum-cost coverage of point sets by disks. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:449-458 [Conf ] Helmut Alt , Oswin Aichholzer , Günter Rote Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1994, pp:85-92 [Conf ] Helmut Alt , Bernd Behrends , Johannes Blömer Approximate Matching of Polygonal Shapes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1991, pp:186-193 [Conf ] Helmut Alt , Stefan Felsner , Ferran Hurtado , Marc Noy Point-Sets with few k -Sets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1998, pp:200-205 [Conf ] Helmut Alt , Rudolf Fleischer , Michael Kaufmann , Kurt Mehlhorn , Stefan Näher , Stefan Schirra , Christian Uhrig Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1990, pp:281-289 [Conf ] Helmut Alt , Michael Godau Measuring the Resemblance of Polygonal Curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1992, pp:102-109 [Conf ] 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 ] Carola Wenk , Helmut Alt , Alon Efrat , Lingeshwaran Palaniappan , Günter Rote Finding a curve in a map. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2003, pp:384-385 [Conf ] Helmut Alt , Johannes Blömer Resemblance and Symmetries of Geometric Patterns. [Citation Graph (0, 0)][DBLP ] Data Structures and Efficient Algorithms, 1992, pp:1-24 [Conf ] Helmut Alt , Ulrich Fuchs , Günter Rote , Gerald Weber Matching Convex Shapes with Respect to the Symmetric Difference. [Citation Graph (0, 0)][DBLP ] ESA, 1996, pp:320-333 [Conf ] Helmut Alt , Jan van Leeuwen The complexity of complex division (extended abstract). [Citation Graph (0, 0)][DBLP ] FCT, 1979, pp:13-17 [Conf ] Helmut Alt Multiplication Is the Easiest Nontrivial Arithmetic Function [Citation Graph (0, 0)][DBLP ] FOCS, 1983, pp:320-322 [Conf ] Helmut Alt , Michael Godau , Sue Whitesides Universal 3-Dimensional Visibility Representations for Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1995, pp:8-19 [Conf ] Helmut Alt Functions Equivalent to Integer Multiplication. [Citation Graph (0, 0)][DBLP ] ICALP, 1980, pp:30-37 [Conf ] Helmut Alt , Johannes Blömer , Hubert Wagener Approximation of Convex Polygons. [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:703-716 [Conf ] Helmut Alt , Kurt Mehlhorn Lower Bounds for the Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP ] ICALP, 1976, pp:338-354 [Conf ] Kurt Mehlhorn , Stefan Näher , Helmut Alt A Lower Bound for the Complexity of the Union-Split-Find Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 1987, pp:479-488 [Conf ] Helmut Alt , Ferran Hurtado Packing Convex Polygons into Rectangular Boxes. [Citation Graph (0, 0)][DBLP ] JCDCG, 2000, pp:67-80 [Conf ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP ] MFCS, 1986, pp:199-208 [Conf ] Helmut Alt , Kurt Mehlhorn , J. Ian Munro Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:156-161 [Conf ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. [Citation Graph (0, 0)][DBLP ] Parallel Algorithms and Architectures, 1987, pp:11-15 [Conf ] Helmut Alt , Alon Efrat , Günter Rote , Carola Wenk Matching planar maps. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:589-598 [Conf ] Helmut Alt , Christian Knauer , Carola Wenk Matching Polygonal Curves with Respect to the Fréchet Distance. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:63-74 [Conf ] Helmut Alt Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:466-470 [Conf ] Helmut Alt Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1977, pp:123-131 [Conf ] Chee-Keng Yap , Helmut Alt Motion Planning in the CL-Environment (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1989, pp:373-380 [Conf ] Helmut Alt , Ulrich Fuchs , Klaus Kriegel On the Number of Simple Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:15-24 [Conf ] Helmut Alt Lower Bounds on Space Complexity for Contextfree Recognition. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1979, v:12, n:, pp:33-61 [Journal ] Helmut Alt , Rudolf Fleischer , Michael Kaufmann , Kurt Mehlhorn , Stefan Näher , Stefan Schirra , Christian Uhrig Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:8, n:5&6, pp:391-406 [Journal ] Helmut Alt , Ulrich Fuchs , Günter Rote , Gerald Weber Matching Convex Shapes with Respect to the Symmetric Difference. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1998, v:21, n:1, pp:89-103 [Journal ] Helmut Alt , Leonidas J. Guibas , Kurt Mehlhorn , Richard M. Karp , Avi Wigderson A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:16, n:4/5, pp:543-547 [Journal ] Helmut Alt , Christian Knauer , Carola Wenk Comparison of Distance Measures for Planar Curves. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:38, n:1, pp:45-58 [Journal ] Helmut Alt , Bernd Behrends , Johannes Blömer Approximate Matching of Polygonal Shapes. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1995, v:13, n:3-4, pp:251-265 [Journal ] Helmut Alt , Stefan Felsner , Ferran Hurtado , Marc Noy , Emo Welzl A class of point-sets with few k-sets. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2000, v:16, n:2, pp:95-101 [Journal ] Helmut Alt , Michael Godau , Sue Whitesides Universal 3-dimensional visibility representations for graphs. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1998, v:9, n:1-2, pp:111-125 [Journal ] Helmut Alt , Ulrich Fuchs , Klaus Kriegel On The Number Of Simple Cycles In Planar Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal ] Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1988, v:3, n:, pp:237-256 [Journal ] Helmut Alt , Otfried Cheong , Antoine Vigneron The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2005, v:34, n:3, pp:439-453 [Journal ] Helmut Alt , Hubert Wagener Approximation of Polygons by Rechtangles and Circles. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1988, v:36, n:, pp:103-112 [Journal ] Oswin Aichholzer , Helmut Alt , Günter Rote Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:349-363 [Journal ] Helmut Alt , Michael Godau Computing the Fréchet distance between two polygonal curves. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:75-91 [Journal ] Helmut Alt , Norbert Blum , Kurt Mehlhorn , Markus Paul Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:237-240 [Journal ] Helmut Alt , Viliam Geffert , Kurt Mehlhorn A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:25-27 [Journal ] Helmut Alt , Kurt Mehlhorn , J. Ian Munro Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1984, v:19, n:2, pp:61-65 [Journal ] Helmut Alt , Kurt Mehlhorn Complexity arguments in algebraic language theory. [Citation Graph (0, 0)][DBLP ] ITA, 1979, v:13, n:3, pp:- [Journal ] Helmut Alt Comparing the combinational complexities of arithmetic functions. [Citation Graph (0, 0)][DBLP ] J. ACM, 1988, v:35, n:2, pp:447-460 [Journal ] Helmut Alt , Alon Efrat , Günter Rote , Carola Wenk Matching planar maps. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2003, v:49, n:2, pp:262-283 [Journal ] Helmut Alt Foreword. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2005, v:38, n:2, pp:133- [Journal ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:5, pp:808-835 [Journal ] Helmut Alt , Kurt Mehlhorn Searching Semisorted Tables. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:4, pp:840-848 [Journal ] Kurt Mehlhorn , Stefan Näher , Helmut Alt A Lower Bound on the Complexity of the Union-Split-Find Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:6, pp:1093-1102 [Journal ] Helmut Alt Multiplication is the Easiest Nontrivial Arithmetic Function. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:36, n:, pp:333-339 [Journal ] Helmut Alt , Hans L. Bodlaender , Marc J. van Kreveld , Günter Rote , Gerard Tel Wooden Geometric Puzzles: Design and Hardness Proofs. [Citation Graph (0, 0)][DBLP ] FUN, 2007, pp:16-29 [Conf ] Helmut Alt , Maike Buchin Can we Compute the Similarity Between Surfaces? [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Hee-Kap Ahn , Helmut Alt , Tetsuo Asano , Sang Won Bae , Peter Brass , Otfried Cheong , Christian Knauer , Hyeon-Suk Na , Chan-Su Shin , Alexander Wolff Constructing Optimal Highways [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] The Computational Geometry of Comparing Shapes. [Citation Graph (, )][DBLP ] Constructing Optimal Highways. [Citation Graph (, )][DBLP ] Probabilistic matching and resemblance evaluation of shapes in trademark images. [Citation Graph (, )][DBLP ] Semi-computability of the Fréchet distance between surfaces. [Citation Graph (, )][DBLP ] Shape Matching by Random Sampling. [Citation Graph (, )][DBLP ] Probabilistic matching of planar regions. [Citation Graph (, )][DBLP ] Probabilistic Matching of Planar Regions [Citation Graph (, )][DBLP ] Can We Compute the Similarity between Surfaces? [Citation Graph (, )][DBLP ] Search in 0.223secs, Finished in 0.675secs