| No. |
Title |
Author |
Year |
| 1 |
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity |
Blocki, Jeremiah et al. |
2023 |
| 2 |
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors |
Block, Alexander R. et al. |
2023 |
| 3 |
On Explicit Constructions of Extremely Depth Robust Graphs |
Blocki, Jeremiah et al. |
2022 |
| 4 |
Privately Estimating Graph Parameters in Sublinear Time |
Blocki, Jeremiah et al. |
2022 |
| 5 |
A New Connection Between Node and Edge Depth Robust Graphs |
Blocki, Jeremiah et al. |
2021 |
| 6 |
On the Security of Proofs of Sequential Work in a Post-Quantum World |
Blocki, Jeremiah et al. |
2021 |
| 7 |
Approximating Cumulative Pebbling Cost Is Unique Games Hard |
Blocki, Jeremiah et al. |
2020 |
| 8 |
Computationally Data-Independent Memory Hard Functions |
Ameri, Mohammad Hassan et al. |
2020 |
| 9 |
Locally Decodable/Correctable Codes for Insertions and Deletions |
Block, Alexander R. et al. |
2020 |
| 10 |
On Locally Decodable Codes in Resource Bounded Channels |
Blocki, Jeremiah et al. |
2020 |
| 11 |
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels |
Blocki, Jeremiah et al. |
2018 |
| 12 |
Towards Human Computable Passwords |
Blocki, Jeremiah et al. |
2017 |
