Rachel Yun Zhang

Orcid: 0000-0001-6341-3505

According to our database1, Rachel Yun Zhang authored at least 17 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
List Decoding Bounds for Binary Codes with Noiseless Feedback.
CoRR, 2024

2023
On Interactive Coding Schemes with Adaptive Termination.
Electron. Colloquium Comput. Complex., 2023

A Noise Resilient Transformation for Streaming Algorithms.
Electron. Colloquium Comput. Complex., 2023

New Codes on High Dimensional Expanders.
Electron. Colloquium Comput. Complex., 2023

A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes.
CoRR, 2023

Binary Error-Correcting Codes with Minimal Noiseless Feedback.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Interactive Error Correcting Codes: New Constructions and Impossibility Bounds.
Proceedings of the Approximation, 2023

2022
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel.
Electron. Colloquium Comput. Complex., 2022

Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures.
CoRR, 2022

Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P.
IACR Cryptol. ePrint Arch., 2021

The Optimal Error Resilience of Interactive Communication Over Binary Channels.
IACR Cryptol. ePrint Arch., 2021

Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption.
IACR Cryptol. ePrint Arch., 2021

The relation between composability and splittability of permutation classes.
Discret. Math., 2021

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020
SNARGs for Bounded Depth Computations from Sub-Exponential LWE.
IACR Cryptol. ePrint Arch., 2020

SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE.
IACR Cryptol. ePrint Arch., 2020


  Loading...