Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Helmut Alt
@article{DBLP:journals/corr/abs-2110-12711,
author = {Helmut Alt and
Otfried Cheong and
Ji{-}won Park and
Nadja Seiferth},
title = {Packing 2D disks into a 3D container},
journal = {CoRR},
volume = {abs/2110.12711},
year = {2021},
url = {https://arxiv.org/abs/2110.12711},
eprinttype = {arXiv},
eprint = {2110.12711},
timestamp = {Thu, 28 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-12711.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AhnABOSW20,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Maike Buchin and
Eunjin Oh and
Ludmila Scharf and
Carola Wenk},
title = {Middle curves based on discrete Fr{\'{e}}chet distance},
journal = {Comput. Geom.},
volume = {89},
pages = {101621},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101621},
doi = {10.1016/J.COMGEO.2020.101621},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AhnABOSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AltCPS19,
author = {Helmut Alt and
Otfried Cheong and
Ji{-}won Park and
Nadja Scharf},
editor = {Gautam K. Das and
Partha Sarathi Mandal and
Krishnendu Mukhopadhyaya and
Shin{-}Ichi Nakano},
title = {Packing 2D Disks into a 3D Container},
booktitle = {{WALCOM:} Algorithms and Computation - 13th International Conference,
{WALCOM} 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11355},
pages = {369--380},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10564-8\_29},
doi = {10.1007/978-3-030-10564-8\_29},
timestamp = {Wed, 31 Mar 2021 12:03:13 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AltCPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AltS18,
author = {Helmut Alt and
Nadja Scharf},
title = {Approximating Smallest Containers for Packing Three-Dimensional Convex
Objects},
journal = {Int. J. Comput. Geom. Appl.},
volume = {28},
number = {2},
pages = {111--128},
year = {2018},
url = {https://doi.org/10.1142/S0218195918600026},
doi = {10.1142/S0218195918600026},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AltS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AltBCCKKS18,
author = {Helmut Alt and
Kevin Buchin and
Steven Chaplick and
Otfried Cheong and
Philipp Kindermann and
Christian Knauer and
Fabian Stehn},
title = {Placing your coins on a shelf},
journal = {J. Comput. Geom.},
volume = {9},
number = {1},
pages = {312--327},
year = {2018},
url = {https://doi.org/10.20382/jocg.v9i1a10},
doi = {10.20382/JOCG.V9I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AltBCCKKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AltCGK17,
author = {Helmut Alt and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
title = {Minimum Cell Connection in Line Segment Arrangements},
journal = {Int. J. Comput. Geom. Appl.},
volume = {27},
number = {3},
pages = {159--176},
year = {2017},
url = {https://doi.org/10.1142/S0218195917500017},
doi = {10.1142/S0218195917500017},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AltCGK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AltBK17,
author = {Helmut Alt and
Mark de Berg and
Christian Knauer},
title = {Approximating Minimum-Area Rectangular and Convex Containers for Packing
Convex Polygons},
journal = {J. Comput. Geom.},
volume = {8},
number = {1},
pages = {1--10},
year = {2017},
url = {https://doi.org/10.20382/jocg.v8i1a1},
doi = {10.20382/JOCG.V8I1A1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/AltBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AltBCCKKS17,
author = {Helmut Alt and
Kevin Buchin and
Steven Chaplick and
Otfried Cheong and
Philipp Kindermann and
Christian Knauer and
Fabian Stehn},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Placing your Coins on a Shelf},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.4},
doi = {10.4230/LIPICS.ISAAC.2017.4},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AltBCCKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AltBCCKKS17,
author = {Helmut Alt and
Kevin Buchin and
Steven Chaplick and
Otfried Cheong and
Philipp Kindermann and
Christian Knauer and
Fabian Stehn},
title = {Placing your Coins on a Shelf},
journal = {CoRR},
volume = {abs/1707.01239},
year = {2017},
url = {http://arxiv.org/abs/1707.01239},
eprinttype = {arXiv},
eprint = {1707.01239},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AltBCCKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AltPSW16,
author = {Helmut Alt and
Michael S. Payne and
Jens M. Schmidt and
David R. Wood},
title = {Thoughts on Barnette's Conjecture},
journal = {Australas. {J} Comb.},
volume = {64},
pages = {354--365},
year = {2016},
url = {http://ajc.maths.uq.edu.au/pdf/64/ajc\_v64\_p354.pdf},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AltPSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ParkBAA16,
author = {Dongwoo Park and
Sang Won Bae and
Helmut Alt and
Hee{-}Kap Ahn},
title = {Bundling three convex polygons to minimize area or perimeter},
journal = {Comput. Geom.},
volume = {51},
pages = {1--14},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2015.10.003},
doi = {10.1016/J.COMGEO.2015.10.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ParkBAA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Alt16,
author = {Helmut Alt},
title = {Computational Aspects of Packing Problems},
journal = {Bull. {EATCS}},
volume = {118},
year = {2016},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/390},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Alt16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AltS16,
author = {Helmut Alt and
Nadja Scharf},
editor = {Seok{-}Hee Hong},
title = {Approximating Smallest Containers for Packing Three-Dimensional Convex
Objects},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.11},
doi = {10.4230/LIPICS.ISAAC.2016.11},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AltS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AhnABOSW16,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Maike Buchin and
Eunjin Oh and
Ludmila Scharf and
Carola Wenk},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {A Middle Curve Based on Discrete Fr{\'{e}}chet Distance},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {14--26},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_2},
doi = {10.1007/978-3-662-49529-2\_2},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/AhnABOSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AltS16,
author = {Helmut Alt and
Nadja Scharf},
title = {Approximating Smallest Containers for Packing Three-dimensional Convex
Objects},
journal = {CoRR},
volume = {abs/1601.04585},
year = {2016},
url = {http://arxiv.org/abs/1601.04585},
eprinttype = {arXiv},
eprint = {1601.04585},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AltS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AltBK15,
author = {Helmut Alt and
Mark de Berg and
Christian Knauer},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximating Minimum-Area Rectangular and Convex Containers for Packing
Convex Polygons},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {25--34},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_3},
doi = {10.1007/978-3-662-48350-3\_3},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/AltBK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AltAEHHKKMP14,
author = {Helmut Alt and
Esther M. Arkin and
Alon Efrat and
George Hart and
Ferran Hurtado and
Irina Kostitsyna and
Alexander Kr{\"{o}}ller and
Joseph S. B. Mitchell and
Valentin Polishchuk},
title = {Scandinavian Thins on Top of Cake: New and Improved Algorithms for
Stacking and Packing},
journal = {Theory Comput. Syst.},
volume = {54},
number = {4},
pages = {689--714},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9493-9},
doi = {10.1007/S00224-013-9493-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AltAEHHKKMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AhnABP13,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Sang Won Bae and
Dongwoo Park},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Bundling Three Convex Polygons to Minimize Area or Perimeter},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {13--24},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_2},
doi = {10.1007/978-3-642-40104-6\_2},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AhnABP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AltS12,
author = {Helmut Alt and
Ludmila Scharf},
title = {Shape matching by random sampling},
journal = {Theor. Comput. Sci.},
volume = {442},
pages = {2--12},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2010.03.023},
doi = {10.1016/J.TCS.2010.03.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AltS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-3962,
author = {Helmut Alt and
Ludmila Scharf},
title = {Computation of the Hausdorff distance between sets of line segments
in parallel},
journal = {CoRR},
volume = {abs/1207.3962},
year = {2012},
url = {http://arxiv.org/abs/1207.3962},
eprinttype = {arXiv},
eprint = {1207.3962},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-3962.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/voecking2011/Alt11,
author = {Helmut Alt},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Fast Sorting Algorithms},
booktitle = {Algorithms Unplugged},
pages = {17--25},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-15328-0\_3},
doi = {10.1007/978-3-642-15328-0\_3},
timestamp = {Wed, 14 Jun 2017 20:29:01 +0200},
biburl = {https://dblp.org/rec/books/sp/voecking2011/Alt11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/voecking11,
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Algorithms Unplugged},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-15328-0},
doi = {10.1007/978-3-642-15328-0},
isbn = {978-3-642-15327-3},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/voecking11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4618,
author = {Helmut Alt and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
title = {Minimum cell connection and separation in line segment arrangements},
journal = {CoRR},
volume = {abs/1104.4618},
year = {2011},
url = {http://arxiv.org/abs/1104.4618},
eprinttype = {arXiv},
eprint = {1104.4618},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4618.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AltSS10,
author = {Helmut Alt and
Ludmila Scharf and
Daria Schymura},
title = {Probabilistic matching of planar regions},
journal = {Comput. Geom.},
volume = {43},
number = {2},
pages = {99--114},
year = {2010},
url = {https://doi.org/10.1016/j.comgeo.2009.04.006},
doi = {10.1016/J.COMGEO.2009.04.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AltSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AltB10,
author = {Helmut Alt and
Maike Buchin},
title = {Can We Compute the Similarity between Surfaces?},
journal = {Discret. Comput. Geom.},
volume = {43},
number = {1},
pages = {78--99},
year = {2010},
url = {https://doi.org/10.1007/s00454-009-9152-8},
doi = {10.1007/S00454-009-9152-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AltB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AhnAABBCKNSW09,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Tetsuo Asano and
Sang Won Bae and
Peter Brass and
Otfried Cheong and
Christian Knauer and
Hyeon{-}Suk Na and
Chan{-}Su Shin and
Alexander Wolff},
title = {Constructing Optimal Highways},
journal = {Int. J. Found. Comput. Sci.},
volume = {20},
number = {1},
pages = {3--23},
year = {2009},
url = {https://doi.org/10.1142/S0129054109006425},
doi = {10.1142/S0129054109006425},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AhnAABBCKNSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AltBKRT09,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
journal = {Theory Comput. Syst.},
volume = {44},
number = {2},
pages = {160--174},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9104-3},
doi = {10.1007/S00224-008-9104-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AltBKRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Alt09,
author = {Helmut Alt},
editor = {Susanne Albers and
Helmut Alt and
Stefan N{\"{a}}her},
title = {The Computational Geometry of Comparing Shapes},
booktitle = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion
of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5760},
pages = {235--248},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03456-5\_16},
doi = {10.1007/978-3-642-03456-5\_16},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Alt09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AltS09,
author = {Helmut Alt and
Ludmila Scharf},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Shape Matching by Random Sampling},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {381--393},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_33},
doi = {10.1007/978-3-642-00202-1\_33},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AltS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2009mehlhorn,
editor = {Susanne Albers and
Helmut Alt and
Stefan N{\"{a}}her},
title = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion
of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5760},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03456-5},
doi = {10.1007/978-3-642-03456-5},
isbn = {978-3-642-03455-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2009mehlhorn.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9111,
editor = {Pankaj Kumar Agarwal and
Helmut Alt and
Monique Teillaud},
title = {Computational Geometry, 08.03. - 13.03.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09111},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/portals/09111/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgarwalAT09,
author = {Pankaj Kumar Agarwal and
Helmut Alt and
Monique Teillaud},
editor = {Pankaj Kumar Agarwal and
Helmut Alt and
Monique Teillaud},
title = {09111 Abstracts Collection - Computational Geometry},
booktitle = {Computational Geometry, 08.03. - 13.03.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09111},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2034/},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgarwalAT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-4337,
author = {Helmut Alt and
Ludmila Scharf and
Daria Schymura},
title = {Probabilistic Matching of Planar Regions},
journal = {CoRR},
volume = {abs/0902.4337},
year = {2009},
url = {http://arxiv.org/abs/0902.4337},
eprinttype = {arXiv},
eprint = {0902.4337},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-4337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AltS08,
author = {Helmut Alt and
Ludmila Scharf},
title = {Computing the Hausdorff Distance between Curved Objects},
journal = {Int. J. Comput. Geom. Appl.},
volume = {18},
number = {4},
pages = {307--320},
year = {2008},
url = {https://doi.org/10.1142/S0218195908002647},
doi = {10.1142/S0218195908002647},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AltS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Alt08,
author = {Helmut Alt},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Schnelle Sortieralgorithmen},
booktitle = {Taschenbuch der Algorithmen},
series = {eXamen.press},
pages = {21--30},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-76394-9\_3},
doi = {10.1007/978-3-540-76394-9\_3},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Alt08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:reference/algo/2008t,
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Taschenbuch der Algorithmen},
series = {eXamen.press},
publisher = {Springer},
year = {2008},
isbn = {978-3-540-76393-2},
timestamp = {Fri, 25 Nov 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/algo/2008t.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/AhnAABBCKNSW07,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Tetsuo Asano and
Sang Won Bae and
Peter Brass and
Otfried Cheong and
Christian Knauer and
Hyeon{-}Suk Na and
Chan{-}Su Shin and
Alexander Wolff},
editor = {Joachim Gudmundsson and
C. Barry Jay},
title = {Constructing Optimal Highways},
booktitle = {Theory of Computing 2007. Proceedings of the Thirteenth Computing:
The Australasian Theory Symposium {(CATS2007).} January 30 - Febuary
2, 2007, Ballarat, Victoria, Australia, Proceedings},
series = {{CRPIT}},
volume = {65},
pages = {7--14},
publisher = {Australian Computer Society},
year = {2007},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV65Ahn.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/AhnAABBCKNSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/civr/AltSS07,
author = {Helmut Alt and
Ludmila Scharf and
Sven Scholz},
editor = {Nicu Sebe and
Marcel Worring},
title = {Probabilistic matching and resemblance evaluation of shapes in trademark
images},
booktitle = {Proceedings of the 6th {ACM} International Conference on Image and
Video Retrieval, {CIVR} 2007, Amsterdam, The Netherlands, July 9-11,
2007},
pages = {533--540},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1282280.1282357},
doi = {10.1145/1282280.1282357},
timestamp = {Mon, 19 Apr 2021 12:59:07 +0200},
biburl = {https://dblp.org/rec/conf/civr/AltSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/AltBKRT07,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
editor = {Pierluigi Crescenzi and
Giuseppe Prencipe and
Geppino Pucci},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
Italy, June 3-5, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4475},
pages = {16--29},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72914-3\_4},
doi = {10.1007/978-3-540-72914-3\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/AltBKRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0703011,
author = {Helmut Alt and
Maike Buchin},
title = {Can we Compute the Similarity Between Surfaces?},
journal = {CoRR},
volume = {abs/cs/0703011},
year = {2007},
url = {http://arxiv.org/abs/cs/0703011},
eprinttype = {arXiv},
eprint = {cs/0703011},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0703011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0703037,
author = {Hee{-}Kap Ahn and
Helmut Alt and
Tetsuo Asano and
Sang Won Bae and
Peter Brass and
Otfried Cheong and
Christian Knauer and
Hyeon{-}Suk Na and
Chan{-}Su Shin and
Alexander Wolff},
title = {Constructing Optimal Highways},
journal = {CoRR},
volume = {abs/cs/0703037},
year = {2007},
url = {http://arxiv.org/abs/cs/0703037},
eprinttype = {arXiv},
eprint = {cs/0703037},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0703037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltABEFKLMW06,
author = {Helmut Alt and
Esther M. Arkin and
Herv{\'{e}} Br{\"{o}}nnimann and
Jeff Erickson and
S{\'{a}}ndor P. Fekete and
Christian Knauer and
Jonathan Lenchner and
Joseph S. B. Mitchell and
Kim Whittlesey},
editor = {Nina Amenta and
Otfried Cheong},
title = {Minimum-cost coverage of point sets by disks},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
Sedona, Arizona, USA, June 5-7, 2006},
pages = {449--458},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1137856.1137922},
doi = {10.1145/1137856.1137922},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltABEFKLMW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AltCV05,
author = {Helmut Alt and
Otfried Cheong and
Antoine Vigneron},
title = {The Voronoi Diagram of Curved Objects},
journal = {Discret. Comput. Geom.},
volume = {34},
number = {3},
pages = {439--453},
year = {2005},
url = {https://doi.org/10.1007/s00454-005-1192-0},
doi = {10.1007/S00454-005-1192-0},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AltCV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Alt05,
author = {Helmut Alt},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {133},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-3802-2},
doi = {10.1007/S00224-004-3802-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Alt05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/AltB05,
author = {Helmut Alt and
Maike Buchin},
title = {Semi-computability of the Fr{\'{e}}chet distance between surfaces},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {45--48},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/12.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/AltB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltKW03,
author = {Helmut Alt and
Christian Knauer and
Carola Wenk},
title = {Comparison of Distance Measures for Planar Curves},
journal = {Algorithmica},
volume = {38},
number = {1},
pages = {45--58},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1042-5},
doi = {10.1007/S00453-003-1042-5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AltKW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AltERW03,
author = {Helmut Alt and
Alon Efrat and
G{\"{u}}nter Rote and
Carola Wenk},
title = {Matching planar maps},
journal = {J. Algorithms},
volume = {49},
number = {2},
pages = {262--283},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00085-3},
doi = {10.1016/S0196-6774(03)00085-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/AltERW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AltGG03,
author = {Helmut Alt and
Marc Glisse and
Xavier Goaoc},
title = {On the worst-case complexity of the silhouette of a polytope},
booktitle = {Proceedings of the 15th Canadian Conference on Computational Geometry,
CCCG'03, Halifax, Canada, August 11-13, 2003},
pages = {51--55},
year = {2003},
url = {http://www.cccg.ca/proceedings/2003/12.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/AltGG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltKRW03,
author = {Helmut Alt and
Christian Knauer and
G{\"{u}}nter Rote and
Sue Whitesides},
editor = {Steven Fortune},
title = {The complexity of (un)folding},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {164--170},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777818},
doi = {10.1145/777792.777818},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltKRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/WenkAEPR03,
author = {Carola Wenk and
Helmut Alt and
Alon Efrat and
Lingeshwaran Palaniappan and
G{\"{u}}nter Rote},
editor = {Steven Fortune},
title = {Finding a curve in a map},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {384--385},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777855},
doi = {10.1145/777792.777855},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/WenkAEPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AltERW03,
author = {Helmut Alt and
Alon Efrat and
G{\"{u}}nter Rote and
Carola Wenk},
title = {Matching planar maps},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {589--598},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644207},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AltERW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2003,
editor = {Helmut Alt and
Michel Habib},
title = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3},
doi = {10.1007/3-540-36494-3},
isbn = {3-540-00623-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2002,
editor = {Helmut Alt and
Afonso Ferreira},
title = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2285},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45841-7},
doi = {10.1007/3-540-45841-7},
isbn = {3-540-43283-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ac/Alt01,
author = {Helmut Alt},
editor = {Helmut Alt},
title = {The Nearest Neighbor},
booktitle = {Computational Discrete Mathematics, Advanced Lectures},
series = {Lecture Notes in Computer Science},
volume = {2122},
pages = {13--24},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45506-X\_2},
doi = {10.1007/3-540-45506-X\_2},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/ac/Alt01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltH01,
author = {Helmut Alt and
Laura Heinrich{-}Litan},
editor = {Diane L. Souvaine},
title = {Exact L\({}_{\mbox{infty}}\) Nearest Neighbor Search in High Dimensions},
booktitle = {Proceedings of the Seventeenth Annual Symposium on Computational Geometry,
Medford, MA, USA, June 3-5, 2001},
pages = {157--163},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/378583.378655},
doi = {10.1145/378583.378655},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AltKW01,
author = {Helmut Alt and
Christian Knauer and
Carola Wenk},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Matching Polygonal Curves with Respect to the Fr{\'{e}}chet Distance},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {63--74},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_6},
doi = {10.1007/3-540-44693-1\_6},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AltKW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ac/2001cdm,
editor = {Helmut Alt},
title = {Computational Discrete Mathematics, Advanced Lectures},
series = {Lecture Notes in Computer Science},
volume = {2122},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45506-X},
doi = {10.1007/3-540-45506-X},
isbn = {3-540-42775-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ac/2001cdm.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AltFHNW00,
author = {Helmut Alt and
Stefan Felsner and
Ferran Hurtado and
Marc Noy and
Emo Welzl},
title = {A class of point-sets with few k-sets},
journal = {Comput. Geom.},
volume = {16},
number = {2},
pages = {95--101},
year = {2000},
url = {https://doi.org/10.1016/S0925-7721(00)00006-7},
doi = {10.1016/S0925-7721(00)00006-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AltFHNW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/AltH00,
author = {Helmut Alt and
Ferran Hurtado},
editor = {Jin Akiyama and
Mikio Kano and
Masatsugu Urabe},
title = {Packing Convex Polygons into Rectangular Boxes},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG}
2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2098},
pages = {67--80},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-47738-1\_5},
doi = {10.1007/3-540-47738-1\_5},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/AltH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/AltG00,
author = {Helmut Alt and
Leonidas J. Guibas},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Discrete Geometric Shapes: Matching, Interpolation, and Approximation},
booktitle = {Handbook of Computational Geometry},
pages = {121--153},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50004-8},
doi = {10.1016/B978-044482537-7/50004-8},
timestamp = {Fri, 28 Jun 2019 09:10:30 +0200},
biburl = {https://dblp.org/rec/books/el/00/AltG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AltFK99,
author = {Helmut Alt and
Ulrich Fuchs and
Klaus Kriegel},
title = {On The Number Of Simple Cycles In Planar Graphs},
journal = {Comb. Probab. Comput.},
volume = {8},
number = {5},
pages = {397--405},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46739},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AltFK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltFRW98,
author = {Helmut Alt and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Gerald Weber},
title = {Matching Convex Shapes with Respect to the Symmetric Difference},
journal = {Algorithmica},
volume = {21},
number = {1},
pages = {89--103},
year = {1998},
url = {https://doi.org/10.1007/PL00009210},
doi = {10.1007/PL00009210},
timestamp = {Sun, 12 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AltFRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AltGW98,
author = {Helmut Alt and
Michael Godau and
Sue Whitesides},
title = {Universal 3-dimensional visibility representations for graphs},
journal = {Comput. Geom.},
volume = {9},
number = {1-2},
pages = {111--125},
year = {1998},
url = {https://doi.org/10.1016/S0925-7721(97)00015-1},
doi = {10.1016/S0925-7721(97)00015-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AltGW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltFHN98,
author = {Helmut Alt and
Stefan Felsner and
Ferran Hurtado and
Marc Noy},
editor = {Ravi Janardan},
title = {Point-Sets with few \emph{k}-Sets},
booktitle = {Proceedings of the Fourteenth Annual Symposium on Computational Geometry,
Minneapolis, Minnesota, USA, June 7-10, 1998},
pages = {200--205},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276884.276907},
doi = {10.1145/276884.276907},
timestamp = {Mon, 14 Jun 2021 16:25:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltFHN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AichholzerAR97,
author = {Oswin Aichholzer and
Helmut Alt and
G{\"{u}}nter Rote},
title = {Matching Shapes with a Reference Point},
journal = {Int. J. Comput. Geom. Appl.},
volume = {7},
number = {4},
pages = {349--363},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000211},
doi = {10.1142/S0218195997000211},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AichholzerAR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltWW97,
author = {Helmut Alt and
Emo Welzl and
Barbara Wolfers},
editor = {Jean{-}Daniel Boissonnat},
title = {Piecewise Linear Approximation of B{\'{e}}zier-Curves},
booktitle = {Proceedings of the Thirteenth Annual Symposium on Computational Geometry,
Nice, France, June 4-6, 1997},
pages = {433--435},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/262839.263068},
doi = {10.1145/262839.263068},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltWW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AltFK97,
author = {Helmut Alt and
Ulrich Fuchs and
Klaus Kriegel},
editor = {Rolf H. M{\"{o}}hring},
title = {On the Number of Simple Cycles in Planar Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {15--24},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024484},
doi = {10.1007/BFB0024484},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AltFK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltGMKW96,
author = {Helmut Alt and
Leonidas J. Guibas and
Kurt Mehlhorn and
Richard M. Karp and
Avi Wigderson},
title = {A Method for Obtaining Randomized Algorithms with Small Tail Probabilities},
journal = {Algorithmica},
volume = {16},
number = {4/5},
pages = {543--547},
year = {1996},
url = {https://doi.org/10.1007/BF01940879},
doi = {10.1007/BF01940879},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AltGMKW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AltFRW96,
author = {Helmut Alt and
Ulrich Fuchs and
G{\"{u}}nter Rote and
Gerald Weber},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Matching Convex Shapes with Respect to the Symmetric Difference},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {320--333},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_65},
doi = {10.1007/3-540-61680-2\_65},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AltFRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/AltBB95,
author = {Helmut Alt and
Bernd Behrends and
Johannes Bl{\"{o}}mer},
title = {Approximate Matching of Polygonal Shapes},
journal = {Ann. Math. Artif. Intell.},
volume = {13},
number = {3-4},
pages = {251--265},
year = {1995},
url = {https://doi.org/10.1007/BF01530830},
doi = {10.1007/BF01530830},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/AltBB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AltG95,
author = {Helmut Alt and
Michael Godau},
title = {Computing the Fr{\'{e}}chet distance between two polygonal curves},
journal = {Int. J. Comput. Geom. Appl.},
volume = {5},
pages = {75--91},
year = {1995},
url = {https://doi.org/10.1142/S0218195995000064},
doi = {10.1142/S0218195995000064},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AltG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AltHS95,
author = {Helmut Alt and
David Hsu and
Jack Snoeyink},
title = {Computing the largest inscribed isothetic rectangle},
booktitle = {Proceedings of the 7th Canadian Conference on Computational Geometry,
Quebec City, Quebec, Canada, August 1995},
pages = {67--72},
publisher = {Carleton University, Ottawa, Canada},
year = {1995},
url = {http://www.cccg.ca/proceedings/1995/cccg1995\_0011.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/AltHS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltS95,
author = {Helmut Alt and
Otfried Schwarzkopf},
editor = {Jack Snoeyink},
title = {The Voronoi Diagram of Curved Objects},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {89--97},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220289},
doi = {10.1145/220279.220289},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AltGW95,
author = {Helmut Alt and
Michael Godau and
Sue Whitesides},
editor = {Franz{-}Josef Brandenburg},
title = {Universal 3-Dimensional Visibility Representations for Graphs},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany,
September 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1027},
pages = {8--19},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0021785},
doi = {10.1007/BFB0021785},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/AltGW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/WeberKH94,
author = {Gerald Weber and
Lars Knipping and
Helmut Alt},
title = {An Application of Point Pattern Matching in Astronautics},
journal = {J. Symb. Comput.},
volume = {17},
number = {4},
pages = {321--340},
year = {1994},
url = {https://doi.org/10.1006/jsco.1994.1022},
doi = {10.1006/JSCO.1994.1022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/WeberKH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltAR94,
author = {Helmut Alt and
Oswin Aichholzer and
G{\"{u}}nter Rote},
editor = {Kurt Mehlhorn},
title = {Matching Shapes with a Reference Point},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {85--92},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.177555},
doi = {10.1145/177424.177555},
timestamp = {Mon, 14 Jun 2021 16:25:06 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltAR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AltFKMNSU92,
author = {Helmut Alt and
Rudolf Fleischer and
Michael Kaufmann and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Stefan Schirra and
Christian Uhrig},
title = {Approximate Motion Planning and the Complexity of the Boundary of
the Union of Simple Geometric Figures},
journal = {Algorithmica},
volume = {8},
number = {5{\&}6},
pages = {391--406},
year = {1992},
url = {https://doi.org/10.1007/BF01758853},
doi = {10.1007/BF01758853},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AltFKMNSU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AltGM92,
author = {Helmut Alt and
Viliam Geffert and
Kurt Mehlhorn},
title = {A Lower Bound for the Nondeterministic Space Complexity of Context-Free
Recognition},
journal = {Inf. Process. Lett.},
volume = {42},
number = {1},
pages = {25--27},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90127-H},
doi = {10.1016/0020-0190(92)90127-H},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AltGM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltG92,
author = {Helmut Alt and
Michael Godau},
editor = {David Avis},
title = {Measuring the Resemblance of Polygonal Curves},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {102--109},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142699},
doi = {10.1145/142675.142699},
timestamp = {Mon, 14 Jun 2021 16:24:47 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dfg/AltB92,
author = {Helmut Alt and
Johannes Bl{\"{o}}mer},
editor = {Burkhard Monien and
Thomas Ottmann},
title = {Resemblance and Symmetries of Geometric Patterns},
booktitle = {Data Structures and Efficient Algorithms, Final Report on the {DFG}
Special Joint Initiative},
series = {Lecture Notes in Computer Science},
volume = {594},
pages = {1--24},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55488-2\_19},
doi = {10.1007/3-540-55488-2\_19},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/dfg/AltB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AltBMP91,
author = {Helmut Alt and
Norbert Blum and
Kurt Mehlhorn and
Markus Paul},
title = {Computing a Maximum Cardinality Matching in a Bipartite Graph in Time
O({\^{}}1.5 sqrt m/log n)},
journal = {Inf. Process. Lett.},
volume = {37},
number = {4},
pages = {237--240},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90195-N},
doi = {10.1016/0020-0190(91)90195-N},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AltBMP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltBB91,
author = {Helmut Alt and
Bernd Behrends and
Johannes Bl{\"{o}}mer},
editor = {Robert L. Scot Drysdale},
title = {Approximate Matching of Polygonal Shapes (Extended Abstract)},
booktitle = {Proceedings of the Seventh Annual Symposium on Computational Geometry,
North Conway, NH, USA, , June 10-12, 1991},
pages = {186--193},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/109648.109669},
doi = {10.1145/109648.109669},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltBB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltFKMNSU90,
author = {Helmut Alt and
Rudolf Fleischer and
Michael Kaufmann and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Stefan Schirra and
Christian Uhrig},
editor = {Raimund Seidel},
title = {Approximate Motion Planning and the Complexity of the Boundary of
the Union of Simple Geometric Figures},
booktitle = {Proceedings of the Sixth Annual Symposium on Computational Geometry,
Berkeley, CA, USA, June 6-8, 1990},
pages = {281--289},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/98524.98592},
doi = {10.1145/98524.98592},
timestamp = {Mon, 14 Jun 2021 16:24:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltFKMNSU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AltBW90,
author = {Helmut Alt and
Johannes Bl{\"{o}}mer and
Hubert Wagener},
editor = {Mike Paterson},
title = {Approximation of Convex Polygons},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {703--716},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032068},
doi = {10.1007/BFB0032068},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AltBW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/YapA89,
author = {Chee{-}Keng Yap and
Helmut Alt},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Motion Planning in the CL-Environment (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
August 17-19, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {382},
pages = {373--380},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9\_31},
doi = {10.1007/3-540-51542-9\_31},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/YapA89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AltMWW88,
author = {Helmut Alt and
Kurt Mehlhorn and
Hubert Wagener and
Emo Welzl},
title = {Congruence, Similarity, and Symmetries of Geometric Objects},
journal = {Discret. Comput. Geom.},
volume = {3},
pages = {237--256},
year = {1988},
url = {https://doi.org/10.1007/BF02187910},
doi = {10.1007/BF02187910},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AltMWW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/AltW88,
author = {Helmut Alt and
Hubert Wagener},
title = {Approximation of Polygons by Rechtangles and Circles},
journal = {Bull. {EATCS}},
volume = {36},
pages = {103--112},
year = {1988},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/AltW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Alt88,
author = {Helmut Alt},
title = {Comparing the combinational complexities of arithmetic functions},
journal = {J. {ACM}},
volume = {35},
number = {2},
pages = {447--460},
year = {1988},
url = {https://doi.org/10.1145/42282.214084},
doi = {10.1145/42282.214084},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Alt88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/AltW88,
author = {Helmut Alt and
Emo Welzl},
title = {Visibility graphs and obstacle-avoiding shortest paths},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {32},
number = {3-4},
pages = {145--164},
year = {1988},
url = {https://doi.org/10.1007/BF01928918},
doi = {10.1007/BF01928918},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/AltW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MehlhornNA88,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Helmut Alt},
title = {A Lower Bound on the Complexity of the Union-Split-Find Problem},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {6},
pages = {1093--1102},
year = {1988},
url = {https://doi.org/10.1137/0217070},
doi = {10.1137/0217070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornNA88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AltHMP87,
author = {Helmut Alt and
Torben Hagerup and
Kurt Mehlhorn and
Franco P. Preparata},
title = {Deterministic Simulation of Idealized Parallel Computers on More Realistic
Ones},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {5},
pages = {808--835},
year = {1987},
url = {https://doi.org/10.1137/0216053},
doi = {10.1137/0216053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AltHMP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AltMWW87,
author = {Helmut Alt and
Kurt Mehlhorn and
Hubert Wagener and
Emo Welzl},
editor = {D. Soule},
title = {Congruence, Similarity, and Symmetries of Geometric Objects},
booktitle = {Proceedings of the Third Annual Symposium on Computational Geometry,
Waterloo, Ontario, Canada, June 8-10, 1987},
pages = {308--315},
publisher = {{ACM}},
year = {1987},
url = {https://doi.org/10.1145/41958.41991},
doi = {10.1145/41958.41991},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AltMWW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MehlhornNA87,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Helmut Alt},
editor = {Thomas Ottmann},
title = {A Lower Bound for the Complexity of the Union-Split-Find Problem},
booktitle = {Automata, Languages and Programming, 14th International Colloquium,
ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {267},
pages = {479--488},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_41},
doi = {10.1007/3-540-18088-5\_41},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MehlhornNA87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/paa/AltHMP87,
author = {Helmut Alt and
Torben Hagerup and
Kurt Mehlhorn and
Franco P. Preparata},
editor = {Andreas Alexander Albrecht and
Hermann Jung and
Kurt Mehlhorn},
title = {Deterministic Simulation of Idealized Parallel Computers on more Realistic
Ones},
booktitle = {Parallel Algorithms and Architectures, International Workshop, Suhl,
GDR, May 25-30, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {269},
pages = {11--15},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18099-0\_24},
doi = {10.1007/3-540-18099-0\_24},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/paa/AltHMP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AltHMP86,
author = {Helmut Alt and
Torben Hagerup and
Kurt Mehlhorn and
Franco P. Preparata},
editor = {Jozef Gruska and
Branislav Rovan and
Juraj Wiedermann},
title = {Deterministic Simulation of Idealized Parallel Computers on More Realistic
Ones},
booktitle = {Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia,
August 25-29, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {233},
pages = {199--208},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/BFb0016243},
doi = {10.1007/BFB0016243},
timestamp = {Sat, 30 Sep 2023 09:52:35 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AltHMP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AltM85,
author = {Helmut Alt and
Kurt Mehlhorn},
title = {Searching Semisorted Tables},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {840--848},
year = {1985},
url = {https://doi.org/10.1137/0214059},
doi = {10.1137/0214059},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AltM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Alt85,
author = {Helmut Alt},
title = {Multiplication is the Easiest Nontrivial Arithmetic Function},
journal = {Theor. Comput. Sci.},
volume = {36},
pages = {333--339},
year = {1985},
url = {https://doi.org/10.1016/0304-3975(85)90051-9},
doi = {10.1016/0304-3975(85)90051-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Alt85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AltMM84,
author = {Helmut Alt and
Kurt Mehlhorn and
J. Ian Munro},
title = {Partial Match Retrieval in Implicit Data Structures},
journal = {Inf. Process. Lett.},
volume = {19},
number = {2},
pages = {61--65},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90098-X},
doi = {10.1016/0020-0190(84)90098-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AltMM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Alt84,
author = {Helmut Alt},
editor = {Richard A. DeMillo},
title = {Comparison of Arithmetic Functions with Respect to Boolean Circuit
Depth (Extended Abstract)},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {466--470},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808714},
doi = {10.1145/800057.808714},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Alt84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Alt83,
author = {Helmut Alt},
title = {Multiplication Is the Easiest Nontrivial Arithmetic Function},
booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson,
Arizona, USA, 7-9 November 1983},
pages = {320--322},
publisher = {{IEEE} Computer Society},
year = {1983},
url = {https://doi.org/10.1109/SFCS.1983.36},
doi = {10.1109/SFCS.1983.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Alt83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/AltL81,
author = {Helmut Alt and
Jan van Leeuwen},
title = {The complexity of basic complex operations},
journal = {Computing},
volume = {27},
number = {3},
pages = {205--215},
year = {1981},
url = {https://doi.org/10.1007/BF02237978},
doi = {10.1007/BF02237978},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/AltL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AltMM81,
author = {Helmut Alt and
Kurt Mehlhorn and
J. Ian Munro},
editor = {Jozef Gruska and
Michal Chytil},
title = {Partial Match Retrieval in Implicit Data Structures},
booktitle = {Mathematical Foundations of Computer Science 1981, Strbske Pleso,
Czechoslovakia, August 31 - September 4, 1981, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {118},
pages = {156--161},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/3-540-10856-4\_81},
doi = {10.1007/3-540-10856-4\_81},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AltMM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Alt80,
author = {Helmut Alt},
editor = {J. W. de Bakker and
Jan van Leeuwen},
title = {Functions Equivalent to Integer Multiplication},
booktitle = {Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout,
The Netherlands, July 14-18, 1980, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {85},
pages = {30--37},
publisher = {Springer},
year = {1980},
url = {https://doi.org/10.1007/3-540-10003-2\_57},
doi = {10.1007/3-540-10003-2\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Alt80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Alt79,
author = {Helmut Alt},
title = {Lower Bounds on Space Complexity for Contextfree Recognition},
journal = {Acta Informatica},
volume = {12},
pages = {33--61},
year = {1979},
url = {https://doi.org/10.1007/BF00264016},
doi = {10.1007/BF00264016},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Alt79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Alt79,
author = {Helmut Alt},
title = {Square rooting is as difficult as multiplication},
journal = {Computing},
volume = {21},
number = {3},
pages = {221--232},
year = {1979},
url = {https://doi.org/10.1007/BF02253055},
doi = {10.1007/BF02253055},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Alt79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/AltM79,
author = {Helmut Alt and
Kurt Mehlhorn},
title = {Complexity arguments in algebraic language theory},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {13},
number = {3},
pages = {217--225},
year = {1979},
url = {https://doi.org/10.1051/ita/1979130302171},
doi = {10.1051/ITA/1979130302171},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/AltM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AltL79,
author = {Helmut Alt and
Jan van Leeuwen},
editor = {Lothar Budach},
title = {The complexity of complex division (extended abstract)},
booktitle = {Fundamentals of Computation Theory, {FCT} 1979, Proceedings of the
Conference on Algebraic, Arthmetic, and Categorial Methods in Computation
Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979},
pages = {13--17},
publisher = {Akademie-Verlag, Berlin},
year = {1979},
timestamp = {Mon, 29 Jul 2019 11:58:23 +0200},
biburl = {https://dblp.org/rec/conf/fct/AltL79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/Alt77,
author = {Helmut Alt},
editor = {Hans Tzschach and
H. Waldschmidt and
Hermann K.{-}G. Walter},
title = {Eine untere Schranke f{\"{u}}r den Platzbedarf bei der Analyse
beschr{\"{a}}nkter kontextfreier Sprachen},
booktitle = {Theoretical Computer Science, 3rd GI-Conference, Darmstadt, Germany,
March 28-30, 1977, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {48},
pages = {123--131},
publisher = {Springer},
year = {1977},
url = {https://doi.org/10.1007/3-540-08138-0\_10},
doi = {10.1007/3-540-08138-0\_10},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/tcs/Alt77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Alt76,
author = {Helmut Alt},
title = {Eine untere Schranke f{\"{u}}r den Platzbedarf bei der Analyse
beschr{\"{a}}nkter kontextfreier Sprachen},
school = {Saarland University, Saarbr{\"{u}}cken, Germany},
year = {1976},
url = {https://d-nb.info/770774059},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Alt76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AltM76,
author = {Helmut Alt and
Kurt Mehlhorn},
editor = {S. Michaelson and
Robin Milner},
title = {Lower Bounds for the Space Complexity of Context-Free Recognition},
booktitle = {Third International Colloquium on Automata, Languages and Programming,
University of Edinburgh, UK, July 20-23, 1976},
pages = {338--354},
publisher = {Edinburgh University Press},
year = {1976},
timestamp = {Mon, 08 Jul 2019 10:58:24 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AltM76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/AltM75,
author = {Helmut Alt and
Kurt Mehlhorn},
title = {A language over a one symbol alphabet requiring only {O} (log log
n) space},
journal = {{SIGACT} News},
volume = {7},
number = {4},
pages = {31--33},
year = {1975},
url = {https://doi.org/10.1145/990502.990506},
doi = {10.1145/990502.990506},
timestamp = {Wed, 04 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/AltM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
