Michael Langberg
Michael Langberg
Verified email at buffalo.edu - Homepage
Title
Cited by
Cited by
Year
Resilient network coding in the presence of byzantine adversaries
S Jaggi, M Langberg, S Katti, T Ho, D Katabi, M Médard
IEEE INFOCOM 2007-26th IEEE International Conference on Computer …, 2007
5972007
A unified framework for approximating and clustering data
D Feldman, M Langberg
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
2462011
The encoding complexity of network coding
M Langberg, A Sprintson, J Bruck
IEEE Transactions on Information Theory 52 (6), 2386-2397, 2006
1952006
Approximation algorithms for maximization problems arising in graph partitioning
U Feige, M Langberg
Journal of Algorithms 41 (2), 174-211, 2001
1532001
An equivalence between network coding and index coding
M Effros, S El Rouayheb, M Langberg
IEEE Transactions on Information Theory 61 (5), 2478-2487, 2015
1392015
On the hardness of approximating the network coding capacity
M Langberg, A Sprintson
IEEE Transactions on Information Theory 57 (2), 1008-1014, 2011
1252011
Universal ε-approximators for integrals
M Langberg, LJ Schulman
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1002010
Realtime classification for encrypted traffic
R Bar-Yanai, M Langberg, D Peleg, L Roditty
International Symposium on Experimental Algorithms, 373-385, 2010
922010
Local graph coloring and index coding
K Shanmugam, AG Dimakis, M Langberg
2013 IEEE International Symposium on Information Theory, 1152-1156, 2013
892013
The RPR2 rounding technique for semidefinite programs
U Feige, M Langberg
Journal of Algorithms 60 (1), 1-23, 2006
87*2006
Correction of adversarial errors in networks
S Jaggi, M Langberg, T Ho, M Effros
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005
832005
On the complementary index coding problem
MAR Chaudhry, Z Asad, A Sprintson, M Langberg
2011 IEEE International Symposium on Information Theory Proceedings, 244-248, 2011
762011
Fault tolerant spanners for general graphs
S Chechik, M Langberg, D Peleg, L Roditty
SIAM Journal on Computing 39 (7), 3403-3423, 2010
762010
Private codes or succinct random codes that are (almost) perfect
M Langberg
FOCS 4, 325-334, 2004
722004
Communicating the sum of sources over a network
A Ramamoorthy, M Langberg
IEEE Journal on Selected Areas in Communications 31 (4), 655-665, 2013
712013
On the fundamental limits of caching in combination networks
M Ji, MF Wong, AM Tulino, J Llorca, G Caire, M Effros, M Langberg
2015 IEEE 16th International Workshop on Signal Processing Advances in …, 2015
592015
Improved approximation of Max-Cut on graphs of bounded degree
U Feige, M Karpinski, M Langberg
Journal of Algorithms 43 (2), 201-219, 2002
572002
Network codes resilient to jamming and eavesdropping
H Yao, D Silva, S Jaggi, M Langberg
IEEE/ACM Transactions on networking 22 (6), 1978-1987, 2014
552014
Network coding: Is zero error always possible?
M Langberg, M Effros
2011 49th Annual Allerton Conference on Communication, Control, and …, 2011
552011
On linear index coding for random graphs
I Haviv, M Langberg
2012 IEEE International Symposium on Information Theory Proceedings, 2231-2235, 2012
542012
The system can't perform the operation now. Try again later.
Articles 1–20