GUY BLELLOCH Professor Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 [email protected], http://www.cs.cmu.edu/~guyb Biography Guy E. Blelloch received his B.S. and B.A. from Swarthmore College in 1983, and his M.S. and PhD from MIT in 1986, and 1988, respectively. Since then he has been on the faculty at Carnegie Mellon University, where he is now an Associate Professor. During the academic year 1997-1998 he was a visiting professor at U.C. Berkeley. He held the Finmeccanica Faculty Chair from 1991–1995 and received an NSF Young Investigator Award in 1992. He has been program chair for the ACM Symposium on Parallel Algorithms and Architectures, program co-chair for the IEEE International Parallel Processing Symposium, is on the editorial board of JACM, and has served on a dozen or so program committees. His research interests are in parallel programming languages and parallel algorithms, and in the interaction of the two. He has developed the NESL programming language under an ARPA contract and an NSF NYI award. His work on parallel algorithms includes work on sorting, computational geometry, and several pointer-based algorithms, including algorithms for list-ranking, set-operations, and graph connectivity. Five Related and Significant Publications 1. Guy Blelloch, Jonathan Hardwick, Gary L. Miller, and Dafna Talmor. Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica, 24(3/4), pp. 243–269, 1999. 2. Guy Blelloch, Phil Gibbons and Yossi Matias. Efficient Scheduling for Languages with Fine-Grained Parallelism. Journal of the ACM, 46(2), pp. 281–321, 1999. 3. Girija Narlikar and Guy Blelloch. Space-Efficient Implementations of Nested Par- allelism. ACM Transactions on Programming Languages and Systems (TOPLAS), 21(1), 1999. 4. Guy Blelloch and Perry Cheng. On Bounding Time and Space for Multiprocessor Garbage Collection. Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 104–117, May 1999. 5. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Gregory Plaxton, Steven J. Smith, and Marco Zagha. An Experimental Analysis of Parallel Sorting Algorithms. Theory of Computing Systems, 31(2), 1998. 1 AV RIM L. BLUM Associate Professor Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 [email protected], http://www.cs.cmu.edu/~avrim Biography Avrim L. Blum received double B.S. degrees in Mathematics and Physics from MIT in 1987, and his M.S. and Ph.D. in Computer Science from MIT in 1989 and 1991, respectively. In 1991, he received an NSF Mathematical Sciences Postdoctoral Research Fellowship, which he took at Carnegie Mellon University. He joined the faculty at CMU in 1992 and is now an Associate Professor. Blum received an NSF Young Investigator award in 1993, and an Alfred P. Sloan Foundation Research Fellowship in 1994. His main research areas are Approximation Algorithms, Online Algorithms, Computational Learning Theory, and algorithmic approaches to general-purpose planning. Five Related and Significant Publications 1. A. Blum, C. Burch, and A. Kalai. Finely-Competitive Paging. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 450–458, 1999. 2. A. Blum, R. Ravi, and S. Vempala. A Constant-Factor Approximation Algorithm for the k-MST problem. Journal of Computer and System Sciences, 58:101–108, 1999. 3. A. Blum and T. Mitchell. Combining Labeled and Unlabeled Data with Co-Training. Proceedings of the 11th Annual Conference on Computational Learning Theory, pp. 92–100, July 1998. 4. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica, 22(1/2): 35-52, 1998. 5. A. Blum and M. Furst. Fast Planning Through Planning Graph Analysis. Artificial Intelligence, 90:281–300, 1997. 2 LENORE BLUM Distinguished Career Professor Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Professional Preparation • B.S., Mathematics, Simmons College, 1963. • Ph.D., Mathematics, MIT, 1968. • Doctor of Laws, honoris causa, Mills College, 1999. Appointments • Distinguished Career Professor of Computer Science, Carnegie-Mellon University, 1999- . • Deputy Director, Mathematical Sciences Research Institute, Berkeley, 1992-1997. • Mills College, Oakland, California, 1973-1996: Head/co-Head, Department of Math- ematics and CS, 1974-1987; Letts-Villard Research Professor, 1979-1996. • Research Scientist, International Computer Science Institute, Berkeley, 1988-2000. • University of California, Berkeley, 1968-2000: Postdoc, Lecturer, Research Associate, Department of Mathematics. Selected Professional Service • President, Association for Women in Mathematics, 1975-1978. • Founding co-Director, Math/Science Network, 1975-1981. • Vice-president, American Mathematical Society, 1990-1993. Related Publications 1. “A Simple Secure Pseudo-Random Number Generator,” SIAM Journal of Computing, Vol. 15, No. 2, 364-383, May 1986 (with M. Blum and M. Shub). 2. “Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average,” SIAM Journal of Computing, Vol. 15, No. 2, 384-398, May 1986 (with M. Shub). 3. “On a Theory of Computation Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines,” FOCS 88; Bulletin of the American Mathematical Society, Vol. 21, No. 1, 1-46, July 1989 (with M. Shub and S. Smale). 4. “Algebraic Settings for the Problem P=NP?,” The Mathematics of Numerical Anal- ysis, Volume 42, Lectures in Applied Mathematics, AMS, 125-144, 1996 (with F. Cucker, M. Shub and S. Smale). 5. Complexity and Real Computation, Springer-Verlag, 1998 (with F. Cucker, M. Shub and S. Smale). 3 MANUEL BLUM Professor Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Professional Preparation • B.S., Elec. Engr., MIT, 1959. • M.S., Elec. Engr., MIT, 1961. • Ph.D., Mathematics, MIT, 1964. Appointments • Chair Professor of Computer Science, Carnegie-Mellon University, 2000- • Arthur J. Chick Professor of EECS, U.C. Berkeley 1995-2000. • University of California, Berkeley, 1968-2000: Visiting Assistant Professor, Associate Professor, Professor, Department of Electrical Engineering and Computer Sciences. • Assistant Professor, Department of Mathematics, MIT, 1966-68. • Research Assistant and Research Associate for Dr. Warren S. McCulloch, Research Laboratory of Electronics, MIT, 1960-1965. Related Publications 1. “Linear Time Bounds for Median Computations,” (Blum, Floyd, Pratt, Rivest, and Tarjan), in Proc. 4th Annual ACM Symposium on Theory of Computing, Denver, Colorado (May 1972), 119-124. 2. “Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time,” (M. Blum, A.K.Chandra and M.N.Wegman), Information Processing Letters, Vol. 10, No. 2 (March 1980), 80-82. 3. “Noninteractive Zero-Knowledge,” (M. Blum, A. de Santis, S. Micali, and G. Per- siano), SIAM J. Comput. Vol. 20, No. 6, (1991), 1084-1118. 4. “Designing Programs That Check Their Work,” (M. Blum, S. Kannan), Proc of 21st Annual ACM STOC (May 1989), pp 86-97, and in JACM Vol. 42, No. 1 (1995), 269-291. 5. “Software Reliability via Run-Time Result-Checking,” (H. Wasserman, M. Blum), Jour. ACM, Vol 44, No. 6 (Nov 1997) 826-849. 4 EDMUND M. CLARKE FORE Systems Professor Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 http://www.cs.cmu.edu/~emc/ Professional Preparation Edmund M. Clarke received a B.A. degree in mathematics from the University of Virginia, Charlottesville, VA, in 1967, an M.A. degree in mathematics from Duke University, Durham NC, in 1968, and a Ph.D. degree in Computer Science from Cornell University, Ithaca NY, in 1976. After receiving his Ph.D., he taught in the Department of Computer Science, Duke University, for two years. In 1978 he moved to Harvard University, Cambridge, MA where he was an Assistant Professor of Computer Science in the Division of Applied Sciences. He left Harvard in 1982 to join the faculty in the Computer Science Department at Carnegie- Mellon University, Pittsburgh, PA. He was appointed Full Professor in 1989. In 1995 he became the first recipient of the FORE Systems Professorship, an endowed chair in the School of Computer Science. Dr. Clarke has served on the editorial boards of Distributed Computing and Logic and Computation and is currently an editor-in-chief of Formal Methods in Systems Design. He is on the steering committees of two international conferences, Logic in Computer Science and Computer-Aided Verification. He was a cowinner along with Randy Bryant, Allen Emerson, and Kenneth McMillan of the ACM Kanellakis Award in 1999 for the development of Symbolic Model Checking. For this work he also received a Technical Excellence Award from the Semiconductor Research Corporation in 1995 and an Allen Newell Award for Excellence in Research from the Carnegie Mellon Computer Science Department in 1999. Five Publications Related to Proposed Project 1. E.M. Clarke and E.A. Emerson, Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic, Logics of Programs 1981, Lecture Notes in Computer Science 131, Springer-Verlag 1982. 2. E.M. Clarke, E.A. Emerson and A.P. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Pro- gramming Languages and Systems, Vol. 8, No. 2, April 1986, pp. 244-263. 3. Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and L.J. Hwang, Symbolic Model Checking: 1020 States and Beyond, Information and Com- putation (Special Issue for the best papers from LICS 90), Vol. 98, No. 2, June 1992, pp. 142-170. 4. E. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D. Long, K. McMillan, and L. Ness, Verification of the Futurebus+ Cache Coherence Protocol, Formal Methods in System Design, Vol. 6, 1995, pp, 217-232. 5. E. M. Clarke and J. M. Wing, Formal Methods: State of the Art and Future Direc- tions, ACM Computing Surveys, December 1996. Available as CMU-CS-96-178. 5 DANNIE DURAND Associate Professor Department of Biological Sciences Carnegie Mellon University Pittsburgh, PA 15213 Biography Dannie Durand received her B.S.