Avishay Tal

574 total citations
44 papers, 196 citations indexed

About

Avishay Tal is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Algebra and Number Theory. According to data from OpenAlex, Avishay Tal has authored 44 papers receiving a total of 196 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 32 papers in Artificial Intelligence and 6 papers in Algebra and Number Theory. Recurrent topics in Avishay Tal's work include Complexity and Algorithms in Graphs (28 papers), Machine Learning and Algorithms (16 papers) and Quantum Computing Algorithms and Architecture (11 papers). Avishay Tal is often cited by papers focused on Complexity and Algorithms in Graphs (28 papers), Machine Learning and Algorithms (16 papers) and Quantum Computing Algorithms and Architecture (11 papers). Avishay Tal collaborates with scholars based in United States, Israel and India. Avishay Tal's co-authors include Ran Raz, Ilan Komargodski, Amir Shpilka, Gil Cohen, Raghav Kulkarni, Kewen Wu, Prahladh Harsha, Russell Impagliazzo, Robin Kothari and Yuval Filmus and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and COMBINATORICA.

In The Last Decade

Avishay Tal

41 papers receiving 165 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Avishay Tal United States	9	148	147	20	16	12	44	196
Dmitry Gavinsky United States	9	108 0.7×	176 1.2×	17 0.8×	6 0.4×	53 4.4×	27	208
Natacha Portier France	6	114 0.8×	74 0.5×	13 0.7×	6 0.4×	7 0.6×	15	142
Kazuyuki Amano Japan	8	100 0.7×	54 0.4×	15 0.8×	16 1.0×	24 2.0×	40	148
Olivier Bodini France	6	55 0.4×	49 0.3×	9 0.5×	27 1.7×		32	109
Mehdi Mhalla France	7	45 0.3×	126 0.9×	11 0.6×	8 0.5×	66 5.5×	22	146
Emmanuel Jeandel France	5	82 0.6×	86 0.6×	10 0.5×	6 0.4×	17 1.4×	16	128
Daniel S. Graça Portugal	9	221 1.5×	84 0.6×	7 0.3×		11 0.9×	30	256
David Callan United States	7	65 0.4×	37 0.3×	34 1.7×	122 7.6×	3 0.3×	60	175
Christopher Pinner United States	11	69 0.5×	78 0.5×	26 1.3×	92 5.8×	5 0.4×	38	306
Lars Eirik Danielsen Norway	8	39 0.3×	169 1.1×	38 1.9×	7 0.4×	96 8.0×	13	192

Countries citing papers authored by Avishay Tal

Since Specialization

Citations

This map shows the geographic impact of Avishay Tal's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Avishay Tal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Avishay Tal more than expected).

Fields of papers citing papers by Avishay Tal

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Avishay Tal. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Avishay Tal. The network helps show where Avishay Tal may publish in the future.

Co-authorship network of co-authors of Avishay Tal

This figure shows the co-authorship network connecting the top 25 collaborators of Avishay Tal. A scholar is included among the top collaborators of Avishay Tal based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Avishay Tal. Avishay Tal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Tal, Avishay, et al.. (2024). The Power of Adaptivity in Quantum Query Algorithms. eScholarship (California Digital Library). 1488–1497.

2.

Tal, Avishay, et al.. (2023). Depth-𝑑 Threshold Circuits vs. Depth-(𝑑+1) AND-OR Trees. 895–904. 1 indexed citations

3.

Tal, Avishay, et al.. (2023). Fourier Growth of Communication Protocols for XOR Functions. eScholarship (California Digital Library). 2020. 721–732. 1 indexed citations

4.

Raz, Ran & Avishay Tal. (2022). Oracle Separation of BQP and PH. Journal of the ACM. 69(4). 1–21. 6 indexed citations

5.

Tal, Avishay, et al.. (2022). Fooling Constant-Depth Threshold Circuits (Extended Abstract). 104–115. 1 indexed citations

6.

Tal, Avishay, et al.. (2021). Fourier Growth of Parity Decision Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

7.

Tal, Avishay, et al.. (2021). Fooling Constant-Depth Threshold Circuits.. 28. 2. 3 indexed citations

8.

Aaronson, Scott, Shalev Ben-David, Robin Kothari, & Avishay Tal. (2020). Quantum Implications of Huang's Sensitivity Theorem. arXiv (Cornell University). 27. 66. 1 indexed citations

9.

Harsha, Prahladh, et al.. (2020). Rigid Matrices From Rectangular PCPs. arXiv (Cornell University). 27. 75. 1 indexed citations

10.

Golovnev, Alexander, et al.. (2019). AC^0[p] Lower Bounds Against MCSP via the Coin Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 26. 18. 1 indexed citations

11.

Tal, Avishay. (2016). The Bipartite Formula Complexity of Inner-Product is Quadratic.. Electronic colloquium on computational complexity. 23. 181. 2 indexed citations

12.

Tal, Avishay. (2016). On The Sensitivity Conjecture.. Electronic colloquium on computational complexity. 23. 62. 1 indexed citations

13.

Tal, Avishay. (2016). Computing Requires Larger Formulas than Approximating.. Electronic colloquium on computational complexity. 23. 179. 1 indexed citations

14.

Tal, Avishay. (2015). SAT Algorithms from Shrinkage.. Electronic colloquium on computational complexity. 22. 114. 4 indexed citations

15.

Shpilka, Amir, et al.. (2015). On the Structure of Boolean Functions with Small Spectral Norm. Computational Complexity. 26(1). 229–273. 8 indexed citations

16.

Tal, Avishay. (2014). Shrinkage of De Morgan Formulae from Quantum Query Complexity.. Electronic colloquium on computational complexity. 21. 48. 6 indexed citations

17.

Shpilka, Amir, et al.. (2014). On the structure of boolean functions with small spectral norm. 37–48. 9 indexed citations

18.

Kulkarni, Raghav & Avishay Tal. (2013). On Fractional Block Sensitivity.. Electronic colloquium on computational complexity. 20. 168. 1 indexed citations

19.

Komargodski, Ilan, Ran Raz, & Avishay Tal. (2013). Improved Average-Case Lower Bounds for DeMorgan Formula Size. 588–597. 20 indexed citations

20.

Tal, Avishay, et al.. (1960). Pneumatic relay circuits. IFAC Proceedings Volumes. 1(1). 1304–1312. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact