Ronitt Rubinfeld | |
---|---|
Born | 1964 |
Alma mater | Ph.D., University of California, Berkeley, 1990 University of Michigan, B.S.E. |
Awards | ACM Fellow (2014) |
Scientific career | |
Fields | Computer science |
Institutions | |
Doctoral advisor | Manuel Blum |
Doctoral students | Funda Ergun |
Ronitt Rubinfeld (born 1964) is a professor of electrical engineering and computer science at the Massachusetts Institute of Technology (MIT) and the School of Computer Science at Tel Aviv University. At MIT she is a faculty lead for the Theory of Computation group at the Computer Science and Artificial Intelligence Laboratory.
Rubinfeld was born in 1964 in Ohio and grew up in Ann Arbor, Michigan. As a child, she attended Huron High School (class of 1981) and went on to graduate from the University of Michigan with a BSE in Electrical and Computer Engineering (1985). Following that, she received her PhD from the University of California, Berkeley (1990), under the supervision of Manuel Blum. [1] In the years 1990–1992 she did a post-doctorate at Princeton University in New Jersey and then at the Hebrew University in Jerusalem.
In 1992, Rubinfeld joined the faculty of computer science at Cornell University in New York as an associate professor and in 1998 was appointed associate professor. In 2004, she joined as a full professor in the Faculty of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology in Cambridge. In 2008, she received an appointment as a full professor at Tel Aviv University .
Rubinfeld's research interests lie in the fields of computational complexity theory and randomized algorithms, which focus on understanding the limits of computational power and developing efficient algorithms for solving computational problems.
One of her major contributions to theoretical computer science is her work on property testing, which involves designing algorithms to quickly test whether a given object satisfies a certain property. This research has practical applications in fields such as data mining, machine learning, and computer vision, as well as in network and system security.
Rubinfeld has also made important contributions to the study of sublinear algorithms, which are algorithms that do not need to process the entire input in order to produce an accurate result. These algorithms are particularly useful for large-scale data analysis, where processing the entire input may be prohibitively expensive in terms of time and resources.
She has co-authored more than 120 academic articles that have been cited in thousands of different articles. One of her main results, and in the field of model property testing in general, is a method for testing the linearity of a function, which she developed in her work with Manuel Blum and Michael Luby in 1993. The method allows, by sampling a small number of values of a given function, to determine with high probability whether the function is close to a linear function or not.
Rubinfeld also held positions in several research laboratories at various companies in the industry. In 1998, she served as a visiting researcher at the IBM Almaden research laboratories in San Jose (California). Between 1999 and 2003 she served as a senior researcher at the NEC laboratories in Princeton and in 2004 she served as a researcher at the Radcliffe Institute for Science Research. [2]
Ronald Linn Rivest is an American cryptographer and computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. He is an Institute Professor at the Massachusetts Institute of Technology (MIT), and a member of MIT's Department of Electrical Engineering and Computer Science and its Computer Science and Artificial Intelligence Laboratory.
Manuel Blum is a Venezuelan born American computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".
Shafrira Goldwasser is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at Massachusetts Institute of Technology; a professor of mathematical sciences at the Weizmann Institute of Science, Israel; the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley; and co-founder and chief scientist of Duality Technologies.
Silvio Micali is an Italian computer scientist, professor at the Massachusetts Institute of Technology and the founder of Algorand, a proof-of-stake blockchain cryptocurrency protocol. Micali's research at the MIT Computer Science and Artificial Intelligence Laboratory centers on cryptography and information security.
Charles Eric Leiserson is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.
Nancy Ann Lynch is a computer scientist affiliated with the Massachusetts Institute of Technology. She is the NEC Professor of Software Science and Engineering in the EECS department and heads the "Theory of Distributed Systems" research group at MIT's Computer Science and Artificial Intelligence Laboratory.
Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
Michael Fredric Sipser is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the dean of science at the Massachusetts Institute of Technology.
Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.
Gary Lee Miller is an American computer scientist who is a professor of computer science at Carnegie Mellon University. In 2003 he won the ACM Paris Kanellakis Award for the Miller–Rabin primality test. He was made an ACM Fellow in 2002 and won the Knuth Prize in 2013.
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.
Pavel Arkadevich Pevzner is the Ronald R. Taylor Professor of Computer Science and director of the NIH Center for Computational Mass Spectrometry at University of California, San Diego. He serves on the editorial board of PLoS Computational Biology and he is a member of the Genome Institute of Singapore scientific advisory board.
Dana Ron Goldreich is a computer scientist, a professor of electrical engineering at the Tel Aviv University, Israel. Prof. Ron is one of the pioneers of research in property testing, and a leading researcher in that area.
Tandy Warnow is an American computer scientist and Grainger Distinguished Chair in Engineering at the University of Illinois at Urbana–Champaign. She is known for her work on the reconstruction of evolutionary trees, both in biology and in historical linguistics, and also for multiple sequence alignment methods.
Sanjeev Khanna is an Indian-American computer scientist. He is currently a Henry Salvatori professor of Computer and Information Science at the University of Pennsylvania. His research interests include approximation algorithms, hardness of approximation, combinatorial optimization, and sublinear algorithms.
Radhika Nagpal is an Indian-American computer scientist and researcher in the fields of self-organising computer systems, biologically-inspired robotics, and biological multi-agent systems. She is the Augustine Professor in Engineering in the Departments of Mechanical and Aerospace Engineering and Computer Science at Princeton University. Formerly, she was the Fred Kavli Professor of Computer Science at Harvard University and the Harvard School of Engineering and Applied Sciences. In 2017, Nagpal co-founded a robotics company under the name of Root Robotics. This educational company works to create many different opportunities for those unable to code to learn how.
Demetri Terzopoulos is a Greek-Canadian-American computer scientist and entrepreneur. He is currently a Distinguished Professor and Chancellor's Professor of Computer Science in the Henry Samueli School of Engineering and Applied Science at the University of California, Los Angeles, where he directs the UCLA Computer Graphics & Vision Laboratory.
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.
Sofya Raskhodnikova is an American theoretical computer scientist. She is known for her research in sublinear-time algorithms, information privacy, property testing, and approximation algorithms, and was one of the first to study differentially private analysis of graphs. She is a professor of computer science at Boston University.
Ayşe Funda Ergün is a Turkish and American theoretical computer scientist, a professor of computer science at Indiana University Bloomington, and the chair of ACM SIGACT, the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory. Her research interests include streaming algorithms, sublinear algorithms, and applications of computational biology to cancer.