| 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 | 692 | 2007 |
| 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 | 583 | 2011 |
| Universal ε-approximators for integrals M Langberg, LJ Schulman Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 231 | 2010 |
| The encoding complexity of network coding M Langberg, A Sprintson, J Bruck IEEE Transactions on Information Theory 52 (6), 2386-2397, 2006 | 207 | 2006 |
| 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 | 189 | 2015 |
| Approximation algorithms for maximization problems arising in graph partitioning U Feige, M Langberg Journal of Algorithms 41 (2), 174-211, 2001 | 188 | 2001 |
| Realtime classification for encrypted traffic R Bar-Yanai, M Langberg, D Peleg, L Roditty International Symposium on Experimental Algorithms, 373-385, 2010 | 180 | 2010 |
| On the hardness of approximating the network coding capacity M Langberg, A Sprintson IEEE Transactions on Information Theory 57 (2), 1008-1014, 2011 | 143 | 2011 |
| Fault-tolerant spanners for general graphs S Chechik, M Langberg, D Peleg, L Roditty Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 132 | 2009 |
| Local graph coloring and index coding K Shanmugam, AG Dimakis, M Langberg 2013 IEEE International Symposium on Information Theory, 1152-1156, 2013 | 117 | 2013 |
| The RPR2 rounding technique for semidefinite programs U Feige, M Langberg Journal of Algorithms 60 (1), 1-23, 2006 | 112* | 2006 |
| Communicating the sum of sources over a network A Ramamoorthy, M Langberg IEEE Journal on Selected Areas in Communications 31 (4), 655-665, 2013 | 103 | 2013 |
| Communication efficient secret sharing W Huang, M Langberg, J Kliewer, J Bruck IEEE Transactions on Information Theory 62 (12), 7195-7206, 2016 | 93 | 2016 |
| Correction of adversarial errors in networks S Jaggi, M Langberg, T Ho, M Effros Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 91 | 2005 |
| Private codes or succinct random codes that are (almost) perfect M Langberg FOCS 4, 325-334, 2004 | 90 | 2004 |
| 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 | 88 | 2015 |
| 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 | 87 | 2011 |
| Improved approximation of Max-Cut on graphs of bounded degree U Feige, M Karpinski, M Langberg Journal of Algorithms 43 (2), 201-219, 2002 | 81 | 2002 |
| Network coding: Is zero error always possible? M Langberg, M Effros 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011 | 62 | 2011 |
| Adversarial models and resilient schemes for network coding L Nutman, M Langberg 2008 IEEE International Symposium on Information Theory, 171-175, 2008 | 59 | 2008 |
Sidharth (Sid) JaggiProfessor, School of Mathematics, University of BristolVerified email at bristol.ac.uk
