Rudolf Bayer

{{Short description|German computer scientist}}

{{Infobox scientist

| name = Rudolf Bayer

| birth_date = {{birth date and age|1939|03|03}}

| workplaces = Technical University Munich

| alma_mater = University of Illinois at Urbana–Champaign

| nationality = German

| thesis_title = Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras

| thesis_url = https://dx.doi.org/10.1109/SWAT.1966.5

| thesis_year = 1966

| doctoral_advisor = Franz Edward Hohn{{MathGenealogy|id=4649}}

| known_for = B-tree
UB-tree
red–black tree

| awards = Cross of Merit, First class (1999),
SIGMOD Edgar F. Codd Innovations Award (2001)

| 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.[https://web.archive.org/web/20110813230145/http://www.gi.de/fileadmin/redaktion/Wettbewerbe/Fellowship/fellow-bayer.pdf GI-Fellow citation], retrieved 2012-03-09.