An Improved Online Reduction from PAC Learning to Mistake-Bounded Learning. - Lucas Gretta; Eric Price 001 (SOSA, 2023)

Sharp Noisy Binary Search with Monotonic Probabilities. - Lucas Gretta; Eric Price 001 (ICALP, 2024)

More Efficient k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (CoRR, 2024)

More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (IACR Cryptol. ePrint Arch., 2024)

More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (SODA, 2025)