Helmut Alt

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Stefan Näher

> Home > Persons > Helmut Alt

Publications

2009
[e6]
- view
  authority control:
- export record
  dblp key:
  - conf/birthday/2009mehlhorn
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/2009mehlhorn
Susanne Albers, Helmut Alt, Stefan Näher:
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5760, Springer 2009, ISBN 978-3-642-03455-8 [contents]
1992
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AltFKMNSU92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AltFKMNSU92
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. Algorithmica 8(5&6): 391-406 (1992)
1990
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/compgeom/AltFKMNSU90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/AltFKMNSU90
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. SCG 1990: 281-289
1988
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/MehlhornNA88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/MehlhornNA88
Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988)
1987
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/MehlhornNA87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/MehlhornNA87
Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.