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