Rudolf Bayer

Rudolf Bayer
Born (1939-03-03) March 3, 1939
EducationUniversity of Illinois at Urbana–Champaign
Known forB-tree
UB-tree
red–black tree
AwardsCross of Merit, First class (1999),
SIGMOD Edgar F. Codd Innovations Award (2001)
Scientific career
WorkplacesTechnical University of Munich
ThesisAutomorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras (1966)
Franz Edward Hohn[1]
Doctoral students
Christel Baier
Volker Markl

Rudolf Bayer (born 3 March 1939) is a German computer scientist.

He is a professor emeritus of Informatics at the Technical University of Munich where he has 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


This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.