Travelled to:1 × Croatia
1 × Japan
1 × USA
1 × United Kingdom
2 × Austria
Collaborated with:G.Godoy A.Gascón P.Fernández L.Ramos F.Massanes A.Tiwari L.Barguñó F.Jacquemard C.Vacher
Talks about:problem (3) constraint (2) automata (2) context (2) complet (2) between (2) automat (2) evalu (2) tree (2) compress (1)
Person: Carles Creus
DBLP: Creus:Carles
Contributed to:
2014
2014
2012201220102009Wrote 7 papers:
- RTA-TLCA-2014-CreusG #automation #context-free grammar #evaluation
- Automatic Evaluation of Context-Free Grammars (CC, GG), pp. 139–148.
- RTA-TLCA-2014-CreusG14a #automaton #constraints
- Tree Automata with Height Constraints between Brothers (CC, GG), pp. 149–163.
- SAT-2014-CreusFG #automation #evaluation #problem #reduction
- Automatic Evaluation of Reductions between NP-Complete Problems (CC, PF, GG), pp. 415–421.
- LICS-2012-CreusGGR #problem
- The HOM Problem is EXPTIME-Complete (CC, AG, GG, LR), pp. 255–264.
- RTA-2012-CreusGG #unification
- One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.
- LICS-2010-BargunoCGJV #automaton #constraints #problem
- The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
- LICS-2009-CreusGMT #normalisation #term rewriting
- Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.