Anthony W. Lin

833 total citations
22 papers, 213 citations indexed

About

Anthony W. Lin is a scholar working on Artificial Intelligence, Information Systems and Computational Theory and Mathematics. According to data from OpenAlex, Anthony W. Lin has authored 22 papers receiving a total of 213 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Artificial Intelligence, 11 papers in Information Systems and 10 papers in Computational Theory and Mathematics. Recurrent topics in Anthony W. Lin's work include Web Application Security Vulnerabilities (10 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (8 papers). Anthony W. Lin is often cited by papers focused on Web Application Security Vulnerabilities (10 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (8 papers). Anthony W. Lin collaborates with scholars based in United Kingdom, Germany and Singapore. Anthony W. Lin's co-authors include Pablo Barceló, Peter T. Wood, Leonid Libkin, Matthew Hague, Philipp Rümmer, Taolue Chen, Zhilin Wu, Petr Janků, Tomáš Vojnar and Lukáš Holík and has published in prestigious journals such as IEEE Transactions on Software Engineering, Theoretical Computer Science and ACM Transactions on Database Systems.

In The Last Decade

Anthony W. Lin

19 papers receiving 206 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Anthony W. Lin United Kingdom 8 133 110 95 53 51 22 213
Brink van der Merwe South Africa 8 79 0.6× 74 0.7× 94 1.0× 28 0.5× 31 0.6× 29 202
Tomáš Kočiský United Kingdom 3 202 1.5× 107 1.0× 50 0.5× 43 0.8× 9 0.2× 4 276
Jared Roesch United States 6 77 0.6× 62 0.6× 87 0.9× 39 0.7× 26 0.5× 13 175
David Rydeheard United Kingdom 6 141 1.1× 50 0.5× 58 0.6× 51 1.0× 90 1.8× 21 213
Olivier Ridoux France 7 97 0.7× 68 0.6× 29 0.3× 46 0.9× 66 1.3× 32 169
Soichiro Hidaka Japan 9 168 1.3× 153 1.4× 164 1.7× 103 1.9× 18 0.4× 33 273
Navid Yaghmazadeh United States 5 146 1.1× 145 1.3× 51 0.5× 74 1.4× 8 0.2× 5 245
Lunjin Lu United States 8 153 1.2× 139 1.3× 66 0.7× 56 1.1× 35 0.7× 40 227
Pierre‐Cyrille Héam France 7 67 0.5× 44 0.4× 39 0.4× 45 0.8× 65 1.3× 37 139
Gábor Szárnyas Hungary 8 76 0.6× 48 0.4× 44 0.5× 91 1.7× 7 0.1× 20 164

Countries citing papers authored by Anthony W. Lin

Since Specialization
Citations

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

Fields of papers citing papers by Anthony W. Lin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Anthony W. Lin

This figure shows the co-authorship network connecting the top 25 collaborators of Anthony W. Lin. A scholar is included among the top collaborators of Anthony W. Lin 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 Anthony W. Lin. Anthony W. Lin 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.
Lin, Anthony W., et al.. (2025). Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification. IEEE Transactions on Software Engineering. 51(6). 1801–1817.
2.
Hague, Matthew, Artur Jeż, & Anthony W. Lin. (2024). Parikh’s Theorem Made Symbolic. Proceedings of the ACM on Programming Languages. 8(POPL). 1945–1977.
3.
Lin, Anthony W., et al.. (2024). Ramsey Quantifiers in Linear Arithmetics. Proceedings of the ACM on Programming Languages. 8(POPL). 1–32.
4.
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
5.
Lin, Anthony W., et al.. (2022). Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. 1–14. 3 indexed citations
6.
Chen, Taolue, Matthew Hague, Anthony W. Lin, Philipp Rümmer, & Zhilin Wu. (2019). Decision procedures for path feasibility of string-manipulating programs with complex operations. Proceedings of the ACM on Programming Languages. 3(POPL). 1–30. 26 indexed citations
7.
Hague, Matthew & Anthony W. Lin. (2018). Decidable models of integer-manipulating programs with recursive parallelism. Theoretical Computer Science. 750. 24–37. 3 indexed citations
8.
Chen, Yu‐Fang, et al.. (2017). Learning to prove safety over parameterised concurrent systems. KTH Publication Database DiVA (KTH Royal Institute of Technology). 76–83. 7 indexed citations
9.
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
10.
Holík, Lukáš, Petr Janků, Anthony W. Lin, Philipp Rümmer, & Tomáš Vojnar. (2017). String constraints with concatenation and transducers solved efficiently. Proceedings of the ACM on Programming Languages. 2(POPL). 1–32. 24 indexed citations
11.
Lin, Anthony W. & Pablo Barceló. (2016). String solving with word equations and transducers: towards a logic for analysing mutation XSS. ACM SIGPLAN Notices. 51(1). 123–136. 2 indexed citations
12.
Lin, Anthony W. & Pablo Barceló. (2016). String solving with word equations and transducers: towards a logic for analysing mutation XSS. Universidad de Chile. 123–136. 22 indexed citations
13.
Barceló, Pablo, Gaëlle Fontaine, & Anthony W. Lin. (2015). Expressive Path Queries on Graph with Data. Logical Methods in Computer Science. Volume 11, Issue 4. 4 indexed citations
14.
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
15.
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
16.
Göller, Stefan & Anthony W. Lin. (2014). Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. ACM Transactions on Computational Logic. 15(4). 1–28. 2 indexed citations
17.
Göller, Stefan & Anthony W. Lin. (2012). Concurrency Makes Simple Theories Hard. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
18.
Barceló, Pablo, Leonid Libkin, Anthony W. Lin, & Peter T. Wood. (2012). Expressive Languages for Path Queries over Graph-Structured Data. ACM Transactions on Database Systems. 37(4). 1–46. 70 indexed citations
19.
Lin, Anthony W.. (2012). Accelerating tree-automatic relations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 313–324. 3 indexed citations
20.
Göller, Stefan & Anthony W. Lin. (2011). The Complexity of Verifying Ground Tree Rewrite Systems. 78. 279–288. 2 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