Tom Gur

PhD student
Faculty of Mathematics and Computer Science
Weizmann Institute of Science.

I am very fortunate to have Oded Goldreich as my advisor.
E-mail: tom.gur@weizmann.ac.il
Google Scholar and dblp profiles

I am broadly interested in theoretical computer science and discrete mathematics, with an emphasis on complexity theory, property testing, coding theory, verifiable computation, and communication complexity.

A Hierarchy Theorem for Interactive Proofs of Proximity
with Ron Rothblum
Submitted

Universal Locally Testable Codes
with Oded Goldreich
Submitted

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
with Oded Goldreich and Ron Rothblum
ICALP 2015
(Invited to the ICALP 2015 special issue of Information and Computation)

Strong Locally Testable Codes with Relaxed Local Decoders
with Oded Goldreich and Ilan Komargodski
CCC 2015

Non-Interactive Proofs of Proximity
with Ron Rothblum
ITCS 2015
Computational Complexity, 2016

Arthur-Merlin Streaming Complexity
with Ran Raz
ICALP 2013
Information and Computation, 2015 (special issue for ICALP 2013)

Testing Booleanity and the Uncertainty Principle
with Omer Tamuz
Chicago Journal of Theoretical Computer Science, 2013

Leveraging Genetic Variability across Populations for the Identification of Causal Variant
with Noah Zaitlen, Bogdan Pasaniuc, Elad Ziv, and Eran Halperin
American Journal of Human Genetics, 2010

A Generic Coalescent-Based Framework for the Selection of a Reference Panel for Imputation
with Bogdan Pasaniuc, Ram Avinery, Christine F. Skibola, Paige M. Bracci, and Eran Halperin
Genetic Epidemiology, 2010

In 2012, I completed an MSc in mathematics and computer science at the Weizmann Institute of Science. My advisor was Ran Raz.
In 2010, I completed a BSc in mathematics and computer science at the Tel Aviv University.

Email
tom.gur@weizmann.ac.il
Office
Room 147
Mailing address
Tom Gur
Faculty of Mathematics and Computer Science
Weizmann Institute of Science
Rehovot 76100
Israel