Jacob M. Howe

484 total citations
17 papers, 49 citations indexed

About

Jacob M. Howe is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Jacob M. Howe has authored 17 papers receiving a total of 49 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 11 papers in Computational Theory and Mathematics and 4 papers in Software. Recurrent topics in Jacob M. Howe's work include Logic, programming, and type systems (11 papers), Formal Methods in Verification (10 papers) and Logic, Reasoning, and Knowledge (5 papers). Jacob M. Howe is often cited by papers focused on Logic, programming, and type systems (11 papers), Formal Methods in Verification (10 papers) and Logic, Reasoning, and Knowledge (5 papers). Jacob M. Howe collaborates with scholars based in United Kingdom, Saudi Arabia and Israel. Jacob M. Howe's co-authors include Andy King, Edward Robbins, Samir Genaim, Michael Codish and Axel Simon and has published in prestigious journals such as Theoretical Computer Science, Information Processing Letters and Science of Computer Programming.

In The Last Decade

Jacob M. Howe

15 papers receiving 46 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jacob M. Howe United Kingdom 6 36 27 10 10 10 17 49
Liana Hadarean United States 4 35 1.0× 21 0.8× 9 0.9× 15 1.5× 7 0.7× 8 52
Mate Soos Singapore 4 57 1.6× 24 0.9× 20 2.0× 7 0.7× 9 0.9× 7 69
Larissa Meinicke Australia 4 29 0.8× 24 0.9× 10 1.0× 9 0.9× 4 0.4× 11 41
Norbert Manthey Germany 5 40 1.1× 20 0.7× 20 2.0× 4 0.4× 7 0.7× 14 54
Julien Brunel France 5 20 0.6× 11 0.4× 7 0.7× 13 1.3× 4 0.4× 15 41
Joe Hurd United Kingdom 5 79 2.2× 56 2.1× 6 0.6× 9 0.9× 4 0.4× 13 90
Fides Aarts Netherlands 4 56 1.6× 31 1.1× 11 1.1× 19 1.9× 12 1.2× 7 80
Vitaly Lagoon Australia 5 52 1.4× 37 1.4× 35 3.5× 4 0.4× 8 0.8× 9 65
Johannes Oetsch Austria 6 63 1.8× 15 0.6× 8 0.8× 6 0.6× 5 0.5× 22 89
David Nowak Japan 5 55 1.5× 44 1.6× 7 0.7× 8 0.8× 5 0.5× 11 68

Countries citing papers authored by Jacob M. Howe

Since Specialization
Citations

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

Fields of papers citing papers by Jacob M. Howe

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jacob M. Howe

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

All Works

17 of 17 papers shown
1.
Robbins, Edward, Andy King, & Jacob M. Howe. (2020). Backjumping is Exception Handling. Theory and Practice of Logic Programming. 21(2). 125–144. 1 indexed citations
2.
Howe, Jacob M., et al.. (2019). Exact and Approximate Rule Extraction from Neural Networks with Boolean Features. City Research Online (City University London). 424–433. 8 indexed citations
3.
Howe, Jacob M., et al.. (2018). Preventing Cross-Site Scripting Attacks by Combining Classifiers. 135–143. 5 indexed citations
4.
Howe, Jacob M., Andy King, & Axel Simon. (2018). Incremental Closure for Systems of Two Variables Per Inequality. Theoretical Computer Science. 768. 1–42.
5.
Robbins, Edward, Jacob M. Howe, & Andy King. (2014). Theory propagation and reification. Science of Computer Programming. 111. 3–22. 2 indexed citations
6.
Robbins, Edward, Jacob M. Howe, & Andy King. (2013). Theory propagation and rational-trees. Kent Academic Repository (University of Kent). 193–204. 6 indexed citations
7.
Howe, Jacob M. & Andy King. (2012). A pearl on SAT and SMT solving in Prolog. Theoretical Computer Science. 435. 43–55. 8 indexed citations
8.
Howe, Jacob M. & Andy King. (2011). A Pearl on SAT Solving in Prolog (extended abstract). City Research Online (City University London). 1 indexed citations
9.
Howe, Jacob M., et al.. (2010). Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science. 267(1). 89–100.
10.
Howe, Jacob M. & Andy King. (2009). Closure Algorithms for Domains with Two Variables Per Inequality. City Research Online (City University London). 1 indexed citations
11.
Simon, Axel, et al.. (2003). Two Variables per Linear Inequality as an Abstract Domain. 1 indexed citations
12.
Howe, Jacob M. & Andy King. (2003). Three optimisations for sharing. Theory and Practice of Logic Programming. 3(2). 243–257. 2 indexed citations
13.
Howe, Jacob M. & Andy King. (2002). Efficient groundness analysis in Prolog. Theory and Practice of Logic Programming. 3(1). 95–124. 5 indexed citations
14.
Howe, Jacob M.. (2001). Proof search in Lax Logic. Mathematical Structures in Computer Science. 11(4). 573–588. 1 indexed citations
15.
Genaim, Samir, Michael Codish, & Jacob M. Howe. (2001). Worst-case groundness analysis using definite Boolean functions. Theory and Practice of Logic Programming. 1(5). 611–615. 5 indexed citations
16.
Howe, Jacob M. & Andy King. (2000). Abstracting numeric constraints with Boolean functions. Information Processing Letters. 75(1-2). 17–23. 2 indexed citations
17.
Howe, Jacob M.. (1996). Theorem Proving and Partial Proof Search for Intuitionistic Propositional Logic Using a Permutation-free Calculus with Loop-Checking. Kent Academic Repository (University of Kent). 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

Breakdown of academic impact, for papers by Liana Hadarean Breakdown of academic impact, for papers by Mate Soos Breakdown of academic impact, for papers by Larissa Meinicke Breakdown of academic impact, for papers by Norbert Manthey Breakdown of academic impact, for papers by Julien Brunel Breakdown of academic impact, for papers by Joe Hurd Breakdown of academic impact, for papers by Fides Aarts Breakdown of academic impact, for papers by Vitaly Lagoon Breakdown of academic impact, for papers by Johannes Oetsch Breakdown of academic impact, for papers by David Nowak
Rankless by CCL
2026