Aravind Srinivasan

Contents:

• Ph.D. (Computer Science), Cornell University, 1993.
• B.Tech. (Computer Science), Indian Institute of Technology, Madras, 1989 (Madras is now called Chennai).

Publications and Research Interests

My general area of interest is the design and (theoretical/experimental) analysis of algorithms with applications in networking, combinatorial optimization, information retrieval, and related areas. Probabilistic methods underlie much of my work.

A finer classification of my interests is as follows.

• Network design and routing, and network optimization in general. For instance:
  • Optimization issues in Internet- and Web-related technologies, e.g., design/routing issues in Internet telephony, and retrieval scheduling;
  • Topology selection, routing and wavelength assignment, and wavelength rerouting in optical networking;
  • Packet switching: algorithms for path selection, low-congestion routing and QoS routing.
• Randomness and computation:
  • Randomized algorithms;
  • Average-case analysis of algorithms and probabilistic combinatorics;
  • Derandomization and pseudorandomness.
• Approximation algorithms in combinatorial optimization (e.g., in routing, scheduling, resource allocation, network design, and positive integer programming in general).
• Distributed and parallel algorithms (e.g., local-control algorithms for multiple-access channels, resource allocation, and network decomposition).

• Program committee member for:
  1. Twenty-First Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST & TCS), Bangalore, India, 2001.
  2. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility), Boston, USA, 2000.
  3. Fourth International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Geneva, Switzerland, 2000.
  4. Asian Computing Science Conference (ASIAN), Phuket, Thailand, 1999.
  5. Tenth Annual International Symposium on Algorithms and Computation (ISAAC), Chennai, India, 1999.
  6. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, USA, 1998.
  7. Eighteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST & TCS), Chennai, India, 1998.
  8. Sixth Scandinavian Workshop on Algorithm Theory (SWAT), Stockholm, Sweden, 1998.
  9. Seventh Annual International Symposium on Algorithms and Computation (ISAAC), Osaka, Japan, 1996.
• Co-Organizer, DIMACS Mini-Workshop on Quality of Service Issues in the Internet, February 2001.
• Keynote Speaker, Graduate Conference on Computer Science, State University of New York at Buffalo, March 1994.
• IBM Graduate Fellowship, 1992-1993.
• Research Fellowship, Mathematical Sciences Institute of Cornell University, Summer 1992.
• Co-Winner, 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.
• Eighth in India, Joint Entrance Examination for the Indian Institutes of Technology, 1985.

Algorithms and Computational Complexity

Operations Research

Mathematics

Bibliographies, Citation Index

Miscellany

• Room 2C-377, Bell Laboratories, Lucent Technologies, 600-700 Mountain Av., Murray Hill, NJ 07974-0636, USA.
• Phone: 908-582-6018, Fax: 908-582-3340.
• E-mail: srin@research.bell-labs.com