Helmut Alt - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Fast Sorting AlgorithmsHelmut Alt. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 17-25, Springer, 2011. [doi]

Algorithms UnpluggedBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Springer, 2011. [doi]

2010

Can We Compute the Similarity between Surfaces?Helmut Alt, Maike Buchin. dcg, 43(1):78-99, 2010. [doi]

Probabilistic matching of planar regionsHelmut Alt, Ludmila Scharf, Daria Schymura. comgeo, 43(2):99-114, 2010. [doi]

2009

Constructing Optimal HighwaysHee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff. ijfcs, 20(1):3-23, 2009. [doi]

Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th BirthdaySusanne Albers, Helmut Alt, Stefan NÃ¤her, editors, Volume 5760 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Shape Matching by Random SamplingHelmut Alt, Ludmila Scharf. walcom 2009: 381-393 [doi]

The Computational Geometry of Comparing ShapesHelmut Alt. BIRTHDAY 2009: 235-248 [doi]

Wooden Geometric Puzzles: Design and Hardness ProofsHelmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, GÃ¼nter Rote, Gerard Tel. mst, 44(2):160-174, 2009. [doi]

2008

Computing the Hausdorff Distance between Curved ObjectsHelmut Alt, Ludmila Scharf. ijcga, 18(4):307-320, 2008. [doi]

2007

2006

Minimum-cost coverage of point sets by disksHelmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey. compgeom 2006: 449-458 [doi]

2005

ForewordHelmut Alt. mst, 38(2):133, 2005. [doi]

Semi-computability of the FrÃ©chet distance between surfacesHelmut Alt, Maike Buchin. ewcg 2005: 45-48 [doi]

The Voronoi Diagram of Curved ObjectsHelmut Alt, Otfried Cheong, Antoine Vigneron. dcg, 34(3):439-453, 2005. [doi]

2003

Comparison of Distance Measures for Planar CurvesHelmut Alt, Christian Knauer, Carola Wenk. algorithmica, 38(1):45-58, 2003. [doi]

On the worst-case complexity of the silhouette of a polytopeHelmut Alt, Marc Glisse, Xavier Goaoc. cccg 2003: 51-55

The complexity of (un)foldingHelmut Alt, Christian Knauer, Günter Rote, Sue Whitesides. compgeom 2003: 164-170 [doi]

Matching planar mapsHelmut Alt, Alon Efrat, Günter Rote, Carola Wenk. soda 2003: 589-598 [doi]

Matching planar mapsHelmut Alt, Alon Efrat, Günter Rote, Carola Wenk. jal, 49(2):262-283, 2003. [doi]

STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, ProceedingsHelmut Alt, Michel Habib, editors, Volume 2607 of Lecture Notes in Computer Science, Springer, 2003.

Finding a curve in a mapCarola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote. compgeom 2003: 384-385 [doi]

2002

STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, ProceedingsHelmut Alt, Afonso Ferreira, editors, Volume 2285 of Lecture Notes in Computer Science, Springer, 2002.

2001

Computational Discrete Mathematics, Advanced LecturesHelmut Alt, editor, Volume 2122 of Lecture Notes in Computer Science, Springer, 2001.

The Nearest NeighborHelmut Alt. ac 2001: 13-24 [doi]

Matching Polygonal Curves with Respect to the Fréchet DistanceHelmut Alt, Christian Knauer, Carola Wenk. STACS 2001: 63-74 [doi]

Exact L::infty:: Nearest Neighbor Search in High DimensionsHelmut Alt, Laura Heinrich-Litan. compgeom 2001: 157-163 [doi]

2000

Packing Convex Polygons into Rectangular BoxesHelmut Alt, Ferran Hurtado. jcdcg 2001: 67-80 [doi]

A class of point-sets with few k-setsHelmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl. comgeo, 16(2):95-101, 2000.

1999

On The Number Of Simple Cycles In Planar GraphsHelmut Alt, Ulrich Fuchs, Klaus Kriegel. cpc, 8(5), 1999.

1998

Matching Convex Shapes with Respect to the Symmetric DifferenceHelmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber. algorithmica, 21(1):89-103, 1998.

Point-Sets with few ::::k::::-SetsHelmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy. compgeom 1998: 200-205 [doi]

Universal 3-dimensional visibility representations for graphsHelmut Alt, Michael Godau, Sue Whitesides. comgeo, 9(1-2):111-125, 1998.

