Related Research Articles
The IMU Abacus Medal, known before 2022 as the Rolf Nevanlinna Prize, is awarded once every four years at the International Congress of Mathematicians, hosted by the International Mathematical Union (IMU), for outstanding contributions in Mathematical Aspects of Information Sciences including:
- All mathematical aspects of computer science, including computational complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.
- Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra.
Rolf Herman Nevanlinna was a Finnish mathematician who made significant contributions to complex analysis.
Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
Madhu Sudan 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.
Peter David Lax is a Hungarian-born American mathematician and Abel Prize laureate working in the areas of pure and applied mathematics.
Martin David Davis was an American mathematician and computer scientist who contributed to the fields of computability theory and mathematical logic. His work on Hilbert's tenth problem led to the MRDP theorem. He also advanced the Post–Turing model and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which is foundational for Boolean satisfiability solvers.
The Courant Institute of Mathematical Sciences is the mathematics research school of New York University (NYU). Founded in 1935, it is named after Richard Courant, one of the founders of the Courant Institute and also a mathematics professor at New York University from 1936 to 1972, and serves as a center for research and advanced training in computer science and mathematics. It is located on Gould Plaza next to the Stern School of Business and the economics department of the College of Arts and Science.
In computational complexity theory, the unique games conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the problem of determining the approximate value of a certain type of game, known as a unique game, has NP-hard computational complexity. It has broad applications in the theory of hardness of approximation. If the unique games conjecture is true and P ≠ NP, then for many important problems it is not only impossible to get an exact solution in polynomial time, but also impossible to get a good polynomial-time approximation. The problems for which such an inapproximability result would hold include constraint satisfaction problems, which crop up in a wide variety of disciplines.
Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".
Aleksandr Aleksandrovich Razborov, sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist. He is Andrew McLeish Distinguished Service Professor at the University of Chicago.
Charles Samuel Peskin is an American mathematician known for his work in the mathematical modeling of blood flow in the heart. Such calculations are useful in the design of artificial heart valves. From this work has emerged an original computational method for fluid-structure interaction that is now called the “immersed boundary method", which allows the coupling between deformable immersed structures and fluid flows to be handled in a computationally tractable way. With his students and colleagues, Peskin also has worked on mathematical models of such systems as the inner ear, arterial pulse, blood clotting, congenital heart disease, light adaptation in the retina, control of ovulation number, control of plasmid replication, molecular dynamics, and molecular motors.
Daniel Alan Spielman 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.
Paul Roesel Garabedian was a mathematician and numerical analyst. Garabedian was the Director-Division of Computational Fluid Dynamics at the Courant Institute of Mathematical Sciences, New York University. He is known for his contributions to the fields of computational fluid dynamics and plasma physics, which ranged from elegant existence proofs for potential theory and conformal mappings to the design and optimization of stellarators. Garabedian was elected a member of the National Academy of Sciences in 1975.
Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay. He specializes in theoretical computer science, especially computational complexity theory, and in recent years has been working on "geometric complexity theory", an approach to the P versus NP problem through the techniques of algebraic geometry, with Milind Sohoni of IIT Bombay. He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion", in a paper that introduced the isolation lemma.
Leslie Frederick 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.
Bhubaneswar Mishra is an Indian American computer scientist and professor at the Courant Institute of Mathematical Sciences of New York University. He is known for his applied contributions to bioinformatics, cybersecurity, and computational finance. Mishra is listed as an ISI highly cited researcher in Computer Science.
Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.
Ryan O'Donnell is a Canadian theoretical computer scientist and a professor at Carnegie Mellon University. He is known for his work on the analysis of Boolean functions and for authoring the textbook on this subject. He is also known for his work on computational learning theory, hardness of approximation, property testing, quantum computation and quantum information.
References
- ↑ "Subhash Khot - Heidelberg Laureate Forum". - Heidelberg Laureate Forum. Retrieved 3 July 2024.
- ↑ Khot, Subhash (2002), "On the power of unique 2-prover 1-round games", Proceedings of the 17th Annual IEEE Conference on Computational Complexity, p. 25, CiteSeerX 10.1.1.133.5651 , doi:10.1109/CCC.2002.1004334, ISBN 978-0-7695-1468-0, S2CID 32966635 .
- ↑ "Subhash Khot - MacArthur Foundation".
- ↑ "Subhash Khot". Royal Society. Archived from the original on 23 May 2017. Retrieved 27 May 2017.
- ↑ "News | NYU Courant". cims.nyu.edu. Retrieved 27 August 2023.
- ↑ "Prof. Subhash Khot, B.Tech., 1999, Computer Science and Engineering". Alumni. IIT Bombay. Retrieved 4 April 2024.
- ↑ "ACM Doctoral Dissertation Award 2003". Archived from the original on 3 November 2014. Retrieved 13 September 2014.
- ↑ Subhash Khot's results at International Mathematical Olympiad
- ↑ Shirali, S.A. (2006), "The Sierpinski problem", Resonance, 11 (2): 78–87, doi:10.1007/BF02837277, S2CID 121269449
- ↑ Microsoft Faculty Fellowship Recipients 2005
- ↑ "MacArthur Fellows Program". Archived from the original on 2 April 2012.
- ↑ "Subhash Khot". Royal Society. Archived from the original on 23 May 2017. Retrieved 27 May 2017.
- ↑ "News | NYU Courant". cims.nyu.edu. Retrieved 27 August 2023.
