Demo Data from VLDB 2026 / reviewers in the wild / expert
Chaodong He
dblp:16/8737
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Logic in computer science · 71% Computational complexity · 19% Automata and formal languages · 11% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › process algebra
branching bisimilarity |
0.4 | 2 | 2015 | Branching Bisimilarity on Normed BPA Is EXPTIME-Complete · LICS 2015 Branching Bisimilarity Checking for PRS · ICALP (2) 2014 |
Logic in computer science
process algebra |
0.4 | 2 | 2015 | Branching Bisimilarity on Normed BPA Is EXPTIME-Complete · LICS 2015 Branching Bisimilarity Checking for PRS · ICALP (2) 2014 |
Computational complexity › complexity classes › EXPTIME
EXPTIME-completeness |
0.2 | 1 | 2015 | Branching Bisimilarity on Normed BPA Is EXPTIME-Complete · LICS 2015 |
Automata and formal languages › infinite-state systems
process rewrite systems |
0.1 | 1 | 2014 | Branching Bisimilarity Checking for PRS · ICALP (2) 2014 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Branching Bisimilarity on Normed BPA Is EXPTIME-CompleteabstractWe put forward an exponential-time algorithm for deciding branching bisimilarity on nor med BPA (Bacis Process Algebra) systems. The decidability of branching bisimilarity on nor med BPA was once a long-standing open problem which was closed by Yuxi Fu. The EXPTIME-hardness is an inference of a slight modification of the reduction presented by Richard Mayr. The result in this paper claims that this problem is EXPTIME-complete. Chaodong He, Mingzhang Huang |
LICS | 1 |
| 2014 | Branching Bisimilarity Checking for PRS
Qiang Yin 0002, Yuxi Fu, Chaodong He, Mingzhang Huang, Xiuting Tao |
ICALP (2) | 3 |
| 2011 | The Decidability of the Reachability Problem for CCS!
Chaodong He |
CONCUR | 1 |
| 2010 | Model Independent Order Relations for Processes
Chaodong He |
APLAS | 1 |