NSF CCF-1763299

Bibliographic References tagged with NSF CCF-1763299

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Lee, Chin Ho, Edward Pyne, and Salil Vadhan. “Fourier Growth of Regular Branching Programs”. Proceedings of the International Conference on Randomization and Computation (RANDOM ’22). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2022.
Lee, Chin Ho, Edward Pyne, and Salil Vadhan. “Fourier Growth of Regular Branching Programs”. Proceedings of the International Conference on Randomization and Computation (RANDOM ’22). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2022.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Golowich, Louis, and Salil Vadhan. “Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs”. Proceedings of the 37th Computational Complexity Conference (CCC ’22) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2022.
Golowich, Louis, and Salil Vadhan. “Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs”. Proceedings of the 37th Computational Complexity Conference (CCC ’22) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2022.
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. 36th Annual Computational Complexity Conference (CCC ’21) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. 36th Annual Computational Complexity Conference (CCC ’21) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Doron, Dean, Jack Murtagh, Salil Vadhan, and David Zuckerman. “Small-Space Spectral Sparsification via Bounded-Independence Sampling”. ACM Transactions on Computation Theory 16, no. 2 (2024): 32.
Doron, Dean, Jack Murtagh, Salil Vadhan, and David Zuckerman. “Small-Space Spectral Sparsification via Bounded-Independence Sampling”. ACM Transactions on Computation Theory 16, no. 2 (2024): 32.
Ahmadinejad, AmirMahdi, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. “High-Precision Estimation of Random Walks in Small Space”. 61st Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2020). IEEE, 2020.
Ahmadinejad, AmirMahdi, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. “High-Precision Estimation of Random Walks in Small Space”. 61st Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2020). IEEE, 2020.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Deterministic Approximation of Random Walks in Small Space”. Theory of Computing Special Issue on APPROX-RANDOM ’19 17(4) (2021): 1-35.
Murtagh, Jack, Omer Reingold, Aaron Sidford, and Salil Vadhan. “Deterministic Approximation of Random Walks in Small Space”. Theory of Computing Special Issue on APPROX-RANDOM ’19 17(4) (2021): 1-35.