Published in: LIPIcs, Volume 353, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025)
Ben Chen and Amnon Ta-Shma. Simplifying Armoni’s PRG. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 353, pp. 36:1-36:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chen_et_al:LIPIcs.APPROX/RANDOM.2025.36,
author = {Chen, Ben and Ta-Shma, Amnon},
title = {{Simplifying Armoni’s PRG}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025)},
pages = {36:1--36:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-397-3},
ISSN = {1868-8969},
year = {2025},
volume = {353},
editor = {Ene, Alina and Chattopadhyay, Eshan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.36},
URN = {urn:nbn:de:0030-drops-244024},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2025.36},
annote = {Keywords: PRG, ROBP, read-once, random, psuedorandom, armoni, derandomization}
}