Matthew Hague

830 total citations
24 papers, 186 citations indexed

About

Matthew Hague is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Matthew Hague has authored 24 papers receiving a total of 186 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 10 papers in Software. Recurrent topics in Matthew Hague's work include Formal Methods in Verification (14 papers), Logic, programming, and type systems (13 papers) and Software Testing and Debugging Techniques (9 papers). Matthew Hague is often cited by papers focused on Formal Methods in Verification (14 papers), Logic, programming, and type systems (13 papers) and Software Testing and Debugging Techniques (9 papers). Matthew Hague collaborates with scholars based in United Kingdom, France and Germany. Matthew Hague's co-authors include C.-H. Luke Ong, Olivier Serre, Andrzej S. Murawski, Anthony W. Lin, Taolue Chen, Zhilin Wu, Philipp Rümmer, Arnaud Carayol, Yan Chen and Igor Potapov and has published in prestigious journals such as Theoretical Computer Science, ACM SIGPLAN Notices and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Matthew Hague

21 papers receiving 178 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Matthew Hague United Kingdom	7	134	113	68	58	15	24	186
Włodzimierz Drabent Sweden	11	195 1.5×	134 1.2×	41 0.6×	46 0.8×	26 1.7×	28	222
Cristinel Mateis Austria	8	173 1.3×	52 0.5×	82 1.2×	55 0.9×	52 3.5×	22	252
Prasanna Thati United States	5	118 0.9×	118 1.0×	46 0.7×	21 0.4×	40 2.7×	6	174
Christoph Matheja Germany	8	149 1.1×	116 1.0×	53 0.8×	18 0.3×	24 1.6×	12	185
Demis Ballis Spain	8	100 0.7×	31 0.3×	53 0.8×	86 1.5×	34 2.3×	34	141
Miguel Palomino Spain	7	156 1.2×	136 1.2×	51 0.8×	24 0.4×	33 2.2×	30	199
Harald Raffelt Germany	6	132 1.0×	64 0.6×	138 2.0×	69 1.2×	39 2.6×	8	192
Lukáš Holík Czechia	9	80 0.6×	41 0.4×	58 0.9×	65 1.1×	36 2.4×	26	136
Temur Kutsia Austria	7	175 1.3×	105 0.9×	27 0.4×	19 0.3×	47 3.1×	53	205
Wim Vanhoof Belgium	7	54 0.4×	45 0.4×	37 0.5×	23 0.4×	13 0.9×	20	108

Countries citing papers authored by Matthew Hague

Since Specialization

Citations

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

Fields of papers citing papers by Matthew Hague

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Matthew Hague

This figure shows the co-authorship network connecting the top 25 collaborators of Matthew Hague. A scholar is included among the top collaborators of Matthew Hague 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 Matthew Hague. Matthew Hague 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.

Hague, Matthew, Artur Jeż, & Anthony W. Lin. (2024). Parikh’s Theorem Made Symbolic. Proceedings of the ACM on Programming Languages. 8(POPL). 1945–1977.

2.

Chen, Taolue, et al.. (2022). Solving string constraints with Regex-dependent functions through transducers with priorities and variables. Proceedings of the ACM on Programming Languages. 6(POPL). 1–31. 11 indexed citations

3.

Hague, Matthew. (2019). Strings at MOSCA. 6(4). 4–22. 2 indexed citations

4.

Hague, Matthew & Anthony W. Lin. (2018). Decidable models of integer-manipulating programs with recursive parallelism. Theoretical Computer Science. 750. 24–37. 3 indexed citations

5.

Carayol, Arnaud & Matthew Hague. (2018). Optimal Strategies in Pushdown Reachability Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

6.

Hague, Matthew, Andrzej S. Murawski, C.-H. Luke Ong, & Olivier Serre. (2017). Collapsible Pushdown Automata and Recursion Schemes. ACM Transactions on Computational Logic. 18(3). 1–42. 2 indexed citations

7.

Potapov, Igor, et al.. (2017). Reachability Problems. Lecture notes in computer science. 1 indexed citations

8.

Chen, Taolue, Yan Chen, Matthew Hague, Anthony W. Lin, & Zhilin Wu. (2017). What is decidable about string constraints with the ReplaceAll function. Proceedings of the ACM on Programming Languages. 2(POPL). 1–29. 16 indexed citations

9.

Hague, Matthew, et al.. (2016). Unboundedness and downward closures of higher-order pushdown automata. 151–163. 13 indexed citations

10.

Hague, Matthew, et al.. (2016). Unboundedness and downward closures of higher-order pushdown automata. ACM SIGPLAN Notices. 51(1). 151–163. 1 indexed citations

11.

Hague, Matthew, Anthony W. Lin, & C.-H. Luke Ong. (2015). Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach. 1–19. 7 indexed citations

12.

Hague, Matthew, Anthony W. Lin, & C.-H. Luke Ong. (2015). Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach. ACM SIGPLAN Notices. 50(10). 1–19. 3 indexed citations

13.

Hague, Matthew. (2014). Senescent ground tree rewrite systems. 1–10. 5 indexed citations

14.

Hague, Matthew, et al.. (2013). C-SHORe: A collapsible approach to verifying higher-order programs. 13–24. 5 indexed citations

15.

Carayol, Arnaud, et al.. (2013). C-SHORe. ACM SIGPLAN Notices. 48(9). 13–24.

16.

Hague, Matthew. (2013). Saturation of Concurrent Collapsible Pushdown Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 325. 3 indexed citations

17.

Hague, Matthew & C.-H. Luke Ong. (2010). A saturation method for the modal μ-calculus over pushdown systems. Information and Computation. 209(5). 799–821. 4 indexed citations

18.

Hague, Matthew, et al.. (2010). The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 228–239. 3 indexed citations

19.

Carayol, Arnaud, et al.. (2008). Winning Regions of Higher-Order Pushdown Games. 2215. 193–204. 11 indexed citations

20.

Hague, Matthew. (2004). Static Checkers for Tree Structures and Heaps. 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