1997

Matching Shapes with a Reference PointOswin Aichholzer, Helmut Alt, Günter Rote. ijcga, 7(4):349-363, 1997.

Piecewise Linear Approximation of Bézier-CurvesHelmut Alt, Emo Welzl, Barbara Wolfers. compgeom 1997: 433-435 [doi]

On the Number of Simple Cycles in Planar GraphsHelmut Alt, Ulrich Fuchs, Klaus Kriegel. criwg 1997: 15-24

1996

Matching Convex Shapes with Respect to the Symmetric DifferenceHelmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber. esa 1996: 320-333

A Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesHelmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson. algorithmica, 16(4/5):543-547, 1996.

1995

Approximate Matching of Polygonal ShapesHelmut Alt, Bernd Behrends, Johannes Blömer. AMAI, 13(3-4):251-265, 1995.

Computing the Fréchet distance between two polygonal curvesHelmut Alt, Michael Godau. ijcga, 5:75-91, 1995.

Universal 3-Dimensional Visibility Representations for GraphsHelmut Alt, Michael Godau, Sue Whitesides. gd 1996: 8-19

The Voronoi Diagram of Curved ObjectsHelmut Alt, Otfried Schwarzkopf. compgeom 1995: 89-97 [doi]

1994

Matching Shapes with a Reference PointHelmut Alt, Oswin Aichholzer, Günter Rote. compgeom 1994: 85-92 [doi]

An Application of Point Pattern Matching in AstronauticsGerald Weber, Lars Knipping, Helmut Alt. JSC, 17(4):321-340, 1994.

1992

1991

Approximate Matching of Polygonal Shapes (Extended Abstract)Helmut Alt, Bernd Behrends, Johannes Blömer. compgeom 1991: 186-193 [doi]

Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul. ipl, 37(4):237-240, 1991.

1990

Approximation of Convex PolygonsHelmut Alt, Johannes Blömer, Hubert Wagener. icalp 1990: 703-716

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric FiguresHelmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig. compgeom 1990: 281-289 [doi]

1989

Motion Planning in the CL-Environment (Extended Abstract)Chee-Keng Yap, Helmut Alt. wads 1989: 373-380

1988

Approximation of Polygons by Rechtangles and CirclesHelmut Alt, Hubert Wagener. eatcs, 36:103-112, 1988.

Comparing the combinational complexities of arithmetic functionsHelmut Alt. JACM, 35(2):447-460, 1988. [doi]

Congruence, Similarity, and Symmetries of Geometric ObjectsHelmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl. dcg, 3:237-256, 1988.

A Lower Bound on the Complexity of the Union-Split-Find ProblemKurt Mehlhorn, Stefan Näher, Helmut Alt. siamcomp, 17(6):1093-1102, 1988.

1987

1986

Deterministic Simulation of Idealized Parallel Computers on More Realistic OnesHelmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata. mfcs 1986: 199-208

1985

Searching Semisorted TablesHelmut Alt, Kurt Mehlhorn. siamcomp, 14(4):840-848, 1985.

Multiplication is the Easiest Nontrivial Arithmetic FunctionHelmut Alt. TCS, 36:333-339, 1985.

1984

Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)Helmut Alt. stoc 1984: 466-470

Partial Match Retrieval in Implicit Data StructuresHelmut Alt, Kurt Mehlhorn, J. Ian Munro. ipl, 19(2):61-65, 1984.

1983

Multiplication Is the Easiest Nontrivial Arithmetic FunctionHelmut Alt. focs 1983: 320-322

1981

Partial Match Retrieval in Implicit Data StructuresHelmut Alt, Kurt Mehlhorn, J. Ian Munro. mfcs 1981: 156-161

1980

Functions Equivalent to Integer MultiplicationHelmut Alt. icalp 1980: 30-37

1979

Lower Bounds on Space Complexity for Contextfree RecognitionHelmut Alt. ACTA, 12:33-61, 1979.

The complexity of complex division (extended abstract)Helmut Alt, Jan van Leeuwen. fct 1979: 13-17

Complexity arguments in algebraic language theoryHelmut Alt, Kurt Mehlhorn. ita, 13(3), 1979.

1977

Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier SprachenHelmut Alt. tcs 1977: 123-131

1976

Lower Bounds for the Space Complexity of Context-Free RecognitionHelmut Alt, Kurt Mehlhorn. icalp 1976: 338-354