Hing Leung
Impact in
-
- semigroups and automata theory
- Formal Methods in Verification
- Advanced Algebra and Logic
- Computability, Logic, AI Algorithms
- Artificial Intelligence top 10%
- Machine Learning and Algorithms
- Logic, programming, and type systems
- Algorithms and Data Compression
Papers in
-
- semigroups and automata theory 16
- Computability, Logic, AI Algorithms 3
- Advanced Algebra and Logic 2
-
- Machine Learning and Algorithms 10
- Algorithms and Data Compression 5
- Co-authors
- Detlef Wotschke (5 shared papers)Jonathan Goldstine (4 shared papers)Andreas Malcher (2 shared papers)Martin Kappes (2 shared papers)Chandra M. R. Kintala (1 shared paper)Viktor A. Podolskiy (2 shared papers)Jérémie Chalopin (1 shared paper)A. A. Harms (1 shared paper)
- Journals
- Theoretical Computer Science (4 papers)Journal of Computer and System Sciences (2 papers)Kerntechnik (1 paper)SIAM Journal on Computing (1 paper)Semigroup Forum (1 paper)
- Partner nations
- United StatesGermanyFrance
In The Last Decade
Hing Leung
18 papers receiving 212 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 220
- Artificial Intelligence 186
- Molecular Biology 105
- Algebra and Number Theory 5
- Geometry and Topology 7
Countries citing papers authored by Hing Leung
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
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-authors
The 8 scholars most cited alongside Hing Leung, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 47 | |
| 2 | 1998 | 28 | |
| 3 | 1991 | 20 | |
| 4 | 1992 | 20 | |
| 5 | 2005 | 18 | |
| 6 | 1988 | 17 | |
| 7 | An algebraic method for solving decision problems in finite automata theory | 1987 | 16 |
| 8 | 2003 | 12 | |
| 9 | 2001 | 10 | |
| 10 | 2005 | 8 | |
| 11 | 2003 | 8 | |
| 12 | 1998 | 8 | |
| 13 | 2020 | 6 | |
| 14 | 2000 | 5 | |
| 15 | The Limitedness Problem on Distance Automata. | 2001 | 1 |
| 16 | 1992 | 1 | |
| 17 | 1987 | 1 | |
| 18 | New ideas in teaching the multiplication table in primary Mathematics education | 2001 | 1 |
| 19 | 2009 | 0 |
About Hing Leung
Hing Leung is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology, Computer Networks and Communications and Astronomy and Astrophysics, having authored 19 papers that have together received 227 indexed citations. Recurring topics across this work include semigroups and automata theory (16 papers), Machine Learning and Algorithms (10 papers), DNA and Biological Computing (6 papers), Algorithms and Data Compression (5 papers), Computability, Logic, AI Algorithms (3 papers), Advanced Algebra and Logic (2 papers), Mathematical Dynamics and Fractals (1 paper) and Optimization and Search Problems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (220 citations), Artificial Intelligence (186 citations), Molecular Biology (105 citations), Algebra and Number Theory (5 citations) and Geometry and Topology (7 citations). Hing Leung has collaborated with scholars based in United States, Germany and France. Frequent co-authors include Detlef Wotschke, Jonathan Goldstine, Andreas Malcher, Martin Kappes, Chandra M. R. Kintala, Viktor A. Podolskiy, Jérémie Chalopin and A. A. Harms. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences, Kerntechnik, SIAM Journal on Computing and Semigroup Forum.
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.