|
ACM Doctoral Dissertation Award
The ACM Doctoral Dissertation Award is awarded annually by the Association for Computing Machinery to the authors of the best doctoral dissertations in computer science and computer engineering. The award is accompanied by a prize of US $20,000 and winning dissertations are published in the ACM Digital Library. Honorable mentions are awarded $10,000. Financial support is provided by Google. The number of awarded dissertations may vary year-to-year. ACM also awards the ACM India Doctoral Dissertation Award. Several Special Interest Groups (SIGs) award a Doctoral Dissertation Award. Recipients See also * List of computer science awards * List of engineering awards This list of engineering awards is an index to articles about notable awards for achievements in engineering. It includes aerospace engineering, chemical engineering, civil engineering, electrical engineering, electronic engineering, structural ... References External linksACM Doctoral Dissertation Award Winn ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thesis
A thesis ( : theses), or dissertation (abbreviated diss.), is a document submitted in support of candidature for an academic degree or professional qualification presenting the author's research and findings.International Standard ISO 7144: Documentation�Presentation of theses and similar documents International Organization for Standardization, Geneva, 1986. In some contexts, the word "thesis" or a cognate is used for part of a bachelor's or master's course, while "dissertation" is normally applied to a doctorate. This is the typical arrangement in American English. In other contexts, such as within most institutions of the United Kingdom and Republic of Ireland, the reverse is true. The term graduate thesis is sometimes used to refer to both master's theses and doctoral dissertations. The required complexity or quality of research of a thesis or dissertation can vary by country, university, or program, and the required minimum study period may thus vary significantly in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leslie Greengard
Dr. Leslie F. Greengard is an American mathematician, physicist and computer scientist. He is co-inventor with Vladimir Rokhlin Jr. of the fast multipole method (FMM) in 1987, recognized as one of the top-ten algorithms of the 20th century. Greengard was elected as a member of the National Academy of Engineering in 2006 for work on the development of algorithms and software for fast multipole methods. Short biography Leslie Greengard was born in London, England, but grew up in the United States in New York City, Boston, and New Haven. He holds a B.A. in mathematics from Wesleyan University (1979), an M.D. from the Yale School of Medicine (1987), and a Ph.D. in computer science from Yale University (1987). From 2006-2011, Greengard was director of the Courant Institute of Mathematical Sciences, an independent division of the New York University (NYU) and is currently a professor of mathematics and computer science at Courant. He is also a professor at New York Uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hari Balakrishnan
Hari Balakrishnan is the Fujitsu Professor of Computer Science and Artificial Intelligence in the Department of Electrical Engineering and Computer Science at MIT, and the Co-founder and CTO at Cambridge Mobile Telematics. Early life and career Balakrishnan was born in Nagpur, India, and was raised in Bombay (Mumbai) and Chennai. He received his bachelor's degree in computer science from the Indian Institute of Technology, Madras in 1993 and his doctoral degree in computer science from the University of California, Berkeley in 1998. He has been at MIT since 1998. His father, V. Balakrishnan, is a renowned physics educator and researcher in theoretical physics, his mother, Radha Balakrishnan, is also a well-known theoretical physicist, and his sister, Hamsa Balakrishnan, is a Professor and Associate Department Head of MIT's Department of Aeronautics and Astronautics. Balakrishnan is well known for his highly-cited and influential contributions to computer networks, networ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sanjeev Arora
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist. Life He was a visiting scholar at the Institute for Advanced Study in 2002–03. In 2008 he was inducted as a Fellow of the Association for Computing Machinery. In 2011 he was awarded thACM Infosys Foundation Award given to mid-career researchers in Computer Science. Arora has been awarded the Fulkerson Prize for 2012 for his work on improving the approximation ratio for graph separators and related problems (jointly with Satish Rao and Umesh Vazirani). In 2012 he became a Simons Investigator. Arora was elected to the National Academy of Sciences on May 2, 2018. He is a coauthor (with Boaz Barak Boaz Barak (בועז ברק, born 1974) is an Israeli-American professor of computer science at Harvard University. Early life and education He graduated in 1999 with a B.Sc. in mathematics and computer science from Tel Aviv University. In 2004, ...) of the book ''Computational Complexity: A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Daniel Spielman
Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania) has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science. Education Daniel Spielman attended The Philadelphia School, and Germantown Friends School. He received his bachelor of arts degree in mathematics and computer science from Yale University in 1992 and a PhD in applied mathematics from MIT in 1995 (his dissertation was called "Computationally Efficient Error-Correcting Codes and Holographic Proofs"). He taught in the Mathematics Department at MIT from 1996 to 2005. Awards Spielman and his collaborator Shang-Hua Teng have jointly won the Gödel Prize twice: in 2008 for their work on smoothed analysis of algorithms and in 2015 for th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Karger
David Ron Karger (born May 1, 1967) is a professor of computer science and a member of the Computer Science and Artificial Intelligence Laboratory ( CSAIL) at the Massachusetts Institute of Technology. Education Karger received a Bachelor of Arts degree from Harvard University and a PhD in computer science from Stanford University. Research Karger's work in algorithms has focused on applications of randomization to optimization problems and led to significant progress on several core problems. He is responsible for Karger's algorithm, a Monte Carlo method to compute the minimum cut of a connected graph. Karger developed the fastest minimum spanning tree algorithm to date, with Philip Klein and Robert Tarjan. They found a linear time randomized algorithm based on a combination of Borůvka's algorithm and the reverse-delete algorithm. With Ion Stoica, Robert Morris, Frans Kaashoek, and Hari Balakrishnan, he also developed Chord, one of the four original distributed has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Madhu Sudan
Madhu Sudan (born 12 September 1966) is an Indian-American computer scientist. He has been a Gordon McKay Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences since 2015. Career He received his bachelor's degree in computer science from IIT Delhi in 1987 and his doctoral degree in computer science at the University of California, Berkeley in 1992. He was a research staff member at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York from 1992 to 1997 and moved to MIT after that. From 2009 to 2015 he was a permanent researcher at Microsoft Research New England before joining Harvard University in 2015. Research contribution and awards He was awarded the Rolf Nevanlinna Prize at the 24th International Congress of Mathematicians (ICM) in 2002. The prize recognizes outstanding work in the mathematical aspects of computer science. Sudan was honored for his work in advancing the theory of probabilisticall ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mendel Rosenblum
Mendel Rosenblum (born 1962) is a professor of Computer Science at Stanford University and co-founder of VMware. Early life Mendel Rosenblum was born in 1962. He attended the University of Virginia, where he received a degree in mathematics. While at UVA, he was a member of Phi Sigma Kappa. He graduated with a Ph.D. in computer science from the University of California, Berkeley, where he met his future wife and co-founder of VMware, Diane Greene. Career Rosenblum is a professor of computer science at Stanford University. His research group developed SimOS. Rosenblum is a co-founder of VMware. He served as its chief scientist until his resignation on September 10, 2008, shortly after his wife Diane Greene stepped down as the company's CEO. Since 2008, Rosenblum is a Fellow of the Association for Computing Machinery The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's large ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Garth Gibson
__NOTOC__ Garth Alan Gibson is a computer scientist from Carnegie Mellon University. Gibson's developed the RAID taxonomy of redundant data storage systems, along with David A. Patterson and Randy Katz. Born in Aurora, Ontario, he holds a Ph.D. and an MSc in computer science from the University of California, Berkeley, and a B.Math in computer science from the University of Waterloo. He was involved in informed prefetch computing and network-attached secure disks, a precursor to the SCSI object storage device command set. Gibson was the initial director of the Parallel Data Laboratory at Carnegie Mellon University, and founder and chief technology officer for Panasas, a computer data storage hardware and software company. Gibson was the first president and chief executive officer of the Vector Institute. In 2005 he became the 11th awardee of the J.W. Graham Medal, named in honor of Wes Graham an early influential professor of computer science at the University of Waterloo, an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Carsten Lund
Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States. Lund was born in Aarhus, Denmark, and received the "kandidat" degree in 1988 from the University of Aarhus and his Ph.D. from the University of Chicago in computer science. His thesis, entitled The Power of Interaction, was chosen as an ACM 'Distinguished Dissertation'. Lund was a co-author on two of five competing papers at the 1990 Symposium on Foundations of Computer Science characterizing complexity classes such as PSPACE and NEXPTIME in terms of interactive proof systems; this work became part of his 1991 Ph.D. thesis from the University of Chicago under the supervision of Lance Fortnow and László Babai, for which he was a runner-up for the 1991 ACM Doctoral Dissertation Award. He is also known for his joint work with Sanjeev Arora, Madhu Sudan, Rajeev Motwani, and Mario Szegedy that discovered the existence of pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robert Schapire
Robert Elias Schapire is an American computer scientist, former David M. Siegel '83 Professor in the computer science department at Princeton University, and has recently moved to Microsoft Research. His primary specialty is theoretical and applied machine learning. His work led to the development of the boosting ensemble algorithm used in machine learning. His PhD dissertation, ''The design and analysis of efficient learning algorithms'', won him the ACM Doctoral Dissertation Award in 1991. Together with Yoav Freund, he invented the AdaBoost algorithm in 1996. They both received the Gödel prize in 2003 for this work. In 2014, Schapire was elected a member of the National Academy of Engineering for his contributions to machine learning through the invention and development of boosting algorithms. In 2016, he was elected to the National Academy of Sciences.. Personal life His son, Zachary Schapire, recently graduated from his alma mater, Brown University. His daughter, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noam Nisan
Noam Nisan ( he, נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory. Biography Nisan did his undergraduate studies at the Hebrew University, graduating in 1984. He went to the University of California, Berkeley for graduate school, and received a Ph.D. in 1988 under the supervision of Richard Karp. After postdoctoral studies at the Massachusetts Institute of Technology he joined the Hebrew University faculty in 1990.Curriculum vitae retrieved 2012-03-01. Selected publications Nisan is the author of[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
