Search results
Results From The WOW.Com Content Network
Bernard Chazelle (born November 5, 1955) is a French computer scientist.He is the Eugene Higgins Professor of Computer Science at Princeton University.Much of his work is in computational geometry, where he is known for his study of algorithms, such as linear-time triangulation [2] of a simple polygon, as well as major complexity results, such as lower bound techniques based on discrepancy ...
Robert Sedgewick (born December 20, 1946) is an American computer scientist.He is the founding chair and the William O. Baker Professor in Computer Science at Princeton University [1] and was a member of the board of directors of Adobe Systems (1990–2016). [2]
Richard Edwin Stearns (born July 5, 1936) is an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory". [1]
As of 2010 Aho's research interests include programming languages, compilers, algorithms, and quantum computing. He is part of the Language and Compilers research-group at Columbia University. [22] Overall, his works have been cited 81,040 times and he has an h-index of 66, as of May 8, 2019. [23]
Tarjan has been teaching at Princeton University since 1985. [7] He has also held academic positions at Cornell University (1972–73), University of California, Berkeley (1973–1975), Stanford University (1974–1980), and New York University (1981–1985). He has also been a fellow of the NEC Research Institute (1989–1997). [10]
9 Algorithms that Changed the Future is a 2012 book by John MacCormick on algorithms. The book seeks to explain commonly encountered computer algorithms to a layman audience. The book seeks to explain commonly encountered computer algorithms to a layman audience.
The AdaGrad algorithm changed optimization for deep learning and serves as the basis for today's fastest algorithms. In his study, he also made substantial contributions to the theory of online convex optimization, including the Online Newton Step and Online Frank Wolfe algorithm, projection free methods, and adaptive-regret algorithms.
In a display of authorial equity, the former is usually called the Kernighan–Lin algorithm, while the latter is known as the Lin–Kernighan heuristic. Kernighan has been a professor of computer science at Princeton University since 2000 and is the director of undergraduate studies in the department of computer science.