Daniel Kane | |
---|---|
Born | 1986 |
Alma mater | Harvard University MIT |
Awards | Sloan Research Fellowship (2017) Morgan Prize (2007) Putnam Fellow (2003–06) |
Scientific career | |
Fields | Mathematics Computer science |
Institutions | University of California, San Diego |
Doctoral advisor | Barry Mazur |
Other academic advisors | Ken Ono Erik Demaine Joseph Gallian Benedict Gross |
Daniel Mertz Kane (born 1986) is an American mathematician. He is a full professor with a joint position in the Mathematics Department and the Computer Science and Engineering Department at the University of California, San Diego. [1]
Kane was born in Madison, Wisconsin, to Janet E. Mertz and Jonathan M. Kane, professors of oncology and of mathematics and computer science, respectively. [2] [3]
He attended Wingra School, a small alternative K-8 school in Madison that focuses on self-guided education. By 3rd grade, he had mastered K through 9th-grade mathematics. [2] Starting at age 13, he took honors math courses at the University of Wisconsin–Madison and did research under the mentorship of Ken Ono while dual enrolled at Madison West High School. [4] He earned gold medals in the 2002 and 2003 International Mathematical Olympiads. [3] [5] Prior to his 17th birthday, he resolved an open conjecture proposed years earlier by Andrews and Lewis; for this research, he was named Fellow Laureate of the Davidson Institute for Talent Development. [6]
He graduated Phi Beta Kappa from the Massachusetts Institute of Technology in 2007 with two bachelor's degrees, one in mathematics with computer science and the other in physics. [1] While at MIT, Kane was one of four people since 2003 (and one of eight in the history of the competition) to be named a four-time Putnam Fellow in the William Lowell Putnam Mathematical Competition. [7] He also won the 2007 Morgan Prize [2] and competed as part of the MIT team in the Mathematical Contest in Modeling four times, earning the highest score three times and winning the Ben Fusaro Award in 2004, INFORMS Award in 2006, and SIAM Award in 2007. [8] He also won the Machtey Award as an undergraduate in 2005, with Tim Abbott and Paul Valiant, for the best student-authored paper at the Symposium on Foundations of Computer Science that year, on the complexity of two-player win-loss games. [9]
Kane received his doctorate in mathematics from Harvard University in 2011; his dissertation, on number theory, was supervised by Barry Mazur. [10] In his curriculum vitae, Kane lists as mentors Ken Ono while in high school; Erik Demaine, Joseph Gallian, and Cesar Silva while an undergraduate student at MIT; and Barry Mazur, Benedict Gross, and Henry Cohn while a graduate student at Harvard. [11]
In 2010, joint work with Jelani Nelson and David Woodruff won both the IBM Pat Goldberg Memorial [12] and Symposium on Principles of Database Systems (PODS) best paper awards [13] for work on an optimal algorithm for the count-distinct problem.
Robert Endre Tarjan 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.
Adi Shamir is an Israeli cryptographer and inventor. He is a co-inventor of the Rivest–Shamir–Adleman (RSA) algorithm, a co-inventor of the Feige–Fiat–Shamir identification scheme, one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.
Peter Williston Shor 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.
John Warner Backus was an American computer scientist. He led the team that invented and implemented FORTRAN, the first widely used high-level programming language, and was the inventor of the Backus–Naur form (BNF), a widely used notation to define syntaxes of formal languages. He later did research into the function-level programming paradigm, presenting his findings in his influential 1977 Turing Award lecture "Can Programming Be Liberated from the von Neumann Style?"
Michael Oser Rabin is an Israeli mathematician, computer scientist, and recipient of the Turing Award.
The William Lowell Putnam Mathematical Competition, often abbreviated to Putnam Competition, is an annual mathematics competition for undergraduate college students enrolled at institutions of higher learning in the United States and Canada. It awards a scholarship and cash prizes ranging from $250 to $2,500 for the top students and $5,000 to $25,000 for the top schools, plus one of the top five individual scorers is awarded a scholarship of up to $12,000 plus tuition at Harvard University, the top 100 individual scorers have their names mentioned in the American Mathematical Monthly, and the names and addresses of the top 500 contestants are mailed to all participating institutions. It is widely considered to be the most prestigious university-level mathematics competition in the world, and its difficulty is such that the median score is often zero or one despite being primarily attempted by students specializing in mathematics.
Noam David Elkies is a professor of mathematics at Harvard University. At age 26, he became the youngest professor to receive tenure at Harvard. He is also a pianist, chess national master, and chess composer.
Reid William Barton is a mathematician and also one of the most successful performers in the International Science Olympiads.
Gabriel Drew Carroll is a Professor of Economics at the University of Toronto. He was born to tech industry worker parents in Oakland. He graduated from Harvard University with B.A. in mathematics and linguistics in 2005 and received his doctorate in economics from MIT in 2012. He was recognized as a child prodigy and received numerous awards in mathematics while a student.
Arthur Leonard Rubin is an American mathematician and aerospace engineer. He was named a Putnam Fellow on four consecutive occasions from 1970 to 1973.
Bjorn Mikhail Poonen is a mathematician, four-time Putnam Competition winner, and a Distinguished Professor in Science in the Department of Mathematics at the Massachusetts Institute of Technology. His research is primarily in arithmetic geometry, but he has occasionally published in other subjects such as probability and computer science. He has edited two books.
Shang-Hua Teng is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California.
Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.
Lenhard Ng is an American mathematician, working primarily on symplectic geometry. Ng is a professor of mathematics at Duke University.
Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.
Alexei Mikhailovich Borodin is a professor of mathematics at the Massachusetts Institute of Technology.
Bonnie Anne Berger is an American mathematician and computer scientist, who works as the Simons professor of mathematics and professor of electrical engineering and computer science at the Massachusetts Institute of Technology. She is the head of the Computation and Biology group at MIT's Computer Science and Artificial Intelligence Laboratory. Her research interests are in algorithms, bioinformatics and computational molecular biology.
Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.
Jelani Osei Nelson is an American Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.
The Department of Defense National Defense Science and Engineering Graduate Fellowship is a prestigious fellowship awarded annually to U.S. citizens pursuing doctoral degrees in science and engineering disciplines. The highly competitive fellowship is sponsored by the U.S. Navy, U.S. Space Force, U.S. Air Force, and U.S. Army. These agencies make the final selection of the fellows. National Defense Fellows must be enrolled in research-based doctoral degrees aligned with the goals of the U.S. Department of Defense as outlined in a specific solicitation for research proposals, known as a Broad Agency Announcement (BAA). Qualifying doctoral programs must be based in the United States. The NDSEG Fellowship lasts for three years, paying for full tuition and all mandatory fees in that period. The fellowship also awards the recipient a monthly stipend, totaling $40,800 annually, a $5,000 travel budget for the 3-year tenure, and a $1,400 annual health insurance budget. National Defense Fellows have no military service obligation upon completion of the program. In the 2020-2021 award cycle, 159 fellows were chosen from a pool of over 7,942 applicants, for a selection rate of roughly 2%.