- Albert Einstein
This German born physicist is considered one of the world's greatest thinkers in history. Not only did he shape the way people think of time, space, matter, energy, and gravity but he also was a supporter of Zionism and peaceful living. Einstein was born on March 14, 1879 in Ulm Germany, and spent most of his youth living in Munich, where his family owned a small electric machinery shop. He attended schooling in Munich, which he found unimaginative and dull. - Donald Knuth
Don's father was a Lutheran school teacher and church organist. Don studied piano, and for a brief time organ, through high school. Later as a faculty member of Caltech, he was called upon to be a long-term substitute organist at Faith Lutheran Church in Pasadena, California. He became a member of the American Guild of Organists in 1965, and saw his first Abbott and Sieker organ at that time. - Bernard Chazelle
Bernard Chazelle (born November 5, 1955) is a professor of computer science at Princeton University. Although he is best known for his invention of the soft heap data structure and the most asymptotically efficient known algorithm for finding minimum spanning trees, most of his work is in computational geometry, where he has found many of the best-known algorithms, such as linear-time triangulation of a simple polygon, as well as many useful complexity results, … - Richard Karp
Richard M. Karp was born in Boston, Massachusetts in 1935 and was educated at the Boston Latin School and Harvard University, where he received his Ph.D. in Applied Mathematics in 1959. From 1959 to 1968he was a member of the Mathematical Sciences Department at the IBM Thomas J. Watson Research Center. From 1968 to 1994 he was a professor at the University of California, Berkeley. - Madhu Sudan
Madhu Sudan is an Indian computer scientist, professor of computer science at the Massachusetts Institute of Technology and a member of MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize at the 24th International Congress of Mathematicians in 2002. The prize recognizes outstanding work in the mathematical aspects of computer science. - G. H. Hardy
Professor Godfrey Harold Hardy FRS (February 7, 1877 - December 1, 1947) was a prominent English mathematician, known for his achievements in number theory and mathematical analysis. He was called "Harold" by a few close friends, and otherwise "G. H.". Non-mathematicians usually know him for "A Mathematician's Apology", his essay from 1940 on the aesthetics of mathematics. - Ron Rivest
Professor Ronald Lorin Rivest (born 1947, Schenectady, New York) is a cryptographer, and is the Andrew and Erna Viterbi Professor of Computer Science at MIT's Department of Electrical Engineering and Computer Science (CSAIL). He is most celebrated for his work on public-key encryption with Len Adleman and Adi Shamir, specifically the RSA algorithm, for which they won the 2002 ACM Turing Award. - Shafi Goldwasser
Shafrira Goldwasser (born 1958) is the RSA Professor of electrical engineering and computer science at MIT, and a professor of mathematical sciences at the Weizmann Institute of Science, Israel. Born in New York City, she obtained her B.S. (1979) in mathematics from Carnegie Mellon University, and M.S. (1981) and Ph.D (1983) in computer science from UC Berkeley. She joined MIT in 1983, and in 1997 became the first holder of the RSA Professorship. - Dana Scott
Dana Stewart Scott (born 1932) is the emeritus "Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic" at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His research career has spanned computer science, mathematics, and philosophy, and has been characterized by a marriage of a concern for elucidating fundamental concepts in the manner of informal rigor, … - John Tukey
John Wilder Tukey (June 16, 1915 - July 26, 2000) was a statistician born in New Bedford, Massachusetts. Tukey obtained a B.A. in 1936 and M.Sc. in 1937, both in Chemistry, from Brown University, before moving to Princeton University where he received his Ph.D. in mathematics. During World War II, Tukey worked at the Fire Control Research Office and collaborated with Samuel Wilks and William Cochran. - Norbert Wiener
Norbert Wiener was an American theoretical and applied mathematician. He was a pioneer in the study of stochastic and noise processes, contributing work relevant to electronic engineering, electronic communication, and control systems. Wiener is perhaps best known as the founder of cybernetics, a field that formalizes the notion of feedback and has implications for engineering, systems control, computer science, biology, philosophy, and the organization of society. - George Dantzig
George Bernard Dantzig (8 November 1914 - 13 May 2005) was an American mathematician who introduced the simplex algorithm and is considered the "father of linear programming". He was the recipient of many honors, including the National Medal of Science in 1975, and the John von Neumann Theory Prize in 1974. He was a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences. - Andrey Kolmogorov
Andrey Nikolaevich Kolmogorov (April 25, 1903 - October 20, 1987) was a Soviet mathematician who made major advances in different academic fields (among them probability theory, topology, intuitionistic logic, turbulence, classical mechanics and computational complexity). Kolmogorov is widely considered one of the prominent mathematicians of the 20<sup>th</sup> century. - Markus Kuhn
Dr. Markus G. Kuhn (born 1971 in Munich) is a German computer scientist, currently teaching and researching at the University of Cambridge Computer Laboratory. He graduated from the University of Erlangen (Germany), Purdue University (Indiana, US), and the University of Cambridge (England), and is a Fellow of Wolfson College, Cambridge. Kuhn's main research interests include computer security, in particular the hardware and signal-processing aspects of it, … - Stephen R. Bourne
Steve Bourne is a computer scientist, most famous as the author of the Bourne shell (<code>sh</code>), which is the foundation for the standard command line interfaces to Unix. Bourne has a Bachelor's degree in mathematics from King's College London. He has a Diploma (Master's) and Ph.D. in mathematics from Trinity College, Cambridge. Subsequently he worked on an ALGOL 68 compiler at the Cambridge University Computer Laboratory (see ALGOL 68C). - Ronald Fisher
Sir Ronald Aylmer Fisher, FRS (17 February 1890 – 29 July 1962) was an English statistician, evolutionary biologist, and geneticist. He was described by Anders Hald as "a genius who almost single-handedly created the foundations for modern statistical science" and Richard Dawkins described him as "the greatest of Darwin's successors". - Steven Brams
Steven J. Brams (born November 28, 1940) is a game theorist and political scientist at the New York University department of politics. Brams is best known for using the techniques of game theory and public choice to research voting systems and fair division. He is one of the independent discoverers of approval voting. Also, he was a co-discoverer, with Alan Taylor of the first envy-free solution to the n-person cake cutting problem.(1) Previous to the Brams-Taylor solution, … - Amir Pnueli
Amir Pnueli (born April 22, 1941) is an Israeli computer scientist who received the Turing Award in 1996 "for seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification". Born in Nahalal, Israel, Pnueli received a Bachelor's degree in Mathematics at the Technion in Haifa, and Ph.D. in applied mathematics from the Weizmann Institute of Science. - C. R. Rao
Calyampudi Radhakrishna Rao (born September 10, 1920) is a famous Indian statistician and currently professor emeritus at Penn State University. He was born in Hadagali, Karnataka state, India. He received an M.S. in mathematics from Andhra University and an M.S. in Statistics from Calcutta University in 1943. - Narendra Karmarkar
Narendra K. Karmarkar (b. 1957) is an Indian mathematician, renowned for developing Karmarkar's algorithm. Dr. Karmarkar received his B.Tech at the IIT Bombay in 1978. Later, he received his M.S. at the California Institute of Technology, and his Ph.D. at the Institute of Computer Science at the University of California, Berkeley. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey. Dr. - Max Tegmark
Max Tegmark (born 1967) is a Swedish-American cosmologist. Tegmark is an Associate Professor at the Massachusetts Institute of Technology where he belongs to the scientific directorate of the "Foundational Questions Institute". As part of the Sloan Digital Sky Survey team, he has worked on data analysis, extracting the parameters of the Lambda-CDM model from observational large-scale structure and cosmic microwave background data. - Jonathan Borwein
Jonathan M. Borwein (born 1951) is a Canadian mathematician noted for his prolific and creative work throughout the international mathematical community. He is a close associate of David H. Bailey, and they have recently been among the most prominent public advocates of Experimental mathematics in North America. Dr. Borwein was Shrum Professor of Science (1993-2003) and a Canada Research Chair in Information Technology (2001-08) at Simon Fraser University, … - Sheldon Lee Glashow
Professor Sheldon Lee Glashow (born December 5, 1932, Brookline, MA) is an American physicist. He is the Metcalf Professor of Mathematics and Physics at Boston University. Around 1960 Glashow put forward an initial theory of electroweak interactions, which Steven Weinberg and Abdus Salam later developed. For this work the three won the 1979 Nobel Prize in Physics. Also, in collaboration with John Iliopoulos and Luciano Maiani, Glashow predicted the charm quark. - David Eppstein
David Eppstein (born 1963) is a computer scientist at the Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine. He is best known for his work in computational geometry, graph algorithms, and recreational mathematics. - Leonid Levin
Leonid Levin (born November 2, 1948, in Dnipropetrovsk USSR) is a computer scientist. He studied under Andrey Kolmogorov. He obtained his first Ph.D. in 1972 at Moscow University. Later, he emigrated to the USA in 1978 and earned another Ph.D at the Massachusetts Institute of Technology in 1979. He is well known for his work in randomness in computing, algorithmic complexity and intractability, foundations of mathematics and computer science, algorithmic probability, … - Adi Shamir
Adi Shamir (born 1952) is an Israeli cryptographer. He was one of the inventors of the RSA algorithm (along with Ron Rivest and Len Adleman), one of the inventors of the Feige-Fiat-Shamir Identification Scheme (along with Uriel Feige and Amos Fiat), and has made numerous contributions to the fields of cryptography and computer science. - David H. Bailey
David H. Bailey is a mathematician and computer scientist. He received his B.S. in mathematics from Brigham Young University in 1972 and his Ph.D. in mathematics from Stanford University in 1976. He worked for 14 years as a computer scientist at NASA Ames Research Center, but since 1998 has been the Chief Technologist of the Computational Research Department at the Lawrence Berkeley National Laboratory. - W. R.
William R. (Red) Alford was an American mathematician who worked in the field of number theory. Born in Canton, Mississippi, he was a United States Air Force veteran. He earned his Bachelor of Science in Mathematics and Physics from the Citadel (1959), his Ph.D in Mathematics from Tulane University (1963), and his J.D. from the University of Georgia School of Law (1976) in Athens, Georgia. After earning his J.D. he practiced law in Athens, … - Sidney Coleman
Sidney Richard Coleman (b. 7 March 1937) is an eminent theoretical physicist who studied under Murray Gell-Mann, receiving his PhD from Caltech in 1962. He is professor emeritus at Harvard University and the author of the classic particle physics text "Aspects of Symmetry", which is a collection of lectures delivered at the International School for Subnuclear Physics in Erice, Sicily. Some of his best known works are Coleman-Mandula theorem and Coleman theorem. - Arjen Lenstra
Arjen K. Lenstra is a Dutch mathematician. He studied mathematics at the University of Amsterdam. He is currently a professor at the EPFL (Lausanne), in the Laboratory for Cryptologic Algorithms, and previously worked for Citibank and Bell Labs. Lenstra is active in cryptography, especially in areas such as integer factorization and the XTR cryptosystem. He has been involved in the successful factoring of several RSA numbers. - Robert Tarjan
Robert Endre Tarjan (born April 30, 1948 in Pomona, California) is a renowned American computer scientist. He is the discoverer of several important graph algorithms, including Tarjan's off-line least common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan received the Turing Award jointly with John Hopcroft in 1986. - Don Coppersmith
Don Coppersmith is a cryptographer and mathematician. He was involved in the design of the Data Encryption Standard block cipher at IBM, particularly the design of the S-boxes, strengthening them against differential cryptanalysis. He has also worked on algorithms for computing discrete logarithms, the cryptanalysis of RSA, methods for rapid matrix multiplication (see Coppersmith-Winograd algorithm) and IBM's MARS cipher. - Freeman Dyson
Freeman John Dyson FRS (born December 15, 1923) is an English-born American theoretical physicist and mathematician, famous for his work in quantum mechanics, solid-state physics, nuclear weapons design and policy, and for his serious theorizing in futurism and science fiction concepts, including the search for extraterrestrial intelligence. He is a lifelong opponent of nationalism, and proponent of nuclear disarmament and international cooperation. - Emil Artin
Emil Artin was an Austrian mathematician. His father, also Emil Artin, was an art-dealer, and his mother was the opera singer Emma Laura-Artin. He grew up in Reichenberg (today Liberec) in Bohemia, where German was the primary language. He left school in 1916, and one year later went to the University of Vienna. Artin spent his career in Germany (mainly in Hamburg) until the Nazi threat when he emigrated to the USA in 1937. He was at Indiana University from 1938 to 1946, … - Gian-Carlo Rota
Gian-Carlo Rota (April 27, 1932 - April 18, 1999, known as Juan Carlos Rota to Spanish-speakers) was an Italian-born American mathematician and philosopher. He was born in Vigevano, Italy, where he lived until he was 13 years old. At that time his family fled Italy because his father, Giovanni Rota, was likely to be an object of fascist persecution. He attended the Colegio Americano de Quito in Ecuador, … - Marshall Hall
Marshall Hall, Jr. (17 September 1910, St Louis, Missouri - 4 July 1990, London) was an American mathematician who made contributions to group theory and combinatorics. He studied mathematics at Yale, graduating in 1932. He studied further at Cambridge University, returning to Yale to take his Ph.D. in 1936 under the supervision of Oystein Ore. He worked in Naval Intelligence during World War II, and in 1946 took a position at Ohio State University. - Tom Duff
Thomas Douglas Selkirk Duff (b. December 8, 1952, named for his putative ancestor, the fifth Earl of Selkirk) is a computer programmer. He was born in Toronto, Ontario, Canada and grew up in Toronto and Leaside. In 1974 he graduated from the University of Waterloo with a B.Math and, two years later, got a M.Sc. from the University of Toronto. - Jacques Stern
Jacques Stern is a cryptographer, currently a professor at the École Normale Supérieure, where he is Director of the Computer Science Laboratory. He received the 2006 CNRS Gold Medal. His notable work includes the cryptanalysis of numerous encryption and signature schemes, the design of the Pointcheval-Stern signature algorithm, the Naccache-Stern cryptosystem and Naccache-Stern knapsack cryptosystem, and the block ciphers CS-Cipher, DFC, and xmx. - Vint Cerf
Vinton Gray Cerf (born June 23, 1943) (last name pronounced just like the English word "surf") is an American computer scientist who is commonly referred to as one of the "founding fathers of the Internet" for his key technical and managerial role, together with Bob Kahn, in the creation of the Internet and the TCP/IP protocols which it uses. He was also a co-founder (in 1992) of the Internet Society (ISOC), … - Eugenio Calabi
Eugenio Calabi (born 1923) is an Italian-American mathematician and professor emeritus at the University of Pennsylvania, specializing in differential geometry, partial differential equations and their applications. Professor Calabi was a Putnam Fellow as an undergraduate at MIT in 1946. In 1950 he received his Ph.D. from Princeton University, where his advisor was Salomon Bochner. He later obtained a professorship at the University of Minnesota.
|
| |