Avishay Tal
Orcid: 0000-0002-0375-6554
According to our database1,
Avishay Tal
authored at least 61 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2010
2012
2014
2016
2018
2020
2022
2024
0
5
10
1
2
1
3
4
2
4
6
6
6
1
2
2
1
1
1
1
4
4
1
2
1
4
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Electron. Colloquium Comput. Complex., 2022
Comput. Complex., 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the Approximation, 2021
2020
Proceedings of the Computational Complexity and Property Testing, 2020
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC<sup>0</sup>.
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits.
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates.
Electron. Colloquium Comput. Complex., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound.
SIAM J. Comput., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity.
Electron. Colloquium Comput. Complex., 2017
Comput. Complex., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 32nd Computational Complexity Conference, 2017
Proceedings of the Approximation, 2017
2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
2015
2014
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
2012
Electron. Colloquium Comput. Complex., 2012
2011
Electron. Colloquium Comput. Complex., 2011
2010
Electron. Colloquium Comput. Complex., 2010