Biography:Raimund Seidel

From HandWiki
Short description: German and Austrian theoretical computer scientist

Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.

Seidel was born in Graz, Austria, and studied with Hermann Maurer at the Graz University of Technology.[1] He earned his M.Sc. in 1981 from University of British Columbia under David G. Kirkpatrick.[2] He received his Ph.D. in 1987 from Cornell University under the supervision of John Gilbert.[3] After teaching at the University of California, Berkeley, he moved in 1994 to Saarland University.[4] In 1997, he and Christoph M. Hoffmann were program chairs for the Symposium on Computational Geometry. He was the vice president for Research and Technology Transfer at Saarland University from 1999 to 2003.[5] In 2014, he took over as Scientific Director of the Leibniz Center for Informatics (LZI) from Reinhard Wilhelm.[6] In May 2025, he was succeeded in this position by Holger Hermans.[7] Seidel was elected as the vice president for Sustainable Development and Strategy of Saarland University in 2024.[5]

Seidel invented backwards analysis of randomized algorithms and used it to analyze a simple linear programming algorithm that runs in linear time for problems of bounded dimension.[8] With his student Cecilia R. Aragon in 1989 he devised the treap data structure,[9][10][11] and he is also known for the Kirkpatrick–Seidel algorithm for computing two-dimensional convex hulls.[12]

References

  1. ↑ Profile in program for conference on significant advances in computer science, Graz University of Technology, 2007.
  2. ↑ Seidel, Raimund (1981). A convex hull algorithm optimal for point sets in even dimensions (M. Sc.). University of British Columbia. OCLC 606375013.
  3. ↑ Raimund G. Seidel at the Mathematics Genealogy Project.
  4. ↑ Profile at the Multimodal Computing and Interaction cluster, Saarland University.
  5. ↑ 5.0 5.1 "Senat wählt eine neue Vizepräsidentin und zwei Vizepräsidenten". 2024-03-20. https://www.uni-saarland.de/aktuell/senat-waehlt-vizepraesidium-30711.html. 
  6. ↑ Internationally renowned informatics center names new Scientific Director, Schloss Dagstuhl, March 30, 2014, http://www.dagstuhl.de/no_cache/ueber-dagstuhl/aktuelles/detail/meldung/524/, retrieved 2014-05-06 .
  7. ↑ Gerke, Michael (2025-04-24). "Schloss Dagstuhl to get new scientific management". https://www.dagstuhl.de/en/institute/news/2025/schloss-dagstuhl-under-new-scientific-management. 
  8. ↑ Seidel, R. (1991), "Small-dimensional linear programming and convex hulls made easy", Discrete & Computational Geometry 6 (1): 423–434, doi:10.1007/BF02574699 .
  9. ↑ Aragon, Cecilia R.; Seidel, Raimund (1989), "Randomized Search Trees", Proc. 30th Symp. Foundations of Computer Science (FOCS 1989), Washington, D.C.: IEEE Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 978-0-8186-1982-3 
  10. ↑ Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees", Algorithmica 16 (4/5): 464–497, doi:10.1007/s004539900061, http://citeseer.ist.psu.edu/seidel96randomized.html .
  11. ↑ Seidel, Raimund; Aragon, Cecilia R. (1995), "Randomized search trees", Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes (Saarbrücken: Saarländische Universitäts- und Landesbibliothek) 1995/06, doi:10.22028/D291-26146, https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/26202 
  12. ↑ Kirkpatrick, David G.; Seidel, Raimund (1986), "The ultimate planar convex hull algorithm", SIAM Journal on Computing 15 (1): 287–299, doi:10.1137/0215021. 
  • {{DBLP}} template missing ID and not present in Wikidata.



Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Raimund_Seidel&oldid=4404056"