|
IMU Abacus Medal
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. The prize was established in 1981 by the Executive Committee of the International Mathematical Union and named for the Finnish mathematician Rolf Nevanlinna. It consists of a gold medal and cash prize. The prize is targeted at young theoretical computer scientists, and only those younger than 40 on January 1, in the year the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Congress Of Mathematicians
The International Congress of Mathematicians (ICM) is the largest conference for the topic of mathematics. It meets once every four years, hosted by the International Mathematical Union (IMU). The Fields Medals, the IMU Abacus Medal (known before 2022 as the Nevanlinna Prize), the Carl Friedrich Gauss Prize, Gauss Prize, and the Chern Medal are awarded during the congress's opening ceremony. Each congress is memorialized by a printed set of Proceedings recording academic papers based on invited talks intended to be relevant to current topics of general interest. Being List of International Congresses of Mathematicians Plenary and Invited Speakers, invited to talk at the ICM has been called "the equivalent ... of an induction to a hall of fame". History German mathematicians Felix Klein and Georg Cantor are credited with putting forward the idea of an international congress of mathematicians in the 1890s.A. John Coleman"Mathematics without borders": a book review. ''CMS Notes'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Helsinki
The University of Helsinki (, ; UH) is a public university in Helsinki, Finland. The university was founded in Turku in 1640 as the Royal Academy of Åbo under the Swedish Empire, and moved to Helsinki in 1828 under the sponsorship of Alexander I of Russia, Tsar Alexander I. The University of Helsinki is the oldest and largest university in Finland with a range of disciplines available. In 2022, around 31,000 students were enrolled in the degree programs of the university spread across 11 faculties and 11 research institutes. As of 1 August 2005, the university complies with the harmonized structure of the Europe-wide Bologna Process and offers bachelor, master, licenciate, and Doctorate, doctoral degrees. Admission to degree programmes is usually determined by entrance examinations, in the case of bachelor's degrees, and by prior degree results, in the case of master and postgraduate degrees. The university is bilingual, with teaching by law provided both in Finnish and Swedi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subhash Khot
Subhash Khot (born 10 June 1978 in Ichalkaranji) is an Indian-American mathematician and theoretical computer scientist who is the Julius Silver Professor of Computer Science in the Courant Institute of Mathematical Sciences at New York University. Khot has contributed to the field of computational complexity, and is best known for his unique games conjecture. Khot received the 2014 Rolf Nevanlinna Prize by the International Mathematical Union and received the MacArthur Fellowship in 2016. He was elected a Fellow of the Royal Society in 2017 and was inducted into the National Academy of Sciences in 2023. Education Khot obtained his bachelor's degree in computer science from the Indian Institute of Technology Bombay in 1999. He received his doctorate degree in computer science from Princeton University in 2003 under the supervision of Sanjeev Arora. His doctoral dissertation was titled "New Techniques for Probabilistically Checkable Proofs and Inapproximability Results." ... [...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 t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jon Kleinberg
Jon Michael Kleinberg (born 1971) is an American computer scientist and the Tisch University Professor of Computer Science and Information Science at Cornell University known for his work in algorithms and networks. He is a recipient of the Nevanlinna Prize by the International Mathematical Union. Early life and education Jon Kleinberg was born in 1971 in Boston, Massachusetts to a mathematics professor father and a computer consultant mother. He received a Bachelor of Science degree in computer science from Cornell University in 1993 and a PhD from Massachusetts Institute of Technology in 1996. He is the older brother of fellow Cornell computer scientist Robert Kleinberg. Career Since 1996 Kleinberg has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fell ... [...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. The dissertation he wrote at the University of California, Berkeley is titled ''Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems''. He was a research staff member at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York from 1992 to 1997 and became a researcher at the Massachusetts Institute of Technology (MIT) after that. From 2009 to 2015 he was a permanent researcher at Microsoft Research New England before joining the Harvard University faculty in 2015. Research contribution and awards In 1998, he received the Sloan Research ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shor's Algorithm
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future. Another concern is that noise in quantum circuits may undermine results, requiring additional qubits for quantum error correction. Shor proposed multiple similar algorithms for solving the factoring problem, the discrete logarithm problem, and the period-finding problem. "Shor's algorithm" usually refers to the factoring algorithm, but may refer to any of the three algorithms. The discrete logarithm algorithm and the factoring algorithm are instances of the period-finding algorithm, and all three are instances of the h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Peter Shor
Peter Williston Shor (born August 14, 1959) is an American theoretical computer scientist 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. He has been a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) since 2003. Early life and education Shor was born on August 14, 1959, in New York City, to Joan Bopp Shor and S. W. Williston Shor.Joan Shor Obituary He grew up in Washington, D.C. and |
Avi Wigderson
Avi Wigderson (; born 9 September 1956) is an Israeli computer scientist and mathematician. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, and distributed computing. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science. He also received the 2023 Turing Award for his contributions to the understanding of randomness in the theory of computation. Early life and studies Avi Wigderson was born in Haifa, Israel, to Holocaust survivors. Wigderson is a graduate of the Hebrew Reali School in Haifa. He began his undergraduate studies at the Technion in 1977 in Haifa, graduating in 1980. Heidelberg Laureate Foundation Portraits, interview with Avi Wigderson, 2017. In the Technion he met his wife Edna. He went on to graduate study at Princeton Univ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexander Razborov
Aleksandr Aleksandrovich Razborov (; born February 16, 1963), 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. Research In his best known work, joint with Steven Rudich, he introduced the notion of '' natural proofs'', a class of strategies used to prove fundamental lower bounds in computational complexity. In particular, Razborov and Rudich showed that, under the assumption that certain kinds of one-way functions exist, such proofs cannot give a resolution of the P = NP problem, so new techniques will be required in order to solve this question. Awards * Nevanlinna Prize (1990) for introducing the "approximation method" in proving Boolean circuit lower bounds of some essential algorithmic problems, * Erdős Lecturer, Hebrew University of Jerusalem, 1998. * Corresponding member of the Russian Academy of Sciences (2000) * Gödel Prize (2007, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leslie Valiant
Leslie Gabriel Valiant (born 28 March 1949) 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 Association for Computing Machinery, 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". Education Valiant was educated at King's College, Cambridge, Imperial College London, and the University of Warwick where he received a PhD in computer science in 1974. Research and career Valiant is world-renowned for his work in Theoretical Computer Science. Among his many contributions to computational complexity theory, Complexity Theo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robert Tarjan
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University. Personal life and education He was born in Pomona, California. His father, George Tarjan (1912–1991), raised in Hungary, was a child psychiatrist, specializing in mental retardation, and ran a state hospital. Robert Tarjan's younger brother James became a chess grandmaster. As a child, Robert Tarjan read a lot of science fiction, and wanted to be an astronomer. He became interested in mathematics after reading Martin Gardner's mathematical games column in Scientific American. He became seriously interested in math in the eighth grade, thanks to a "very stimulating" teacher. While he was in hig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
