( en | de | ru )

 

Disambiguation of "Grossman, Ofer"

Author of the publication

copydeleteadd this publication to your clipboard
Error Correcting Codes for Uncompressed Messages.

, and . Electron. Colloquium Comput. Complex., (2020)

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.

Alfred Grossman

Ofer Engel

Helmut Ofer

Rebekka Ofer

Monika Ofer

 

Other publications of authors with the same name

Strategy-Stealing is Non-Constructive., and . Electron. Colloquium Comput. Complex., (2019)Error Correcting Codes for Uncompressed Messages., and . ITCS, volume 185 of LIPIcs, page 43:1-43:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Bipartite Perfect Matching in Pseudo-Deterministic NC., and . ICALP, volume 80 of LIPIcs, page 87:1-87:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Amplification and Derandomization without Slowdown., and . SIAM J. Comput., 49 (5): 959-998 (2020)Error Correcting Codes for Uncompressed Messages., and . Electron. Colloquium Comput. Complex., (2020)Amplification and Derandomization Without Slowdown., and . Electron. Colloquium Comput. Complex., (2015)Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting., , and . FOCS, page 1496-1504. IEEE, (2023)Transparent Error Correcting in a Computationally Bounded World., , and . TCC (3), volume 12552 of Lecture Notes in Computer Science, page 530-549. Springer, (2020)Reproducibility and Pseudo-Determinism in Log-Space., and . SODA, page 606-620. SIAM, (2019)Pseudo-Deterministic Proofs., , and . ITCS, volume 94 of LIPIcs, page 17:1-17:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)