What would you like to search for?
What would you like to search for?

Prof. Dean Doron Awarded ERC Starting Grant

BGU’s Prof. Dean Doron receives a five-year ERC Starting Grant to study randomness and the potential for deterministic, error-free algorithms.

Prof. Dean Doron of the Institute for the Theory of Computing in the Stein Faculty of Computer and Information Science has been awarded a European Research Council (ERC) Starting Grant. The five-year research grant is one of the most prestigious in the world.

Prof. Dean Doron | Photo: Dani Machlis/BGU

Prof. Doron describes the new research project, “The ERC grant explores the power and limitations of randomness in computation, particularly in algorithms. It focuses on fundamental questions about the everyday use of randomness in computation: When is randomness necessary? When can randomized algorithms be replaced by deterministic, error-free ones? And when randomness is needed but only weak sources are available, how can they be transformed into almost perfect randomness?

Prof. Doron is particularly interested in pseudorandomness, derandomization, and error-correcting codes. He received his PhD from Tel Aviv University under the supervision of Prof. Amnon Ta-Shma. Before joining BGU, he was a Motwani Postdoctoral Fellow at Stanford University and a postdoctoral researcher at the University of Texas at Austin, hosted by Prof. Dana Moshkovitz and Prof. David Zuckerman.

Prof. Dean Doron of the Institute for the Theory of Computing in the Stein Faculty of Computer and Information Science has been awarded a European Research Council (ERC) Starting Grant. The five-year research grant is one of the most prestigious in the world. Prof. Dean Doron | Photo: Dani Machlis/BGU Prof. Doron describes the new research project, “The ERC grant explores the power and limitations of randomness in computation, particularly in algorithms. It focuses on fundamental questions about the everyday use of randomness in computation: When is randomness necessary? When can randomized algorithms be replaced by deterministic, error-free ones? And when randomness is needed but only weak sources are available, how can they be transformed into almost perfect randomness? Prof. Doron is particularly interested in pseudorandomness, derandomization, and error-correcting codes. He received his PhD from Tel Aviv University under the supervision of Prof. Amnon Ta-Shma. Before joining BGU, he was a Motwani Postdoctoral
177

What Else is Happening?