Eric Blais

1.1k total citations
38 papers, 427 citations indexed

About

Eric Blais is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Eric Blais has authored 38 papers receiving a total of 427 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 27 papers in Computational Theory and Mathematics and 8 papers in Computer Networks and Communications. Recurrent topics in Eric Blais's work include Complexity and Algorithms in Graphs (25 papers), Machine Learning and Algorithms (20 papers) and Cryptography and Data Security (8 papers). Eric Blais is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Machine Learning and Algorithms (20 papers) and Cryptography and Data Security (8 papers). Eric Blais collaborates with scholars based in Canada, United States and Israel. Eric Blais's co-authors include Joshua Brody, Aditya Parameswaran, Kevin Matulef, Jianmei Guo, Krzysztof Czarnecki, Ronitt Rubinfeld, Samuel Madden, Ryan O’Donnell, Albert Kim and Piotr Indyk and has published in prestigious journals such as Journal of the ACM, Machine Learning and SIAM Journal on Computing.

In The Last Decade

Eric Blais

33 papers receiving 402 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Eric Blais Canada 11 268 184 147 90 87 38 427
Oren Weimann Israel 11 234 0.9× 177 1.0× 131 0.9× 62 0.7× 48 0.6× 40 423
Stephen Alstrup Denmark 14 281 1.0× 300 1.6× 194 1.3× 104 1.2× 56 0.6× 43 604
Angelika Kimmig Belgium 14 760 2.8× 106 0.6× 111 0.8× 133 1.5× 80 0.9× 40 883
Rick Statman United States 8 357 1.3× 218 1.2× 70 0.5× 45 0.5× 54 0.6× 29 435
Anne Berry France 12 90 0.3× 294 1.6× 95 0.6× 58 0.6× 22 0.3× 32 420
Adam L. Buchsbaum United States 14 333 1.2× 202 1.1× 296 2.0× 96 1.1× 66 0.8× 41 623
Juha Kärkkäinen Finland 14 549 2.0× 136 0.7× 122 0.8× 110 1.2× 68 0.8× 49 674
Elad Verbin Israel 12 130 0.5× 165 0.9× 127 0.9× 32 0.4× 28 0.3× 25 309
Domenico Cantone Italy 11 340 1.3× 255 1.4× 76 0.5× 53 0.6× 40 0.5× 112 509
Richard C. T. Lee United States 9 335 1.3× 266 1.4× 68 0.5× 56 0.6× 45 0.5× 20 493

Countries citing papers authored by Eric Blais

Since Specialization
Citations

This map shows the geographic impact of Eric Blais'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 Eric Blais with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric Blais more than expected).

Fields of papers citing papers by Eric Blais

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eric Blais. 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 Eric Blais. The network helps show where Eric Blais may publish in the future.

Co-authorship network of co-authors of Eric Blais

This figure shows the co-authorship network connecting the top 25 collaborators of Eric Blais. A scholar is included among the top collaborators of Eric Blais 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 Eric Blais. Eric Blais is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ben-David, Shalev, et al.. (2022). Randomised Composition and Small-Bias Minimax. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 624–635. 1 indexed citations
2.
Blais, Eric, et al.. (2021). Box Covers and Domain Orderings for Beyond Worst-Case Join Processing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 23. 1 indexed citations
3.
Ben-David, Shalev & Eric Blais. (2020). A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. 240–246. 3 indexed citations
4.
Ben-David, Shalev & Eric Blais. (2020). A New Minimax Theorem for Randomized Algorithms (Extended Abstract). 403–411. 3 indexed citations
5.
Blais, Eric & Joshua Brody. (2019). Optimal Separation and Strong Direct Sum for Randomized Query Complexity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
6.
Blais, Eric, Ryan O’Donnell, & Karl Wimmer. (2018). Polynomial regression under arbitrary product distributions. Research Showcase @ Carnegie Mellon University (Carnegie Mellon University). 193–204. 1 indexed citations
7.
Blais, Eric, Clément L. Canonne, & Tom Gur. (2017). Distribution testing lower bounds via reductions from communication complexity. 40. 2 indexed citations
8.
Blais, Eric, et al.. (2016). Learning and Testing Junta Distributions. Conference on Learning Theory. 19–46. 2 indexed citations
9.
Belovs, Aleksandrs & Eric Blais. (2015). . Theory of Computing. 11(1). 403–412. 5 indexed citations
10.
Guo, Jianmei, et al.. (2015). Performance Prediction of Configurable Software Systems by Fourier Learning (T). 365–373. 53 indexed citations
11.
Blais, Eric, et al.. (2015). Partially Symmetric Functions Are Efficiently Isomorphism Testable. SIAM Journal on Computing. 44(2). 411–432. 3 indexed citations
12.
Blais, Eric, et al.. (2015). Learning Circuits with few Negations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21. 144.
13.
Kim, Albert, Eric Blais, Aditya Parameswaran, et al.. (2015). Rapid sampling for visualizations with ordering guarantees. Proceedings of the VLDB Endowment. 8(5). 521–532. 74 indexed citations
14.
Blais, Eric, Joshua Brody, & Badih Ghazi. (2014). The Information Complexity of Hamming Distance. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 28. 465–489. 4 indexed citations
15.
Blais, Eric & Li-Yang Tan. (2013). Approximating Boolean functions with depth-2 circuits.. Electronic colloquium on computational complexity. 20. 51. 1 indexed citations
16.
Blais, Eric, Sofya Raskhodnikova, & Grigory Yaroslavtsev. (2013). Lower Bounds for Testing Properties of Functions on Hypergrid Domains.. Electronic colloquium on computational complexity. 20. 36. 3 indexed citations
17.
Blais, Eric & Li-Yang Tan. (2013). . Theory of Computing. 9(1). 889–896. 2 indexed citations
18.
O’Donnell, Ryan & Eric Blais. (2012). Testing properties of boolean functions.
19.
Blais, Eric, Ryan O’Donnell, & Karl Wimmer. (2010). Polynomial regression under arbitrary product distributions. Machine Learning. 80(2-3). 273–294. 10 indexed citations
20.
Blin, Guillaume, Eric Blais, Danny Hermelin, et al.. (2007). Gene Maps Linearization Using Genomic Rearrangement Distances. Journal of Computational Biology. 14(4). 394–407. 6 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

Rankless by CCL
2026