| 词条 | Rudolf Bayer |
| 释义 |
| name = Rudolf Bayer | birth_date = {{birth date and age|1939|05|07}} | 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[1] | known_for = B-tree UB-tree red-black tree |awards = Cross of Merit, First class (1999), SIGMOD Edgar F. Codd Innovations Award (2001) }} Rudolf Bayer (born 3 March 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] References1. ^{{MathGenealogy|id=4649}} 2. ^[https://web.archive.org/web/20110813230145/http://www.gi.de/fileadmin/redaktion/Wettbewerbe/Fellowship/fellow-bayer.pdf GI-Fellow citation], retrieved 2012-03-09. External links
6 : 1939 births|Living people|German computer scientists|Technical University of Munich faculty|Database researchers|Officers Crosses of the Order of Merit of the Federal Republic of Germany |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。