Improved Decoding of Expander Codes. | 0 | 0.34 | 2022 |
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. | 0 | 0.34 | 2021 |
Locally Decodable Codes with Randomized Encoding | 0 | 0.34 | 2020 |
Hitting Sets Give Two-Sided Derandomization of Small Space. | 0 | 0.34 | 2020 |
Synchronization Strings - Highly Efficient Deterministic Constructions over Small Alphabets. | 0 | 0.34 | 2019 |
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors | 3 | 0.38 | 2018 |
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. | 3 | 0.42 | 2018 |
Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. | 0 | 0.34 | 2018 |
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0. | 0 | 0.34 | 2017 |
Near-Optimal Secret Sharing and Error Correcting Codes in AC0. | 0 | 0.34 | 2017 |
Cold Centering Algorithm on Pipe Based on Laser Measurement. | 0 | 0.34 | 2017 |
Randomness Extraction in AC0 and with Small Locality. | 1 | 0.35 | 2016 |
Pseudorandom Generator Based on Hard Lattice Problem. | 0 | 0.34 | 2014 |
Some Improved Complexity Results for uSVP and GapSVP. | 0 | 0.34 | 2013 |