Dept. of Information Engineering., Chinese University of Hong Kong, Shatin, N.T., Hong Kong

Sidharth Jaggi

Dept. of Information Engineering., Chinese University of Hong Kong, Shatin, N.T., Hong Kong Ph No: (+852) 3163 4326, Fax. No: (+852) 2603 5032, [email protected] http://www.ie.cuhk.edu.hk/index.php?id=321

POSITION: Chinese University of Hong Kong 2007- present Assistant Professor, Department of Information Engineering

EXPERIENCE: Post-doctoral Associate, Massachusetts Institute of Technology 2006 Laboratory of Information and Decision Sciences

Graduate Studies, California Institute of Technology 2000-2005 Network coding. Network information theory, algorithms. Slepian-Wolf codes, communication complexity.

MSR Fellowship Internship, Microsoft Research, Redmond, WA., USA Summer 2003 Average-time quantum search algorithms.

MSR Fellowship Internship, Microsoft Research, Redmond, WA., USA Summer 2002 Developed the first polynomial-time algorithm for network multicast codes.

EDUCATION: California Institute of Technology 2001-2005 Ph.D. Electrical Engineering (Research Advisor: Michelle Effros) Thesis: Design and Analysis of Network Codes

M.S. Electrical Engineering 2000-2001

Indian Institute of Technology, Bombay B.Tech. Electrical Engineering 1996-2000

HONOURS AND AWARDS: Offered Harrington Faculty Fellowship at University of Texas at Austin 2007 Microsoft Research Fellowship Full tuition support. 2002-‘04 Engineering and Applied Sciences Division Fellowship, Caltech 2000-‘01 J. N. Tata Endowment Fund Scholarship Merit-based scholarship for studies abroad 2000 JNCASR Summer Fellowship Scholarship for undergraduate research 1998 AITS Scholarship Awarded by the Prime Minister of India 1996 IIT Entrance Exam 190th/100,000. Similar rankings in 5 other national examinations 1996 Regional Mathematical Olympiad 6th/2500 1994

ACADEMIC ACTIVITIES: Classes Taught Information Theory Network Coding Advanced Engineering Mathematics General Education Teaching Assistantships Information Theory 2001-‘05 Digital Signal Processing 2001-‘05 Computability and Complexity 2004 Data Compression 2003 Probability and Algorithms 2003 TPC Co-chair International Symposium on Network Coding, Calgary 2013 Moderator Network coding website 2011-present Secretary/Chair Information Theory Society, Hong Kong Chapter 2008/’09 Co-Organizer Information Theory Workshop (HK/Taiwan/Macau) 2009 Graduate student advisor Co-supervising two Ph.D. students (CUHK/Tsinghua) 2007-present Guest Editor International Journal of Digital Multimedia Broadcasting 2010 Journal of Communications and Networks on Network Coding 2008 Technical Committee member ITCSC Winter school 2007 Intern mentor for international UG summer interns, publishing in reputable conferences 2007-‘09 International student recruiting trips Recruiting Indian UG/PG students for Hong Kong 2007 Caltech Pre-College Science Initiative Two-term course in science education 2003-‘04 TPC member NetCod08, NetCod2009, WiNC2009, WiOPT2009, WiNC 2010, NetCod 2010, ISITA 2010, NCC2011, NetCod 2011, ISIT2012, ISITA2012, NetCod2012 Paper reviewer DCC, IEEE Information Theory Trans., JSAC, Journal Discrete Algorithms, ISITA, NetCod, SODA, CIS, Globecom, NCC, Computer Journal, DISC, ICCS, Transactions of Networking, ITW, ZUSA, IEEE Communications Magazine, MobiCom, FOCS. Organizer Caltech Network Coding reading group 2003 Convener Caltech Communications Group seminars 2001-‘02

SUPERVISION/MENTORSHIP/VISITORS Postdoctoral scholars mentored Mayank Bakshi 2011-present Qifu (Tyler) Sun 2011-present Samar Agnihotri 2010-present Yaping Li 2009-‘10 Research assistants Tengyu Zhang 2009-‘10 Graduate students Sheng Cai, Qiwen Wang, Pak Hou Che, Xiaoming Xia 2010-present Hongyi Yao (Tsinghua university/mentored) 2008-‘10 Summer interns Ali Sadeghian, Fereshte Khani 2011 Vineet Pandey 2009 Saurabh Shintre, Morteza Alamgir, Amin Rahimian 2008 Saurabh Shintre, Sagar Shenvi 2007 Visitors Michael Langberg 2011 Hulya Seferoglu, Hongyi Yao 2010 Alon Rosen, Michelle Effros, Mayank Bakshi, Anand Sarwate, Salman Avestimehr 2009 Michael Langberg, Bikash Kumar Dey 2008

