Publications

Mémoires

• E. Thierry. Sur quelques interactions entre structures de données et algorithmes efficaces pour les ordres et les graphes. PhD Thesis, LIRMM, Université Montpellier 2, October 2001. Supervisors: Pr. Habib and Pr. Morvan. [french ps.gz]
  
  
• E. Thierry. Some posets on the plactic monoid. Master's Thesis, LIAFA, Université Paris 7, July 1996. Supervisors: Pr. Krob and Pr. Morvan. [french ps.gz]

Journaux internationaux

• L. Beaudou, K. Ghazi, G. Kahn, O. Raynaud and E. Thierry Encoding partial orders through modular decomposition. Journal of Computational Science, Vol. 25, p. 446-455, 2018.
  
  
• A. Bouillard and E. Thierry Tight performance bounds in the worst-case analysis of feed-forward networks. Discrete Event Dynamic Systems, Vol. 26, No. 3, p. 383-411, 2016. Extended version of the INFOCOM'2010 paper.
  
  
• C. Crespelle and E. Thierry Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time. Discrete Mathematics, Vol. 338, No. 12, p. 2393-2407, 2015.
  
  
• O. Simonin, F. Charpillet and E. Thierry. Revisiting wavefront construction with collective agents: an approach to foraging. Swarm Intelligence, Vol. 8, No. 2, p. 113-138, 2014.
  
  
• A. Lagoutte, M. Noual and E. Thierry. Flooding Games on Graphs. Discrete Applied Mathematics, Vol. 164, No. 2, p. 532-538, 2014. Extended version of the LAGOS'2011 paper.
  
  
• B. Gaujal, L. Gulyas, Y. Mansury and E. Thierry. Validating an agent-based model of the Zipf's law: a discrete Markov-chain approach. Journal of Economic Dynamics and Control, Vol. 41, p. 38-49, 2014.
  
  
• J.-B. Rouquier, D. Regnault and E. Thierry. Stochastic minority on graphs Theoretical Computer Science, Vol. 412, No. 30, p. 3947-3963, 2011.
  
  
• O. Raynaud and E. Thierry. The complexity of embedding orders into small products of chains. Order, Vol. 27, No. 3, p. 265-381, 2010.
  
  
• D. Regnault, N. Schabanel and E. Thierry. On the analysis of "simple" 2D stochastic cellular automata. Discrete Mathematics & Theoretical Computer Science Vol. 12, No. 2, p. 263-294, 2010. Extended version of the LATA'2008 paper.
  
  
• D. Regnault, N. Schabanel and E. Thierry. Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority. Theoretical Computer Science, Vol. 410, No. 47-49, p. 4844-4855, 2009. Extended version of the MFCS'2007 paper.
  
  
• A. Benoit, Y. Robert and E. Thierry. On the Complexity of Mapping Linear Chain Applications onto Heterogeneous Platforms. Parallel Processing Letters, Vol. 19, No. 3, p. 383-397, 2009.
  
  
• A. Bouillard, B. Gaujal, S. Lagrange and E. Thierry. Optimal routing for end-to-end guarantees using Network Calculus. Performance Evaluation, Vol. 65, No. 11-12, p. 883-906, 2008. [pdf | note]
  
  
• A. Bouillard and E. Thierry. An Algorithmic Toolbox for Network Calculus. Discrete Event Dynamic Systems, Vol. 18, No. 1, p. 3-49, 2008. [pdf | note]
  
  
• M. Morvan, E. Rémila and E. Thierry. A note on the structure of spaces of domino tilings. Discrete Mathematics, Vol. 307, No. 6, p. 769-773, 2007.
  
  
• N. Fatès, M. Morvan, N. Schabanel and E. Thierry. Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoretical Computer Science, Vol. 362, No. 1-3, p. 1-16, 2006. Extended version of the MFCS'2005 paper. [pdf.gz]
  
  
• O. Cogis and E. Thierry. Greedy algorithms for optimization on distance-hereditary graphs. RR. LIRMM-01049, 2001. [ps.gz | note]
  Short version in Discrete Optimization, Vol. 2, No. 2, p. 185-188, 2005. [ps.gz | note]
  
  
• M. Habib, L. Nourine, O. Raynaud and E. Thierry. Computational aspects of the 2-dimension of partially ordered sets. Theoretical Computer Science, Vol. 312, No. 2-3, p. 401-431, 2004. [ps.gz]
  
  
• P. Baldy, M. Morvan and E. Thierry. Extending a partially ordered set: links with its lattice of ideals. Order, Vol. 16, number 4, p. 305-312, 1999. [ps.gz | note]

Conférences internationales avec comité de lecture

