Ofer Grossman

According to our database1, Ofer Grossman authored at least 18 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Pseudo-determinism
PhD thesis, 2023

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021
Error Correcting Codes for Uncompressed Messages.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Improved Hardness of Approximation of Diameter in the CONGEST Model.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Transparent Error Correcting in a Computationally Bounded World.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Pseudo-Deterministic Streaming.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Strategy-Stealing Is Non-Constructive.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Reproducibility and Pseudo-Determinism in Log-Space.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Algorithms for Noisy Broadcast under Erasures.
CoRR, 2018

Pseudo-Deterministic Proofs.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Algorithms for Noisy Broadcast with Erasures.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Improved Deterministic Distributed Construction of Spanners.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Bipartite Perfect Matching in Pseudo-Deterministic NC.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Amplification and Derandomization without Slowdown.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Finding Primitive Roots Pseudo-Deterministically.
Electron. Colloquium Comput. Complex., 2015

Perfect Bipartite Matching in Pseudo-Deterministic RNC.
Electron. Colloquium Comput. Complex., 2015


  Loading...