GRANTS AWARDED CUHK Direct grant “Efficient codes for wireless networks” 2011 SHAIE Wireless network coding over relay networks 2011 CDG Course Development grant, Teach Engineering Mathematics via computers (CUHK) 2010 CUHK Direct grant “Codes against real-time adversaries” 2010 Google grant “Group testing: Bounds and algorithms” 2010 AoE grant (co-I) “Institute of Network Coding” 2009 CDG Course Development grant for Engineering Mathematics (CUHK) 2009 GRF grant “Network information theoretic codes via optimization techniques” 2009 GRF grant (co-I) “Streaming Capacity of Peer-to-Peer Networks: Impact of Practical Constraints and Network Coding” 2008 Cisco grant (co-I) “Re-Engineering the Network Layer with Network Coding” 2008 CERG grant “Network Tomography via Network Coding” 2008 CUHK Direct grant “Network Codes Resilient against Byzantine Adversaries” 2007 CERG grant “Compressed Sensing via Linear Network Coding” 2007

PUBLICATIONS AND PATENTS: Patent [1] S. Jaggi, K. Jain, Patent application 20050010675, “System and method for computing low complexity algebraic network codes for a multicast network.” Link

Book Chapter [2] S. Jaggi, M. Langberg, “Network Security” in Network coding: fundamentals and applications, Elsevier Inc., 2011 PDF of chapter, book.

Journal Papers [3] H. Yao, D. Silva, S. Jaggi, M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” under submission to the IEEE Transactions on Information Theory, Feb. 2012 PDF [4] C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", under submission to the IEEE Transactions on Information Theory, Feb. 2012. PDF. [5] B. K. Dey, S. Jaggi, M. Langberg and A. D. Sarwate, "Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", under submission to the IEEE Transactions on Information Theory, Feb. 2012. [6] Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” submitted to the IEEE Transactions on Networking, Jan 2012. PDF. [7] S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” submitted to the IEEE Transactions on Information Theory, Jan. 2012. PDF, [8] A. A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, submitted to the IEEE Transactions on Information Theory, Aug 2011. PDF. [9] T. K. Dikaliotis, T. Ho, S. Jaggi, S. Vyetrenko, H. Yao, M. Effros, J. Kliewer, E. Erez, “Multiple-access Network Information-ﬂow and Correction Codes,” IEEE Transactions on Information Theory, Special Issue: Facets of Coding Theory: from Algorithms to Networks (in honour of Ralf Koetter), Feb. 2011. PDF. [10] H. Yao, S. Jaggi, M. Chen, “Network coding tomography for network failures,” IEEE Transactions on Information Theory, 58(9), pp. 5922-5940, Sept. 2012. PDF [11] B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries,” submitted to the IEEE Transactions on Information Theory, Jan 2011. PDF [12] A.-H. Mohsenian-Rad, J. Huang, V. W.S. Wong, S. Jaggi, R. Schober, “Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding,” submitted to the IEEE Transactions on Communications, April 2011. PDF [13] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, M. Effros, “Resilient Network Coding in the Presence of Byzantine Adversaries,” IEEE Transactions on Information Theory, June 2008,vol 54, no. 6, 2596-2603. PDF [14] S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, L. Tolhuizen, “Polynomial Time Algorithms for Multicast Network Code Construction,” IEEE Transactions on Information Theory, June 2005, vol 51, no. 6, 1973-1982. PDF [15] S. Jaggi, A. Joshi, “Incorporating Spatial Variation in Density Enhances the Stability of Simple Population Dynamics Model,” Journal of Theoretical Biology, March 2001, vol. 209, no. 2, pp. 249-255(7). PDF.

