Multivariate polynomial factoring and detection of true factors. - Denis Lugiez (AAECC, 1984)

A New Lifting Process for the Multivariate Polynomial Factorization. - Denis Lugiez (EUROSAM, 1984)

Algorithmes de factorisation de polynômes. (Algorithms for factoring polynomials). - Denis Lugiez (1984)

Heuristic Bivariate Lifting. - Denis Lugiez (AAECC, 1985)

Type Inference Using Unification in Computer Algebra. - Jacques Calmet; Hubert Comon; Denis Lugiez (AAECC, 1986)

A knowledge-based system for computer algebra. - Jacques Calmet; Denis Lugiez (SIGSAM Bull., 1987)

A Deduction Procedure for First Order Programs. - Denis Lugiez (ICLP, 1989)

A Solution of the Complement Problem in Associative-Commutative Theories. - Emmanuel Kounalis; Denis Lugiez; Loic Pottier (MFCS, 1991)

Compilation of Pattern Matching with Associative-Commutative Functions. - Emmanuel Kounalis; Denis Lugiez (TAPSOFT, Vol.1, 1991)

A Rewrite-Based Type Discipline for a Subset of Computer Algebra. - Hubert Comon; Denis Lugiez; Philippe Schnoebelen (J. Symb. Comput., 1991)

Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). - Denis Lugiez; J. L. Moysset (STACS, 1993)

Higher Order Disunification: Some decidable cases. - Denis Lugiez (CCL, 1994)

Tree Automata Help One To Solve Equational Formulae In AC-Theories. - Denis Lugiez; J. L. Moysset (J. Symb. Comput., 1994)

Undecidability of second-order complement problems. - Denis Lugiez (UNIF, 1995)

Positive and Negative Results for Higher-Order Disunification. - Denis Lugiez (J. Symb. Comput., 1995)

Set Operations for Recurrent Term Schematizations. - Ali Amaniss; Miki Hermann; Denis Lugiez (TAPSOFT, 1997)

A Good Class of Tree Automata and Application to Inductive Theorem Proving. - Denis Lugiez (ICALP, 1998)

On the Reachability Problem in Cryptographic Protocols. - Roberto M. Amadio; Denis Lugiez (CONCUR, 2000)

Local First Search - A New Paradigm for Partial Order Reductions. - Peter Niebert; Michaela Huhn; Sarah Zennou; Denis Lugiez (CONCUR, 2001)

Algorithms and Reductions for Rewriting Problems. - Rakesh M. Verma; Michaël Rusinowitch; Denis Lugiez (Fundam. Informaticae, 2001)

Dynamic Bounds and Transition Merging for Local First Search. - Denis Lugiez; Peter Niebert; Sarah Zennou (SPIN, 2002)

The regular viewpoint on PA-processes. - Denis Lugiez; Philippe Schnoebelen (Theor. Comput. Sci., 2002)

Counting and Equality Constraints for Multitree Automata. - Denis Lugiez (FoSSaCS, 2003)

XML Schema, Tree Logic and Sheaves Automata. - Silvano Dal-Zilio; Denis Lugiez (RTA, 2003)

On the symbolic reduction of processes with cryptographic functions. - Roberto M. Amadio; Denis Lugiez; Vincent Vanackère (Theor. Comput. Sci., 2003)

A logic you can count on. - Silvano Dal-Zilio; Denis Lugiez; Charles Meyssonnier (POPL, 2004)

From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P). - Denis Lugiez (CIAA, 2004)

Intruder Deduction for AC-Like Equational Theories with Homomorphisms. - Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (RTA, 2005)

Decidable first-order transition logics for PA-processes. - Denis Lugiez; Philippe Schnoebelen (Inf. Comput., 2005)

Multitree automata that count. - Denis Lugiez (Theor. Comput. Sci., 2005)

A partial order semantics approach to the clock explosion problem of timed automata. - Denis Lugiez; Peter Niebert; Sarah Zennou (Theor. Comput. Sci., 2005)

Presburger Modal Logic Is PSPACE-Complete. - Stéphane Demri; Denis Lugiez (IJCAR, 2006)

Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. - Stéphanie Delaune; Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (ICALP (2), 2006)

Towards an Automatic Analysis of Web Service Security. - Yannick Chevalier; Denis Lugiez; Michaël Rusinowitch (FroCoS, 2007)

Verifying Cryptographic Protocols with Subterms Constraints. - Yannick Chevalier; Denis Lugiez; Michaël Rusinowitch (LPAR, 2007)

Intruder deduction for the equational theory of Abelian groups with distributive encryption. - Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (Inf. Comput., 2007)

Symbolic protocol analysis for monoidal equational theories. - Stéphanie Delaune; Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (Inf. Comput., 2008)

Collaborative peer to peer edition: Avoiding conflicts is better than solving conflicts. - Stéphane Martin; Denis Lugiez (IADIS AC (2), 2009)

Peer to Peer Optimistic Collaborative Editing on XML-like trees - Denis Lugiez; Stéphane Martin (CoRR, 2009)

Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts - Stéphane Martin; Denis Lugiez (CoRR, 2009)

Fixing Collaborative Edition on Typed Documents. - Stéphane Martin; Denis Lugiez (CDVE, 2010)

Complexity of modal logics with Presburger constraints. - Stéphane Demri; Denis Lugiez (J. Appl. Log., 2010)

Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order. - Denis Lugiez (Int. J. Found. Comput. Sci., 2011)

On Symbolic Heaps Modulo Permission Theories. - Stéphane Demri; Étienne Lozes; Denis Lugiez (FSTTCS, 2017)