Rudolf Bayer
Jump to navigation
Jump to search
Rudolf Bayer | |
---|---|
Born | March 3, 1939 |
Nationality | German |
Alma mater | University of Illinois at Urbana–Champaign |
Known for | B-tree UB-tree red–black tree |
Awards | Cross of Merit, First class (1999), SIGMOD Edgar F. Codd Innovations Award (2001) |
Scientific career | |
Institutions | Technical University Munich |
Thesis | Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras (1966) |
Doctoral advisor | 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
- ^ Rudolf Bayer at the Mathematics Genealogy Project
- ^ GI-Fellow citation, retrieved 2012-03-09.
External links
Categories:
- Articles with short description
- Short description matches Wikidata
- Articles with hCards
- Articles with ISNI identifiers
- Articles with VIAF identifiers
- Articles with BIBSYS identifiers
- Articles with GND identifiers
- Articles with J9U identifiers
- Articles with LCCN identifiers
- Articles with NTA identifiers
- Articles with CINII identifiers
- Articles with DBLP identifiers
- Articles with MGP identifiers
- Articles with SUDOC identifiers
- 1939 births
- Living people
- German computer scientists
- Academic staff of the Technical University of Munich
- Database researchers
- Officers Crosses of the Order of Merit of the Federal Republic of Germany
- Grainger College of Engineering alumni
- All stub articles
- European computer specialist stubs