University of California, Santa Barbara
Santa Barbara, CA 93106
Development of exact and approximation algorithms, and establishing complexity results for a wide range of problems arising in several different application areas. These problems include: message dissemination under the multicasting mode; scheduling structured and parallel processor systems; component placement and wire routing; and problems arising in computational geometry, graphs, partitioning, clustering, covering, code minimization, compression, statistical testing, etc.
PhD Computer Science, University of Minnesota, Minneapolis
BS Computer Science, ITESM