I'm a fifth year PhD student at the Computer Science department at Stanford University, under the guidance of Virginia Vassilevska Williams. Previously, I obtained an M.Sc. degree at the Technion, and a B.Sc. degree in the "Etgar" program at the University of Haifa.
My main research interest is "Hardness in P" or "Fine-Grained Complexity", where we try to understand the
computational complexity of basic and fundamental problems (see more details below).
I have a broad interest in the Theory of Computation. Here's a partial list of the other topics I work on: Graph Theory and Algorithms, Dynamic Data Structures, Pattern Matching and Sequence Alignment, Exact Algorithms and Parameterized Complexity, Distributed Computing, and Circuit Complexity.
Publications papers and talks, with short summaries.
- If the Current Clique Algorithms are Optimal, so is Valiant's Parser. with Backurs and Vassilevska Williams FOCS'15 (special issue) [slides] [video] [pdf]
To learn more about "Hardness in P":
- Recent Developments in Hardness in P (from the Simons Reunion)
- The New P (20-min video talk) [Updated longer version]
- Strengthening SETH Lower Bounds (Invited article)
- Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop)
- Hardness and Equivalences in P (Tutorial at STOC'15)
- More video talks: [FOCS'14, FOCS'15, FOCS'16]
PC member: CPM 2016
I moderate the Stanford indoor soccer pick-up group.
Email: (last name)@cs.stanford.edu Office: Gates 486