Ofer Grossman is interested in the
fundamental possibilities and limitations of computation. In particular, he is
interested in distributed and parallel computing, and the role of randomization
As an undergraduate at MIT, Ofer has contributed to the field of derandomization
and pseudo-deterministic algorithms. With Professor Shafi Goldwasser
he showed how to pseudo-deterministically find perfect matchings
in parallel on bipartite graphs. With Professor Dana Moshkovitz
he has developed general methods for derandomization,
and with Merav Parter
he has developed improved deterministic distributed algorithms for spanner
construction. Also, he discovered a pseudo-deterministic algorithm for
generating primitive roots modulo primes. He plans to continue studying
randomization in algorithms and complexity theory.
Ofer was born in Israel, and has
lived in the USA since the age of twelve.