09/01/2021 - According to UTCS Professor Dana Moshkovitz, randomized algorithms are sometimes faster than the best known deterministic algorithms—this is known to be true in the field of computer science. But her research group’s work proves that they can be quadratically faster, under plausible complexity assumptions. Under complexity assumptions, the upper bound on this is tight and problems exist for which randomization gives a quadratic speedup. Read more
04/16/2019 - Read more
03/16/2017 - Dana Moshkovitz earned her bachelor's degree in computer science from the University of Israel while most people her age were filling out their college applications—at the age of 17. She continued her education at Tel Aviv University, Weizmann Institute of Science, and Princeton, collecting computer science degrees at each and a postdoc at the latter. She has previously worked at MIT where she won a teaching award for her course on the design and analysis of algorithms. Read more
Subscribe to Topic: Dana Moshkovitz