Rudolf Ahlswede
From Wikipedia, the free encyclopedia
 |
This article may require cleanup to meet Wikipedia's quality standards. Please improve this article if you can. (July 2008) |
Rudolf F. Ahlswede (born in Dielmissen, Germany, on September 15, 1938) is a German mathematician. He studied mathematics, physics, and philosophy. He wrote his Ph.D. thesis in 1966, in Göttingen, with the topic "Contributions to the Shannon information theory in case of non-stationary channels". He dedicated himself in his further career to information theory and became one of the leading representatives of this area worldwide.
[edit] Life and work
 |
This article or section appears to have been copied and pasted from a source, possibly in violation of a copyright. Please edit this article to remove any non-free copyrighted content and attribute free content correctly. Follow the Guide to layout and the Manual of Style. Remove this template after editing. (http://www2.atword.jp/romeitaly/) |
In 1967, he joined the faculty of the Department of Mathematics, Ohio State University, Columbus, where he was promoted to Associate Professor in 1969 and to Professor in 1972. During 1970-1971 and 1974-1975, He has spent research semesters at Cornell University, Ithaca, NY,the University of Heidelberg, Heidelberg, Germany, the Instituto Nazionale di Alta Mathematica, Rome, Italy, Stanford University, Stanford, CA, and Nankai University, Tianjin, China. He was on leave at the University of Illinois, Urbana, and the University of Gottingen. In 1977,he joined and hold a Professorship at the University of Bielefeld, Bielefeld, Germany. He is coauthor of the book Suchprobleme (Stuttgart, Germany: Teubner, 1979) and the translation Search Problems (New York: Wiley, 1987). In 1988, he received together with Imre Csiszar the Best Paper Award of the IEEE Information Theory Society for work in the area of the hypothesis testing as well as in 1990 together with Gunter Dueck for a new theory of message identification. He has been awarded this prize twice. As an emeritus of Bielefeld University, Ahlswede received the Claude Elwood Shannon Award 2006 of the IEEE Information Theory Society. The prize is designated after Claude Elwood Shannon and since 1974 for outstanding achievements in the area of the information theory. The prize went only five times to scientists from outside the USA. Ahlswede's research interests include information theory, combinatorics, probability theory, statistics, and number theory. In 2000,Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li,and Raymond W. Yeung published a paper "Network Information Flow" in IEEE Transactions on Information Theory, VOL. 46, NO. 4, JULY 2000, this is the beginning of a new theory known as Network coding.
[edit] Books
- R. Ahlswede and I. Wegener, Suchprobleme, Teubner Verlag, Stuttgart, 1979.
- R. Ahlswede and I. Wegener, Search Problems, English Edition of "Suchprobleme" with Supplement of recent Literature,
- R.L. Graham, J.K. Leenstra, and R.E. Tarjan (Eds.), Wiley-Interscience Series in Discrete Mathematics and Optimization, 1987.
- I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sárkozy, I. Wegener and Z. Zhang (Eds.),Numbers, Information and Complexity, 50 articles in honour of Rudolf Ahlswede, Kluwer Academic Publishers, Boston, 2000.
- R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, and H. Mashurian (Eds.), General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Springer-Verlag, Vol. 4123, 2006.
- R. Ahlswede, L. Bäumer, and N. Cai (Eds.), General Theory of Information Transfer and Combinatorics, Discrete Applied Mathematics, Volume 156, Issue 9, 2008.
- R. Ahlswede and V. Blinovsky, Lectures on Advances in Combinatorics, Universitext, Springer-Verlag, 2008.
