Hing Leung

563 total citations
19 papers, 227 citations indexed

About

Hing Leung is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Hing Leung has authored 19 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 7 papers in Molecular Biology. Recurrent topics in Hing Leung's work include semigroups and automata theory (16 papers), Machine Learning and Algorithms (10 papers) and DNA and Biological Computing (6 papers). Hing Leung is often cited by papers focused on semigroups and automata theory (16 papers), Machine Learning and Algorithms (10 papers) and DNA and Biological Computing (6 papers). Hing Leung collaborates with scholars based in United States, Germany and France. Hing Leung's co-authors include Detlef Wotschke, Jonathan Goldstine, Martin Kappes, Andreas Malcher, Chandra M. R. Kintala, Viktor A. Podolskiy, Jérémie Chalopin and A. A. Harms and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Hing Leung

18 papers receiving 212 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Hing Leung United States 9 220 186 105 9 7 19 227
Symeon Bozapalidis Greece 12 268 1.2× 217 1.2× 39 0.4× 6 0.7× 7 1.0× 31 291
Detlef Wotschke United States 8 221 1.0× 188 1.0× 119 1.1× 12 1.3× 1 0.1× 20 240
Carlo Mereghetti Italy 12 335 1.5× 300 1.6× 155 1.5× 9 1.0× 3 0.4× 47 367
JEFFREY SHALLIT Canada 7 182 0.8× 131 0.7× 67 0.6× 2 0.2× 6 0.9× 13 189
Arturo Carpi Italy 11 287 1.3× 223 1.2× 105 1.0× 2 0.2× 13 1.9× 45 300
Sylvain Lombardy France 8 130 0.6× 100 0.5× 24 0.2× 8 0.9× 10 1.4× 14 141
Narad Rampersad Canada 10 297 1.4× 229 1.2× 87 0.8× 3 0.3× 13 1.9× 63 315
Radu Mardare Denmark 8 139 0.6× 137 0.7× 30 0.3× 12 1.3× 11 1.6× 56 195
Géraud Sénizergues France 10 259 1.2× 204 1.1× 64 0.6× 9 1.0× 44 6.3× 26 300
F. Blanchet-Sadri United States 13 470 2.1× 378 2.0× 225 2.1× 6 0.7× 53 7.6× 78 484

Countries citing papers authored by Hing Leung

Since Specialization
Citations

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

Fields of papers citing papers by Hing Leung

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hing Leung

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

All Works

19 of 19 papers shown
1.
Malcher, Andreas, et al.. (2020). Descriptional Complexity of Machines with Limited Resources. TUGraz OPEN Library (Graz University of Technology). 6 indexed citations
2.
Leung, Hing. (2009). A Technique for Proving Lower Bounds on the Size of Sweeping Automata. Justus-Liebig-Universität Gießen.
3.
Goldstine, Jonathan, Hing Leung, & Detlef Wotschke. (2005). Measuring nondeterminism in pushdown automata. Journal of Computer and System Sciences. 71(4). 440–466. 8 indexed citations
4.
Leung, Hing. (2005). DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY. International Journal of Foundations of Computer Science. 16(5). 975–984. 18 indexed citations
5.
Leung, Hing & Viktor A. Podolskiy. (2003). The limitedness problem on distance automata: Hashiguchi's method revisited. Theoretical Computer Science. 310(1-3). 147–158. 12 indexed citations
6.
Chalopin, Jérémie & Hing Leung. (2003). On factorization forests of finite height. Theoretical Computer Science. 310(1-3). 489–499. 8 indexed citations
7.
Goldstine, Jonathan, Martin Kappes, Chandra M. R. Kintala, et al.. (2002). Descriptional Complexity of Machines with Limited Resources.. JUCS - Journal of Universal Computer Science. 8. 193–234. 47 indexed citations
8.
Leung, Hing & Viktor A. Podolskiy. (2001). The Limitedness Problem on Distance Automata.. 115–121. 1 indexed citations
9.
Leung, Hing. (2001). Tight Lower Bounds on the Size of Sweeping Automata. Journal of Computer and System Sciences. 63(3). 384–393. 10 indexed citations
10.
Leung, Hing, et al.. (2001). New ideas in teaching the multiplication table in primary Mathematics education. 1 indexed citations
11.
Leung, Hing & Detlef Wotschke. (2000). On the size of parsers and LR(k)-grammars. Theoretical Computer Science. 242(1-2). 59–69. 5 indexed citations
12.
Leung, Hing. (1998). On finite automata with limited nondeterminism. Acta Informatica. 35(7). 595–624. 8 indexed citations
13.
Leung, Hing. (1998). Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. SIAM Journal on Computing. 27(4). 1073–1082. 28 indexed citations
14.
Leung, Hing. (1992). A note on finitely ambiguous distance automata. Information Processing Letters. 44(6). 329–331. 1 indexed citations
15.
Goldstine, Jonathan, Hing Leung, & Detlef Wotschke. (1992). On the relation between ambiguity and nondeterminism in finite automata. Information and Computation. 100(2). 261–270. 20 indexed citations
16.
Leung, Hing. (1991). Limitedness theorem on finite automata with distance functions: an algebraic proof. Theoretical Computer Science. 81(1). 137–145. 20 indexed citations
17.
Leung, Hing. (1988). On the topological structure of a finitely generated semigroup of matrices. Semigroup Forum. 37(1). 273–287. 17 indexed citations
18.
Leung, Hing & A. A. Harms. (1987). Graph-theoretical basis of reactor point-kinetics / Graphentheoretische Grundlegung einer Reaktor-Punktkinetik. Kerntechnik. 51(3). 181–185. 1 indexed citations
19.
Leung, Hing. (1987). An algebraic method for solving decision problems in finite automata theory. 16 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 Symeon Bozapalidis Breakdown of academic impact, for papers by Detlef Wotschke Breakdown of academic impact, for papers by Carlo Mereghetti Breakdown of academic impact, for papers by JEFFREY SHALLIT Breakdown of academic impact, for papers by Arturo Carpi Breakdown of academic impact, for papers by Sylvain Lombardy Breakdown of academic impact, for papers by Narad Rampersad Breakdown of academic impact, for papers by Radu Mardare Breakdown of academic impact, for papers by Géraud Sénizergues Breakdown of academic impact, for papers by F. Blanchet-Sadri
Rankless by CCL
2026