### 8 papers:

- LICS-2015-HeH #branch #similarity
- Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (CH, MH), pp. 180–191.
- LICS-2012-CreusGGR #problem
- The HOM Problem is EXPTIME-Complete (CC, AG, GG, LR), pp. 255–264.
- CSL-2009-CirsteaKP #algebra #calculus #μ-calculus
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (CC, CK, DP), pp. 179–193.
- ICALP-B-2008-Schewe #satisfiability
- ATL* Satisfiability Is 2EXPTIME-Complete (SS), pp. 373–385.
- ICFP-2008-HornM
- Deciding
*k*CFA is complete for EXPTIME (DVH, HGM), pp. 275–282.
- FoSSaCS-2003-Kieronski #transitive
- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard (EK), pp. 299–312.
- LICS-1997-ComonJ
- Ground Reducibility is EXPTIME-Complete (HC, FJ), pp. 26–34.
- STOC-1983-HartmanisSI #set
- Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.