• C. Crespelle, D. Lokshtanov, T. H. D. Phan and E. Thierry. Faster and Enhanced Inclusion-Minimal Cograph Completion. Proc. of COCOA'2017, 2017.
  
  
• C. Crespelle, E. Thierry and T. Lambert. A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product. Proc. of COCOON'2013, 2013.
  
  
• P. Arrighi, R. Fargetton, V. Nesme and E. Thierry. Applying Causality Principles to the Axiomatization of Probabilistic Cellular Automata. Proc. of CiE'2011, 2011.
  
  
• A. Lagoutte, M. Noual and E. Thierry. Flooding Games on Graphs. Proc. of LAGOS'2011, 2011.
  
  
• A. Bouillard, L. Jouhet and E. Thierry. Comparison of different classes of service curves in Network Calculus. Proc. of WODES'2010, 2010.
  
  
• A. Bouillard, L. Jouhet and E. Thierry. Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks. Proc. of INFOCOM'2010, 2010.
  
  
• A. Bouillard, L. Jouhet and E. Thierry. Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis. Proc. of Valuetools'2008, 2008.
  
  
• P. Colomb, O. Raynaud and E. Thierry. Generalized Polychotomic Encoding: a very short bit-vector encoding of tree hierarchies. Proc. of MCO'2008, 2008.
  
  
• D. Regnault, N. Schabanel and E. Thierry. On the analysis of "simple" 2D stochastic cellular automata. Proc. of LATA'2008, 2008.
  
  
• A. Bouillard, B. Gaujal, S. Lagrange and E. Thierry. Optimal routing for end-to-end guarantees: the price of multiplexing. Proc. of ValueTools'2007, 2007. [note]
  
  
• D. Regnault, N. Schabanel and E. Thierry. Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority. Proc. of MFCS'2007, LNCS 4708, p. 320-332, 2007.
  
  
• N. Fatès, D. Régnault, N. Schabanel and E. Thierry. Asynchronous behavior of double-quiescent elementary cellular automata. Proc. of LATIN'2006, LNCS 3887, p. 455-466, 2006. [pdf.gz]
  
  
• N. Fatès, M. Morvan, N. Schabanel and E. Thierry. Fully asynchronous behavior of double-quiescent elementary cellular automata. Proc. of MFCS'2005, LNCS 3618, p. 316-327, 2005. [pdf.gz]
  
  
• C. Chaudet, I. Guérin-Lassous, B. Gaujal and E. Thierry. Study of the impact of asymmetry and carrier sense mechanism in IEEE 802.11 multi-hops networks through a basic case. Proc. of PE-WASUN'2004, p. 1-7,2004. [pdf.gz]
  
  
• B. Gaujal and E. Thierry. Optimal frequency selection in circuit design for energy minimization. Proc. of RTCSA'2004, 2004. [ps.gz]
  
  
• H. D. Phan Ti and E. Thierry. Dynamics of the Picking transformation on integer partitions. Proc. of DMCS'2003, Discrete Mathematics and Theoretical Computer Science, p. 43-56, 2003. [ps.gz | note]
  
  
• O. Raynaud and E. Thierry. A quasi optimal bit-vector encoding of tree hierarchies. Application to efficient type inclusion tests. Proc. of ECOOP'2001, LNCS 2072, p. 165-180,2001. [ps.gz]
  
  
• J.-M. Lanlignel, O. Raynaud and E. Thierry. Pruning graphs with digital search trees. Application to distance-hereditary graphs Proc. of STACS'2000, LNCS 1770, p. 529-541, 2000. [ps.gz]
  
  
• I. Guérin-Lassous and E. Thierry. Generating random permutations in the framework of parallel coarse grained models. Proc. of OPODIS'2000, Studia Informatica Universalis, vol. 2, p. 1-16, 2000. [ps.gz | note]

Rapports de recherche

• L. Nourine and E. Thierry. A new proof for a decreasing dimension theorem. RR. LIRMM, 2001. [ps.gz]
  
  
• N. Caspard, M. Morvan, E. Remila and E. Thierry. Lattices of tilings and stability. RR. LIP-2003-25, 2003. Soumis à Discrete Mathematics. [ps.gz]
  
  
• E. Thierry. A new bound on the 2-dimension of partially ordered sets. RR. LIP-2003-47, 2003. [ps.gz]
  
  
• A. Bouillard and E. Thierry. Some examples and counterexamples for (min,+) filtering operations. RR. INRIA-6095, 2007.
  
  
• D. Regnault, N. Schabanel and E. Thierry. A study of stochastic 2D Minority CA: would wearing stripes a fatality for snob people ? RR. LIP-2007-16, 2007.
  
  
• A. Bouillard, L. Jouhet and E. Thierry. End-to-end performance guarantees for multipath flows. RR HAL-00289106, 2008.
  
  
• A. Bouillard, L. Jouhet and E. Thierry. Service curves in Network Calculus: dos and don'ts. RR INRIA-00431674, 2009.

Présentations et posters

• M. Boyer, N. Navet, X. Olive, E. Thierry. The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus. Proc. of ISoLA 2010, Part I, LNCS 6415, p. 122136, 2010.
  
  
• A. Bouillard, B. Cottenceau, B. Gaujal, L. Hardouin, S. Lagrange, M. Lhommeau and E. Thierry. COINC Library : A Toolbox for Network Calculus. Invited paper, ValueTools'2009, Pise, 2009. Abstract [pdf].
  
  
• B. Gaujal, G. Huard, J. Pecero, E. Thierry and D. Trystram. Convex Scheduling for Grid Computing. WASC, 1st Workshop on Algorithms for Scheduling and Communication, Bertinoro, Italie, 2004. Invited talk [pdf] and some proofs [ps].
  
  
• P. Baldy, M. Morvan and E. Thierry. Extending a partially ordered set: links with its lattice of ideals. Short version of the article of Order, accepted as poster at FPSAC'2000, Moscow, 2000. [ps]
  
  
• B. Bretelle, I. Guérin-Lassous and E. Thierry. Analyse d'un algorithme de calcul des composantes connexes d'un graphe dans le modèle CGM. Short communication at the french-speaking Rencontres du Parallélisme RenPar'9, Lausanne, 1997.