Conference/Workshop Papers [16] S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime: Performance of Network Simplification” presented at ITW 2012. PDF. Poster. [17] M. Bakshi, S. Jaggi. S. Cai, and M. Chen, “SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits”, presented at Allerton 2012. PDF. Poster. Short writeup. Extended paper. Presentation. [18] C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, "Non-adaptive Group Testing: Explicit bounds and novel algorithms", presented at the International Symposium on Information Theory (ISIT), Boston, 2012. PDF. [19] S. Agnihotri, S. Jaggi, and M. Chen, "Analog Network Coding in General SNR Regime", presented at the International Symposium on Information Theory (ISIT), Boston, 2012. PDF. [20] B. K. Dey, S. Jaggi, Michael Langberg and A. D. Sarwate, "Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries", presented at the International Symposium on Information Theory (ISIT), Boston, 2012. PDF. [21] S. Agnihotri, S. Jaggi, and M. Chen, “Analog Network Coding in General SNR Regime: Performance of A Greedy Scheme”, presented at the Network Coding Workshop (NetCod), Boston, 2012. PDF. [22] C. L. Chan, S. Jaggi, V. Saligrama, S. Agnihotri, “Compressive sensing meets group testing: LP decoding for non-linear (disjunctive) measurements,” Information Theory and Applications Workshop, 2012, Invited talk. [23] O. F. Tekin, T. Ho, S. Jaggi, “On erasure correction coding for streaming,” Proceedings of Information Theory and Applications Workshop, 2012, Invited paper. PDF. [24] C. L. Chan, P. H. Che, S. Jaggi, V. Saligrama, “Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms”, presented at Allerton 2011, PDF, presentation [25] Q. Wang, S. Jaggi, S.-Y. Li, “Binary Error Correcting Network Codes”, presented at ITW 2011, Paraty, Brazil PDF, presentation. [26] S. Agnihotri, S. Jaggi, and M. Chen, “Amplify-and-Forward in Wireless Relay Networks”, presented at ITW 2011, Paraty, Brazil, PDF, extended version PDF, presentation [27] A. A. Gohari, S. Yang, S. Jaggi, “Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources”, presented at ISIT 2011, St. Petersburg, Russia, extended version PDF [28] Q. (Tyler) Sun, S. Jaggi, and S-Y. (Robert) Li, “Delay Invariant Convolutional Network Codes”, presented at ISIT 2011, St. Petersburg, Russia, docx, presentation. [29] T. Dikaliotis, H. Yao, T. Ho, S. Jaggi, and S. Avestimehr, “Computationally efficient near-optimal codes for wireless networks”, SPCOM 2012. PDF, presentation. [30] L. Xia, S. Vyetrenko, S. Jaggi, T. Ho, “Universal and robust distributed network codes,” presented at INFOCOM 2011. PDF, presentation. [31] H. Yao, S. Jaggi, M. Chen, “Network RS codes: Efficient Byzantine adversary Localization,” presented at Asilomar 2010. (Invited paper) PDF, presentation [32] M. Alamgir, S. Jaggi, H. Yao, “Obfuscated network codes,” presented at ITW 2010, Dublin, Ireland. (Invited talk) [33] H. Yao, T. K. Dikaliotis, S. Jaggi, T. Ho, “Multi-source operator channels: Efficient capacity-achieving codes,” presented at ITW 2010, Dublin, Ireland. PDF, presentation [34] M. Bakshi, S. Jaggi,. M. Effros, “Concatenated Polar Codes,” presented at ISIT 2010, Austin, TX, USA. PDF, presentation [35] B. K. Dey, S. Jaggi, M. Langberg, A. S. Sarwate, “Codes against Delayed Adversaries,” presented at ISIT 2010, Austin, TX. PDF, presentation [36] H. Yao, D. Silva, S. Jaggi, M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” presented at IEEE International Symposium on Network Coding (NetCod) 2010 PDF, presentation [37] H. Yao, S. Jaggi, M. Chen, “Passive network tomography for erroneous networks: A network coding approach,” presented at INFOCOM 2010, San Diego, CA. PDF, presentation [38] Y. Li, H. Yao, M. Chen, S. Jaggi, A. Rosen, “RIPPLE Authentication for Network Coding,” presented at INFOCOM 2010. PDF, presentation [39] P. H. Che, K.S. Man, S. Jaggi, “Non-adaptive combinatorial group testing,” presented at ITA workshop, UCSD, Feb 2010. [40] B. K. Dey, S. Jaggi, M. Langberg, “Codes against Online Adversaries,” presented at Allerton 2009. PDF, presentation. [41] S. Jaggi, B. K. Dey, M. Langberg, “Binary Causal-Adversary Channels,” presented at ISIT, Seoul, Korea, July 2009. PDF, presentation [42] Z. Shao, S. Jaggi. S.-Y. R. Li, “To code or not to code: rate optimality in node-capacitated networks,” presented at ISIT, Seoul, Korea, July 2009. PDF [43] A.-H. Mohsenian-Rad, J. Huang, V. W.S. Wong, S. Jaggi, R. Schober, “Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding,” presented at ICC, Dresden, Germany, June 2009. Extended version PDF [44] S. Jaggi, M. Langberg, B. K. Dey, “Causal-Adversarial Channels,” Invited talk, presented at ITA, UCSD, San Diego CA, January 2009. presentation [45] S. Shenvi, S. Jaggi, B.K. Dey, M. Langberg, “Real Slepian-Wolf Codes,” ISIT 2008, Toronto, ON, Canada. PDF [46] G. Sharma, S. Jaggi, B. K. Dey, “Network Coding tomography,” Invited talk, ITA Workshop, San Diego, CA, USA, 2008. PDF, presentation [47] S. Shintre, S. Jaggi, B. K. Dey, D. Katabi. M. Medard, “ “Real” and “Complex” Network Codes: Promises and Challenges”, 4th International Symposium on Network Coding, 2008, Hong Kong. PDF [48] S. Katti, S. Shintre, S. Jaggi, D. Katabi, M. Medard, “Real Network Codes”, Invited paper, 45th Allerton Conference, Allerton, 2007 PDF [49] S. Jaggi, M. Langberg, “Resilient Network Coding in the Presence of Eavesdropping Byzantine Adversaries,” ISIT 2007, Nice, France.(Error: Corrected version in NetCod10) [50] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, “Resilient Network Coding in the Presence of Byzantine Adversaries,” INFOCOM 2007, Anchorage, Alaska, USA. PDF, presentation [51] V. Doshi, D. Shah, M. Medard, S. Jaggi, “Distributed Functional Compression through Graph Coloring,”, Data Compression Conference 2007. PDF [52] S. Jaggi, T. Ho, M. Effros, “Zero-error Distributed Network Codes,” Invited talk, ITA Workshop, San Diego, CA, USA, 2007. [53] V. Doshi, D. Shah, M. Médard, S. Jaggi, “Graph Coloring and Conditional Graph Entropy,” Asilomar Conference on Signals, Systems, and Computers, November 2006. pp. 2137-2141. PDF [54] S. Jaggi, Y. Cassuto, M. Effros,, “Low Complexity Encoding for Network Codes,”ISIT 2006, Seattle. PDF [55] S. Jaggi, M. Langberg, T. Ho, M. Effros, “Correction of Adversarial Errors in Networks,” ISIT 2005, Adelaide, Australia. PDF [56] S. Jaggi, M. Effros, T. Ho, M. Médard, “On Linear Network Coding,” Invited talk, 42nd Allerton Conference, Allerton, USA. PDF [57] S. Jaggi, M. Effros, “Communication and Distributional Complexity of Joint Probability Mass Functions,” ISIT 2004, Chicago, Il, USA. PDF [58] S. Jaggi, P. A. Chou, K. Jain, “Low Complexity Algebraic Network Multicast Codes,” ISIT 2003, Yokohama, Japan. PDF (one-page) [59] Q. Zhao, S. Jaggi, M. Effros, “Side Information Source Coding: Low-Complexity Design and Source Independence,” Asilomar Conference on Signals and Systems 2002, Monterey, CA, USA. PDF [60] S. Jaggi, M. Effros, “Universal Linked Multiple Access Source Codes,” ISIT 2002, Lausanne, Switzerland. Extended version PDF

INVITED TUTORIALS: “Network coding”, Invited Tutorial, ICOIN, Busan, Korea. Jan 2010

“Network coding”, Invited Tutorial, HK-Taiwan-Macau Joint workshop on IT, Macau. August 2009

“Network coding security”, Invited Tutorial, NetCod 2009, EPFL, Lausanne, Switzerland. July 2009

LANGUAGES: Fluent in English and Hindi. Conversational in French. Learning Chinese (Mandarin/Cantonese)

ACTIVITIES AND INTERESTS: Founder, Life Unlimited, non-profit with emphasis on personal development.

Community Service Lucy Guernsey Award for Service – 2005 Caltech Y (Non-profit focusing on service, outdoor, leadership and cultural activities) 2002-‘05 Organizational Positions Member, Graduate Student Council 2004-‘05 Secretary, Graduate Review Board (Caltech Honour Code Committee) 2004-‘05 Vice President, Caltech Y 2004-‘05