Sotabase

Career

· Senior Faculty, Senior Lecturer, The Open University of Israel2006–
· Postdoctoral Researcher, California Institute of Technology2003–2006
· Research Scholar, Tel-Aviv University2003–
· PhD in Computer Science, Weizmann Institute of Science1999–2003
· MS in Computer Science, Weizmann Institute of Science1997–1998
· B.Sc. in Mathematics and Computer Science, Tel-Aviv University1994–1996
· Former Postdoc, California Institute of Technology

Publications (172)

Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory · 2008
567
cited
A unified framework for approximating and clustering data
Symposium on the Theory of Computing · 2011
476
cited
The encoding complexity of network coding
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. · 2005
174
cited
An equivalence between network coding and index coding
2013 IEEE International Symposium on Information Theory · 2012
171
cited
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
J. Algorithms · 2001
161
cited
On the Hardness of Approximating the Network Coding Capacity
IEEE Transactions on Information Theory · 2008
132
cited
Universal ε-approximators for integrals
ACM-SIAM Symposium on Discrete Algorithms · 2010
131
cited
Realtime Classification for Encrypted Traffic
The Sea · 2010
108
cited
Local graph coloring and index coding
2013 IEEE International Symposium on Information Theory · 2013
106
cited
The RPR2 rounding technique for semidefinite programs
J. Algorithms · 2001
88
cited
Private codes or succinct random codes that are (almost) perfect
45th Annual IEEE Symposium on Foundations of Computer Science · 2004
81
cited
Communicating the Sum of Sources Over a Network
IEEE Journal on Selected Areas in Communications · 2010
79
cited
Fault-tolerant spanners for general graphs
Symposium on the Theory of Computing · 2009
77
cited
On the complementary Index Coding problem
IEEE International Symposium on Information Theory. Proceedings · 2011
76
cited
f-Sensitivity Distance Oracles and Routing Schemes
Algorithmica · 2010
74
cited
On the fundamental limits of caching in combination networks
International Workshop on Signal Processing Advances in Wireless Communications · 2015
72
cited
Communication Efficient Secret Sharing
IEEE Transactions on Information Theory · 2015
69
cited
Correction of adversarial errors in networks
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. · 2005
69
cited
Improved approximation of Max-Cut on graphs of bounded degree
J. Algorithms · 2002
68
cited
Universal epsilon-approximators for Integrals
ACM-SIAM Symposium on Discrete Algorithms · 2010
62
cited
Sotabase
Michael Langberg | Researcher Profile | Sotabase | Sotabase