Author of the publication

The Complexity of User Retention.

, and . ITCS, volume 124 of LIPIcs, page 12:1-12:30. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Affine Dispersers from Subspace Polynomials., and . SIAM J. Comput., 41 (4): 880-914 (2012)Towards lower bounds on locally testable codes via density arguments., and . Computational Complexity, 21 (2): 267-309 (2012)SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge., , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 90-108. Springer, (2013)Limits on the Rate of Locally Testable Affine-Invariant Codes., and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 412-423. Springer, (2011)Short Proofs are Narrow - Resolution Made Simple., and . STOC, page 517-526. ACM, (1999)Zerocash: Decentralized Anonymous Payments from Bitcoin., , , , , , and . IEEE Symposium on Security and Privacy, page 459-474. IEEE Computer Society, (2014)Size space tradeoffs for resolution.. STOC, page 457-464. ACM, (2002)Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions., and . ICS, page 401-416. Tsinghua University Press, (2011)The Complexity of User Retention., and . ITCS, volume 124 of LIPIcs, page 12:1-12:30. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Some 3CNF Properties Are Hard to Test., , and . SIAM J. Comput., 35 (1): 1-21 (2005)