P.-C H\'eam (INRIA Nancy - Grand Est / LORIA / LIFC

Identifiers

• name variant P.-C H\'eam (INRIA Nancy - Grand Est / LORIA / LIFC 0.60 · backfill

Papers (1)

1. The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard cs.FL · 2014 · author #1

Mentions

• 1412.0839 #1 · backfill · confidence 0.70 P.-C H\'eam (INRIA Nancy - Grand Est / LORIA / LIFC

Frequent Coauthors

• FEMTO-ST) 1 shared papers
• INRIA Nancy - Grand Est / LORIA / LIFC) 1 shared papers
• LIFL) 1 shared papers
• O. Kouchnarenko (FEMTO-ST 1 shared papers
• V. Hugot (INRIA Lille - Nord Europe 1 shared papers