Michael Langberg
I am a faculty member in the Computer Science Division at The Open University of Israel. Previously, I was a postdoc at Caltech. I completed my PhD studies at the Weizmann Institute of Science in 2003 under the supervision of Uri Feige.
My studies and research are in the fields of Theoretical Computer Science and Information Theory. My broad area of interest is in the design and analysis of algorithms for combinatorial problems. I have special interest in algorithmic and combinatorial aspects of Information Theory and in the study of approximation algorithms for NP-hard problems. Closely related interests of mine include computational and combinatorial geometry, probabilistic methods in combinatorics, the use of randomization in computation, coding theory and computational complexity.
Events:
- Workshop on Network Coding (NetCod), Lausanne, Switzerland June 2009 (TPC memebr).
- 18th International Conference on Computer Communications and Networks. Track on Network Algorithms and Performance Evaluation (NAPE), San Francisco, August 2009 (TPC memebr).
- The 'Second Israel CS theory day' at the Open University on March 2 2009.
- The 'Israel CS theory day' at the Open University was very successful. Many thanks to the speakers and all the participants! The entire day was filmed and can be seen here.
-
Computer Science Colloquium at the Open University
|
Michael
Langberg |
972-9-778-1291 (office) |