Marı́a Luisa Bonet

2.1k total citations
43 papers, 668 citations indexed

About

Marı́a Luisa Bonet is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Marı́a Luisa Bonet has authored 43 papers receiving a total of 668 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Artificial Intelligence, 31 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in Marı́a Luisa Bonet's work include Formal Methods in Verification (18 papers), Logic, Reasoning, and Knowledge (15 papers) and Logic, programming, and type systems (15 papers). Marı́a Luisa Bonet is often cited by papers focused on Formal Methods in Verification (18 papers), Logic, Reasoning, and Knowledge (15 papers) and Logic, programming, and type systems (15 papers). Marı́a Luisa Bonet collaborates with scholars based in Spain, United States and Portugal. Marı́a Luisa Bonet's co-authors include Jordi Levy, Carlos Ansótegui, Toniann Pitassi, Nicola Galesi, Ran Raz, Juan Luis Esteban, Albert Atserias, Felip Manyà, Jan Johannsen and Samuel R. Buss and has published in prestigious journals such as Information Sciences, Artificial Intelligence and SIAM Journal on Computing.

In The Last Decade

Marı́a Luisa Bonet

38 papers receiving 606 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Marı́a Luisa Bonet Spain 16 497 445 172 47 47 43 668
Oren Weimann Israel 11 177 0.4× 234 0.5× 131 0.8× 95 2.0× 16 0.3× 40 423
Jens Gramm Germany 13 298 0.6× 157 0.4× 156 0.9× 146 3.1× 14 0.3× 24 475
Eric Blais Canada 11 184 0.4× 268 0.6× 147 0.9× 29 0.6× 28 0.6× 38 427
Catherine McCartin New Zealand 11 94 0.2× 77 0.2× 96 0.6× 27 0.6× 25 0.5× 22 238
Vasco Manquinho Portugal 10 158 0.3× 128 0.3× 140 0.8× 16 0.3× 73 1.6× 54 316
Norbert Blüm Germany 7 182 0.4× 145 0.3× 98 0.6× 21 0.4× 9 0.2× 22 301
Knot Pipatsrisawat United States 11 114 0.2× 246 0.6× 78 0.5× 68 1.4× 27 0.6× 21 389
Jan Arne Telle Norway 16 720 1.4× 76 0.2× 343 2.0× 25 0.5× 6 0.1× 69 864
Peter Emde Boas Netherlands 2 117 0.2× 179 0.4× 125 0.7× 31 0.7× 8 0.2× 2 325
Roland Kaminski Germany 12 111 0.2× 585 1.3× 131 0.8× 57 1.2× 23 0.5× 21 685

Countries citing papers authored by Marı́a Luisa Bonet

Since Specialization
Citations

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

Fields of papers citing papers by Marı́a Luisa Bonet

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marı́a Luisa Bonet. 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 Marı́a Luisa Bonet. The network helps show where Marı́a Luisa Bonet may publish in the future.

Co-authorship network of co-authors of Marı́a Luisa Bonet

This figure shows the co-authorship network connecting the top 25 collaborators of Marı́a Luisa Bonet. A scholar is included among the top collaborators of Marı́a Luisa Bonet 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 Marı́a Luisa Bonet. Marı́a Luisa Bonet 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.
Bonet, Marı́a Luisa, et al.. (2024). Weighted, Circular and Semi-Algebraic Proofs. Journal of Artificial Intelligence Research. 79. 447–482.
2.
Bonet, Marı́a Luisa, Sam Buss, Alexey Ignatiev, António Morgado, & João Marques‐Silva. (2021). Propositional proof systems based on maximum satisfiability. Artificial Intelligence. 300. 103552–103552. 5 indexed citations
3.
Bonet, Marı́a Luisa, et al.. (2019). 2-D Tucker is PPA complete. Journal of Computer and System Sciences. 108. 92–103.
4.
Bonet, Marı́a Luisa, et al.. (2016). QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS. Journal of Symbolic Logic. 81(2). 687–710. 1 indexed citations
5.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jesús Giráldez-Cru, & Jordi Levy. (2016). Structure features for SAT instances classification. Journal of Applied Logic. 23. 27–39. 7 indexed citations
6.
Ansótegui, Carlos, Marı́a Luisa Bonet, & Jordi Levy. (2013). SAT-based MaxSAT algorithms. Artificial Intelligence. 196. 77–105. 79 indexed citations
7.
Bonet, Marı́a Luisa, Simone Linz, & Katherine St. John. (2011). The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9(1). 273–285. 3 indexed citations
8.
Ansótegui, Carlos, Marı́a Luisa Bonet, & Jordi Levy. (2009). Towards industrial-like random SAT instances. International Joint Conference on Artificial Intelligence. 387–392. 20 indexed citations
9.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2008). Measuring the hardness of SAT instances. National Conference on Artificial Intelligence. 222–228. 17 indexed citations
10.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2007). Inference rules for high-order consistency in weighted CSP. National Conference on Artificial Intelligence. 167–172. 3 indexed citations
11.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2007). What Is a Real-World SAT Instance?. 19–28. 1 indexed citations
12.
Bonet, Marı́a Luisa, et al.. (2004). Non-Automatizability of Bounded-Depth Frege Proofs. Computational Complexity. 13(1-2). 47–68. 22 indexed citations
13.
Atserias, Albert, Marı́a Luisa Bonet, & Jordi Levy. (2003). On Chvátal Rank and Cutting Planes Proofs. Electronic colloquium on computational complexity. 41. 1 indexed citations
14.
Atserias, Albert & Marı́a Luisa Bonet. (2003). On the automatizability of resolution and related propositional proof systems. Information and Computation. 189(2). 182–201. 27 indexed citations
15.
Atserias, Albert, Marı́a Luisa Bonet, & Juan Luis Esteban. (2002). Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Information and Computation. 176(2). 136–152. 26 indexed citations
16.
Bonet, Marı́a Luisa, Juan Luis Esteban, Nicola Galesi, & Jan Johannsen. (2002). Exponential separations between restricted resolution and cutting planes proof systems. IRIS Research product catalog (Sapienza University of Rome). 638–647. 15 indexed citations
17.
Bonet, Marı́a Luisa, Juan Luis Esteban, Nicola Galesi, & Jan Johannsen. (2000). On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM Journal on Computing. 30(5). 1462–1484. 53 indexed citations
18.
Bonet, Marı́a Luisa, Toniann Pitassi, & Ran Raz. (1997). Lower bounds for cutting planes proofs with small coefficients. Journal of Symbolic Logic. 62(3). 708–728. 57 indexed citations
19.
Bonet, Marı́a Luisa & Samuel R. Buss. (1995). The Serial Transitive Closure Problem for Trees. SIAM Journal on Computing. 24(1). 109–122.
20.
Bonet, Marı́a Luisa & Samuel R. Buss. (1993). The deduction rule and linear and near-linear proof simulations. Journal of Symbolic Logic. 58(2). 688–709. 9 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

Breakdown of academic impact, for papers by Oren Weimann Breakdown of academic impact, for papers by Jens Gramm Breakdown of academic impact, for papers by Eric Blais Breakdown of academic impact, for papers by Catherine McCartin Breakdown of academic impact, for papers by Vasco Manquinho Breakdown of academic impact, for papers by Norbert Blüm Breakdown of academic impact, for papers by Knot Pipatsrisawat Breakdown of academic impact, for papers by Jan Arne Telle Breakdown of academic impact, for papers by Peter Emde Boas Breakdown of academic impact, for papers by Roland Kaminski
Rankless by CCL
2026