Yahoo Search Busca da Web

Resultado da Busca

  1. Dana Moshkovitz. I am a professor at the Computer Science department of UT Austin. I’m part of the theory group. I have a broad interest in Theoretical Computer Science, with a focus on Probabilistically Checkable Proofs (PCP) and pseudo-randomness.

  2. Dana Moshkovitz is an associate professor of Computer Science at UT Austin. Her research is in Theoretical Computer Science. Much of it focuses on the limitations of approximation algorithms and probabilistic checking of proofs. Dana did her PhD at the Weizmann Institute in Israel.

  3. Dana Moshkovitz Aaronson (Hebrew: דנה מושקוביץ) is an Israeli theoretical computer scientist whose research topics include approximation algorithms and probabilistically checkable proofs. She is an associate professor of computer science at the University of Texas at Austin .

  4. D Moshkovitz, M Moshkovitz. 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , 2018. 36 *. 2018. Parallel repetition from fortification. D Moshkovitz.

  5. Dana Moshkovitz, Algebraic Construction of Projection PCPs, We describe a state-of-the-art construction of PCP. Most details are omitted and the focus is on the main ideas. SIGACT Complexity Column 2012 . Dana Moshkovitz, The Tale of the PCP Theorem (popular article), This is an article I wrote for the students’ magazine of the ACM.

  6. Dana Moshkovitz, Govind Ramnarayan, Henry Yuen, A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (RANDOM16) Gil Goldshlager, Dana Moshkovitz. Approximating kCSP For Large Alphabet, Pasin Manurangsi, Dana Moshkovitz

  7. Dana MOSHKOVITZ, Professor (Associate) | Cited by 908 | of University of Texas at Austin, TX (UT) | Read 37 publications | Contact Dana MOSHKOVITZ