Related Research Articles
Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
Johan Torkel Håstad is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986, among other prizes. He has been a professor in theoretical computer science at KTH Royal Institute of Technology in Stockholm, Sweden since 1988, becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.
Charles Eric Leiserson is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.
Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.
Mihalis Yannakakis is professor of computer science at Columbia University. He is noted for his work in computational complexity, databases, and other related fields. He won the Donald E. Knuth Prize in 2005.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.
Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.
Eugene Leighton (Gene) Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley.
Samir Khuller is a professor of Computer Science and the Peter and Adrienne Barris Chair of Computer Science at Northwestern University. He was previously Professor and Elizabeth Stevinson Iribe Chair of Computer Science in the University of Maryland's Department of Computer Science. His research is in the area of algorithm design, specifically on combinatorial optimization, graphs and networks and scheduling.
Naveen Garg is a Professor of Computer Science in Indian Institute of Technology Delhi, specializing in algorithms and complexity in theoretical computer science. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology, India's highest prize for excellence in science, mathematics and technology, in the mathematical sciences category in the year 2016. Naveen Garg's contributions are primarily in the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility location etc.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Edith Cohen is an Israeli and American computer scientist specializing in data mining and algorithms for big data. She is also known for her research on peer-to-peer networks. She works for Google in Mountain View, California, and as a visiting professor at Tel Aviv University in Israel.
Grigory Yaroslavtsev is a Russian-American computer scientist. He is an assistant professor of computer science at George Mason University. Previously he was an assistant professor of computer science at Indiana University and the founding director of the Center for Algorithms and Machine Learning (CAML) at Indiana University.
Baruch M. Schieber is a Professor of the Department of Computer Science at the New Jersey Institute of Technology (NJIT) and Director of the Institute for Future Technologies.
Harold N. Gabow is an American computer scientist known for his research on graph algorithms and data structures. He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.
Elad Hazan is an Israeli-American computer scientist, academic, author and researcher. He is a Professor of Computer Science at Princeton University, and the co-founder and director of Google AI Princeton.
Alex Pothen is an Indian-born American computer scientist and applied mathematician who is a professor at Purdue University. His research primarily focuses on combinatorial scientific computing (CSC), graph algorithms, parallel computing, and bioinformatics algorithms.
References
- ↑ "A Structural View of Approximation" (PDF).
- ↑ "Sanjeev Khanna". www.cis.upenn.edu.
- ↑ "2018 ACM Fellows Honored for Pivotal Achievements that Underpin the Digital Age". Association for Computing Machinery. Retrieved 5 December 2018.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This biographical article relating to a computer specialist in the United States is a stub. You can help Wikipedia by expanding it. |