Aravind Srinivasan

My contact information is below; my office as of March 2009 is 3263 A. V. Williams Building.

For prospective students: Please read this if you wish to email me about admissions or about working with me.

Local News: STOC 2009 took place in nearby Bethesda from May 31st to June 2nd, 2009. A celebration in honor of Leslie Valiant's 60th was held May 30th.

Education and Postdoctoral Fellowships

• B.Tech. (Computer Science), Indian Institute of Technology, Madras, 1989.
  Undergraduate advisor: Prof. C. Pandu Rangan
  
• Ph.D. (Computer Science), Cornell University, 1993.
  Ph.D. advisor: Prof. David B. Shmoys
  
• Postdoctoral research at the Institute for Advanced Study (Princeton) and DIMACS - Center for Discrete Math and Theoretical Computer Science (Rutgers), 1993-94.

Research

My main research-interests are in the following areas, and especially in their intersection: (i) algorithms and combinatorial optimization, (ii) randomness and computation, and (iii) networking, social networks & epidemiology, and distributed algorithms. The interaction of randomness with algorithms and networks pervades almost all of my work. Click here to hear Donald Knuth's thoughts on randomized algorithms -- this link is posted from Michael Rabin's Fall 2003 course page.

In more detail, much of my current research is in the following inter-related areas.

• Randomized algorithms, probabilistic combinatorics, and the role of randomness in computation;
• Algorithmic foundations of wireless networking;
• Peer-to-peer and overlay networks, robust and secure information-dissemination and retrieval;
• Social networks: models, dynamics, diffusion processes, and epidemiology;
• Combinatorial optimization: mainly approximation algorithms, stochastic optimization & game-theoretic issues; and
• Decentralized (i.e., distributed) algorithms: e.g., in social, wireless, and wired networks.

• Tom DuBois
• Bo Han (co-advised with Bobby Bhattacharjee)
• David Levin (co-advised with Bobby Bhattacharjee)
• Dr. Srinivasan Parthasarathy (Ph.D., Resource Allocation in Networked and Distributed Environments, 2006)
  Research Staff Member, IBM T. J. Watson Research Center.
• Dr. Nan Wang (Ph.D., Modeling and Analysis of Massive Social Networks, 2005)
  Vice President at Goldman Sachs.
• Levon Mkrtchyan (student of Montgomery Blair High School, Senior Research Project on Distributed Algorithms, 2006)
  Joined our university (Computer Science major) in Fall 2007, supported by a four-year President's Scholarship.
• Mike Kobyakov (independent study on Complex Networks, Fall 2005)
• Jennifer Roberts (undergraduate independent study on Quantum Computing, Spring 2004)
  Went on to graduate study at MIT.

Teaching

I will teach two courses in Fall 2009:

• Cryptology (CMSC/MATH 456) -- the required textbook will be Introduction to Modern Cryptography, First Edition (ISBN: 0-13-186239-1) by Jonathan Katz and Yehuda Lindell; and
• Complexity Theory (CMSC 652) -- there will be no required textbook, but the Arora-Barak book is recommended.

Honors and Professional Activities

• Journal Editorships:
  • Managing Editor, Theory of Computing (ToC), an open-access journal.
  • Associate Editor, Journal of Computer and System Sciences (JCSS).
  • Associate Editor, Networks.
  • Editor, Journal of Discrete Algorithms (JDA).
  • Guest Editor, along with S. Khanna, of the special issue of JCSS devoted to selected papers from STOC 2003: Journal of Computer and System Sciences, Volume 69, Number 3, 2004.
  • Guest Editor, along with P. Sanders and B. Voecking, of the special issue of Theory of Computing Systems (Volume 39, Number 6, 2006) devoted to selected papers from SPAA 2004.
  
  
• Program-committee memberships: STOC (2010, 2003), INFOCOM (2010, 2009), PODC 2009, GECCO 2009, RANDOM (2007, 2000), FST & TCS (2007, 2001, 1998), SPAA 2004, DIAL-M-POMC (2005, 2002, 2000), ASIAN 1999, ISAAC (1999, 1996), SODA 1998, and SWAT 1998.
• Conference organization: STOC (2009), Bertinoro Workshop on Wireless Networking (2007), Conference on Probabilistic Combinatorics & Algorithms (Joel Spencer's 60th, 2006), Algorithms in Networking (2005), STOC (2005), Bertinoro Workshop on Random Graphs and Randomized Algorithms (2002), DIMACS Mini-Workshop on Quality of Service Issues in the Internet (2001).
  
  
• Department Colloquia: Duke University, Johns Hopkins University, Princeton University, Swarthmore College, University of Connecticut, and the University of Iowa.
• Some recent invited/plenary talks: SAGA (2007), Midwest Theory Day (2006), Frieze Fest (2005), MOPTA (2002). Several additional seminars worldwide.
• S. Banerjee and I presented a tutorial on Performance of Peer-to-Peer Systems at Sigmetrics-Performance 2004.
  
  
• Co-Winner, Danny Lewin Best Student Paper Award for the paper ``Improved Distributed Algorithms for Coloring and Network Decomposition Problems'' coauthored with A. Panconesi, ACM Symposium on Theory of Computing (STOC), 1992.
• Best Paper Award for the paper "Distributed Ranked Search" coauthored with V. Gopalakrishnan, R. Morselli, B. Bhattacharjee, and P. Keleher, Annual International Conference on High Performance Computing (HiPC), 2007.
• Three U.S. patents: on Internet telephony, Web content distribution, and robust routing of data in networks.
• IBM Graduate Fellowship, 1992-1993.
• Research Fellowship, Mathematical Sciences Institute of Cornell University, Summer 1992.
• Eighth in India, Joint Entrance Examination for the Indian Institutes of Technology, 1985.

Address Information

• Room 3263, A. V. Williams Building, Dept. of Computer Science, University of Maryland at College Park, College Park, MD 20742.
• Phone: 301-405-2695, Fax: 301-405-6707.
• E-mail: srin AT cs DOT umd DOT edu