Sloan Fellows announced

The Alfred P. Sloan Foundation recently selected 100 outstanding young scientists and economists to receive Sloan Research Fellowships. The 10 Computer Science Fellows and their research interests are:

Pankaj K. Agarwal: Duke University. Algorithms and combinatorial problems in geometry with applications in robotics, graphics and geometric optimization.

James H. Anderson: University of North Carolina. Focused mainly on mechanisms for concurrent object sharing in multiprocessor, real-time and distributed systems.

Sanjeev Arora: Princeton University. The approximation properties of NP-hard optimization problems. Interest in identifying problems that have (or do not have) good approximation algorithms.

Mary Baker: Stanford University. Distributed systems at many levels. Current focus on mobile and wireless computing issues, such as ubiquitous connectivity and performance bench-marking.

Martin Farach: Rutgers University. Computational molecular biology with emphasis on the construction of evolutionary trees and on string algorithm for nucleic acid comparison and database retrieval. Design and analysis of sequential and parallel algorithms.

Daphne Koller: Stanford University. Artificial intelligence and theoretical computer science with emphasis on dealing with uncertainty using principled mathematical tools from probability theory, decision theory and economics.

Ronitt Rubinfeld: Cornell University. In computational learning theory, investigating efficient algorithms for learning probabilistic finite automata. Also studying the correctness of computer systems.

Peter Schroder: California Institute of Technology. Developing mathematical and computational tools for making fast, efficient and robust computational systems for solving integral equations, PDEs and other large-scale simulation problems with high degrees of geometric complexity.

Shang-Hua Teng: University of Minnesota. Scientific computing, parallel computation, computational geometry, VLSI and circuit simulation, algorithms, combinatorial optimization and probabilistic analysis, distributed computing and cryptography.

David Zuckerman: University of Texas at Austin. The role of randomness in computation, complexity theory, expanders and their applications, random walks on graphs and cryptography.