Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Raimund Seidel

Theory of Computation

Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry. Born in Graz, he studied at the Graz University of Technology, took a master's degree at the University of British Columbia in 1981 and a doctorate at Cornell University in 1987. After teaching at the University of California, Berkeley, he moved to Saarland University in 1994 and later became scientific director of the Leibniz Center for Informatics. He 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. With his student Cecilia Aragon he devised the treap data structure, and he is also known for the Kirkpatrick-Seidel algorithm for two-dimensional convex hulls.

Facts
Nationality
Austrian 1
Nationality
German 1
Connections

Credited

Source NIST Dictionary of Algorithms and Data Structures: treap

In Field

Source Raimund Seidel (Wikipedia)

Invented

Source NIST Dictionary of Algorithms and Data Structures: treap
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Raimund Seidel (Wikipedia)Lead and short description
Quote, Lead and short description
is a German and Austrian theoretical computer scientist

Also in Geography Atlas: the nationality of this subject.

Source Raimund Seidel (Wikipedia)Lead and short description
Quote, Lead and short description
is a German and Austrian theoretical computer scientist
Sources
1. Raimund Seidel (Wikipedia)
  • Lead and short description
    is a German and Austrian theoretical computer scientist
  • In Group: Algorithm Design and Analysis, Lead
    Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.
  • In Field: Algorithms and Complexity Theory, Lead
    Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.
View the Source
NIST Dictionary of Algorithms and Data Structures: treap
NIST Dictionary of Algorithms and Data Structures
  • Credited: Treap Algorithm, References
    Raimund G. Seidel and Cecilia R. Aragon , Randomized Search Trees , Algorithmica, 16:464-497 (1996).
  • Invented: Treap Algorithm, References
    Raimund G. Seidel and Cecilia R. Aragon , Randomized Search Trees , Algorithmica, 16:464-497 (1996).
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.