◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Pierre-Cyrille Héam

13 papers hereh-index 132k citations83 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author5
  • last author5

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • cs.CR4
  • cs.FL4
  • cs.SE2
  • cs.DC1
  • cs.DS1
  • cs.PF1

identity via Semantic Scholar / OpenAlex

activity
20112019
most citedA Comparison of Random Task Graph Generation Methods for Scheduling Problems

21 citations · 40 across the 12 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.FL2014

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard

P. -C Héam, V. Hugot, O. Kouchnarenko

The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.