Rudolf Bayer

From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the Professor of Informatics. For the Wehrmacht soldier, see Rudolf Bayer (soldier).
Rudolf Bayer
Born (1939-05-07) May 7, 1939 (age 75)
Nationality German
Institutions Technical University Munich
Alma mater University of Illinois at Urbana–Champaign
Thesis Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras (1966)
Doctoral advisor Franz Edward Hohn[1]
Known for B-tree
UB-tree
red-black tree
Notable awards Cross of Merit, First class (1999),
SIGMOD Edgar F. Codd Innovations Award (2001)

Rudolf Bayer (born 7 May 1939) is a German computer scientist.

He is professor emeritus of Informatics at the Technical University of Munich where he had been employed since 1972. He is noted for inventing three data sorting structures: the B-tree (with Edward M. McCreight), the UB-tree (with Volker Markl) and the red-black tree.

Bayer is a recipient of 2001 ACM SIGMOD Edgar F. Codd Innovations Award. In 2005 he was elected as a fellow of the Gesellschaft für Informatik.[2]

References[edit]

External links[edit]