Zhe Dang

994 total citations
48 papers, 311 citations indexed

About

Zhe Dang is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Zhe Dang has authored 48 papers receiving a total of 311 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 16 papers in Software. Recurrent topics in Zhe Dang's work include Formal Methods in Verification (21 papers), semigroups and automata theory (15 papers) and Software Testing and Debugging Techniques (12 papers). Zhe Dang is often cited by papers focused on Formal Methods in Verification (21 papers), semigroups and automata theory (15 papers) and Software Testing and Debugging Techniques (12 papers). Zhe Dang collaborates with scholars based in United States, China and Japan. Zhe Dang's co-authors include Óscar H. Ibarra, Richard A. Kemmerer, Ömer Eğecioǧlu, T.R. Fischer, Xiao Zheng, Kunjie Xu, Tevfik Bultan, Zhi Liu, Qin Li and Yan Gao and has published in prestigious journals such as IEEE/ACM Transactions on Networking, IEEE Transactions on Mobile Computing and Theoretical Computer Science.

In The Last Decade

Zhe Dang

46 papers receiving 290 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Zhe Dang United States	10	181	130	77	70	61	48	311
Stefano Crespi Reghizzi Italy	11	158 0.9×	195 1.5×	74 1.0×	63 0.9×	102 1.7×	52	361
Traian Florin Şerbănuţă United States	9	165 0.9×	283 2.2×	37 0.5×	121 1.7×	140 2.3×	24	432
Diletta Cacciagrano Italy	9	50 0.3×	80 0.6×	26 0.3×	98 1.4×	14 0.2×	41	211
Frank Markham Brown United States	6	193 1.1×	110 0.8×	27 0.4×	32 0.5×	23 0.4×	23	305
Samy Meftali France	12	46 0.3×	109 0.8×	43 0.6×	123 1.8×	59 1.0×	42	374
Bořivoj Melichar Czechia	6	56 0.3×	119 0.9×	21 0.3×	45 0.6×	17 0.3×	32	200
M. Serra Canada	10	149 0.8×	113 0.9×	61 0.8×	70 1.0×	7 0.1×	36	354
James F. Gimpel United States	9	107 0.6×	109 0.8×	10 0.1×	60 0.9×	29 0.5×	16	274
Norbert Blüm Germany	7	182 1.0×	145 1.1×	21 0.3×	98 1.4×	9 0.1×	22	301
F. C. Hennie United States	7	361 2.0×	220 1.7×	78 1.0×	38 0.5×	17 0.3×	7	453

Countries citing papers authored by Zhe Dang

Since Specialization

Citations

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

Fields of papers citing papers by Zhe Dang

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Zhe Dang

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

Ibarra, Óscar H., Zhe Dang, & Qin Li. (2018). Accepting runs in a two-way finite automaton. Information and Computation. 260. 1–8. 1 indexed citations

Dang, Zhe, et al.. (2017). Information rate of some classes of non-regular languages: An automata-theoretic approach. Information and Computation. 256. 45–61. 1 indexed citations

Li, Qin & Zhe Dang. (2015). Sampling automata and programs. Theoretical Computer Science. 577. 125–140. 12 indexed citations

Dang, Zhe, et al.. (2015). Execution information rate for some classes of automata. Information and Computation. 246. 20–29. 3 indexed citations

Dang, Zhe, et al.. (2013). Similarity in languages and programs. Theoretical Computer Science. 498. 58–75. 3 indexed citations

Ibarra, Óscar H. & Zhe Dang. (2006). Proceedings of the 10th international conference on Developments in Language Theory. 9 indexed citations

Ibarra, Óscar H., Sara Woodworth, Hsu‐Chun Yen, & Zhe Dang. (2006). On the Computational Power of 1-Deterministic and Sequential P Systems. Fundamenta Informaticae. 73(1). 133–152. 4 indexed citations

Ibarra, Óscar H. & Zhe Dang. (2006). On the solvability of a class of diophantine equations and applications. Theoretical Computer Science. 352(1-3). 342–346. 5 indexed citations

Dang, Zhe, Óscar H. Ibarra, & Jianwen Su. (2005). On composition and lookahead delegation of e-services modeled by automata. Theoretical Computer Science. 341(1-3). 344–363. 4 indexed citations

10.

Dang, Zhe & Óscar H. Ibarra. (2004). On P Systems Operating in Sequential Mode.. 164–177. 4 indexed citations

11.

Li, Cheng, et al.. (2004). Linear reachability problems and minimal solutions to linear Diophantine equation systems. Theoretical Computer Science. 328(1-2). 203–219. 2 indexed citations

12.

Dang, Zhe, Óscar H. Ibarra, & Zhi‐Wei Sun. (2004). On two-way nondeterministic finite automata with one reversal-bounded counter. Theoretical Computer Science. 330(1). 59–79. 3 indexed citations

13.

Ibarra, Óscar H., Zhe Dang, & Ömer Eğecioǧlu. (2003). Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science. 312(2-3). 379–399. 27 indexed citations

14.

Ibarra, Óscar H. & Zhe Dang. (2003). On two-way FA with monotonic counters and quadratic Diophantine equations. Theoretical Computer Science. 312(2-3). 359–378. 8 indexed citations

15.

Dang, Zhe. (2003). Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science. 302(1-3). 93–121. 22 indexed citations

16.

Ibarra, Óscar H., Zhe Dang, & Pierluigi San Pietro. (2003). Verification in loosely synchronous queue-connected discrete timed automata. Theoretical Computer Science. 290(3). 1713–1735. 2 indexed citations

17.

Dang, Zhe, Tevfik Bultan, Óscar H. Ibarra, & Richard A. Kemmerer. (2003). Past pushdown timed automata and safety verification. Theoretical Computer Science. 313(1). 57–71. 8 indexed citations

18.

Dang, Zhe, Pierluigi San Pietro, & Richard A. Kemmerer. (2003). Presburger liveness verification of discrete timed automata. Theoretical Computer Science. 299(1-3). 413–438. 8 indexed citations

19.

Ibarra, Óscar H., Jianwen Su, Zhe Dang, Tevfik Bultan, & Richard A. Kemmerer. (2002). Counter Machines and Verification Problems. Theoretical Computer Science. 289(1). 165–189. 18 indexed citations

20.

Dang, Zhe, Pierluigi San Pietro, & Richard A. Kemmerer. (2001). On Presburger liveness of discrete timed automata. Lecture notes in computer science. 132–143. 5 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