Equivalence dans l'algèbre ds schémas de programmes. - Irène Guessarian (Symposium on Programming, 1974)

Semantic Equivalence of Program Schemes and its Syntactic Characterization. - Irène Guessarian (ICALP, 1976)

Tests et leur Caractérisation Syntaxique. - Irène Guessarian (RAIRO Theor. Informatics Appl., 1977)

Some Applications of Algebraic Semantics. - Irène Guessarian (MFCS, 1978)

A propos de la sémantique de l'appel par valeur selon A. Arnold. - Irène Guessarian (RAIRO Theor. Informatics Appl., 1978)

On Some Classes of Interpretations. - Bruno Courcelle; Irène Guessarian (J. Comput. Syst. Sci., 1978)

On Continuous Completions. - Irène Guessarian (Theoretical Computer Science, 1979)

Program Transformations and Algebraic Semantics. - Irène Guessarian (Theor. Comput. Sci., 1979)

About Program Termination and Simplification. - F. Ermine; Irène Guessarian (Symposium on Programming, 1980)

Algebraic Semantics - Irène Guessarian (Springer, 1981)

Combining T and level-N. - Werner Damm; Irène Guessarian (MFCS, 1981)

Pushdown Tree Automata. - Irène Guessarian (Math. Syst. Theory, 1983)

Survey on classes of interpretations and some of their applications. - Irène Guessarian (SIGACT News, 1983)

Iterative vs. regular factor algebras. - Irène Guessarian; Francesco Parisi-Presicce (SIGACT News, 1983)

Fixpoint techniques in data base recursive logic programs. - Irène Guessarian (Bull. EATCS, 1986)

Equational Axiomatizations of If-Then-Else. - Irène Guessarian (CTRS, 1987)

Notions of fairness for synchronous fork join nets. - M. Chadili; Irène Guessarian (Formal Description of Programming Concepts, 1987)

Algebraic Solutions to Recursion Schemes. - David B. Benson; Irène Guessarian (J. Comput. Syst. Sci., 1987)

On the Axiomatization of "If-Then-Else". - Irène Guessarian; José Meseguer 001 (SIAM J. Comput., 1987)

A Unifying Theorem for Algebraic Semantics and Dynamic Logics - Hajnal Andréka; Irène Guessarian; István Németi (Inf. Comput., 1987)

A characterization of fair computations of finite state SCCS processes. - Irène Guessarian (Formal Properties of Finite Automata and Applications, 1988)

An Automaton Characterization of Fairness in SCCS. - Irène Guessarian; Wafaa Niar-Dinedane (STACS, 1988)

On the Minimal Number of * Operators to Model Regularity in Fair SCCS. - Irène Guessarian; Lutz Priese (Inf. Process. Lett., 1988)

A Note On Fixpoint Techniques in Data Base Recursive Logic Programs. - Irène Guessarian (RAIRO Theor. Informatics Appl., 1988)

Improving Fixpoint Toole for Computer Science. - Irène Guessarian (IFIP Congress, 1989)

Fixpoint strategies for deductive databases. - Irène Guessarian (Discret. Appl. Math., 1989)

Fairness and Regularity for Sccs Processes. - Irène Guessarian; Wafaa Niar-Dinedane (RAIRO Theor. Informatics Appl., 1989)

LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity. - Irène Guessarian; D. Perrin (SIGACT News, 1989)

Translation of Logic Programs into Functional Fixpoint Equations. - Georges Gardarin; Irène Guessarian; Christophe de Maindreville (Theor. Comput. Sci., 1989)

Deciding Boundedness for Uniformly Connected Datalog Programs. - Irène Guessarian (ICDT, 1990)

About Fixpoints for Concurrency. - Irène Guessarian (Semantics of Systems of Concurrent Processes, 1990)

About Algebras, Fixpoints and Semantics. - Irène Guessarian (AMAST, 1991)

Trees and algebraic semantics. - Irène Guessarian (Tree Automata and Languages, 1992)

About Boundedness for some DATALOG and DATALOG_neg Programs. - Irène Guessarian; Marcos Veloso Peixoto (MFCS, 1992)

Correctness of Basic Systolic Systems Transformations. - Jozef Gruska; Irène Guessarian (IFIP Congress (1), 1994)

An Extended Transformation System for CLP Programs. - Nacéra Bensaou; Irène Guessarian (LOPSTR, 1994)

About Boundedness for Some Datalog and Datalogneg Programs. - Irène Guessarian; Marcos Veloso Peixoto (J. Log. Comput., 1994)

Linearizing Some Recursive Logic Programs. - Irène Guessarian; Jean-Eric Pin (IEEE Trans. Knowl. Data Eng., 1995)

The Expressiveness of Datalog Circuits (DAC). - Foto N. Afrati; Irène Guessarian; Michel de Rougemont (MFCS, 1997)

Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. - Jozef Gruska; Irène Guessarian (J. Autom. Lang. Comb., 1997)

Transforming Constraint Logic Programs. - Nacéra Bensaou; Irène Guessarian (Theor. Comput. Sci., 1998)

Window-accumulated subsequence matching problem is linear. - Luc Boasson; Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (Ann. Pure Appl. Log., 2001)

Editorial. - Irène Guessarian (J. Log. Comput., 2002)

The expressiveness of DAC. - Foto N. Afrati; Irène Guessarian; Michel de Rougemont (Theor. Comput. Sci., 2002)

From CTL to Datalog. - Foto N. Afrati; Theodore Andronikos; Vassia Pavlaki; E. Foustoukos; Irène Guessarian (PCK50, 2003)

On temporal logic versus datalog. - Irène Guessarian; Eugénie Foustoucos; Theodore Andronikos; Foto N. Afrati (Theor. Comput. Sci., 2003)

On relating CTL to Datalog - Foto N. Afrati; Theodore Andronikos; Vassia Pavlaki; Eugénie Foustoucos; Irène Guessarian (CoRR, 2005)

Window Subsequence Problems for Compressed Texts. - Patrick Cégielski; Irène Guessarian; Yury Lifshits; Yuri V. Matiyasevich (CSR, 2006)

Multiple serial episode matching - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (CoRR, 2006)

Automatic generation of simplified weakest preconditions for integrity constraint verification - Ahmed Ait-Bouziad; Irène Guessarian; Laurent Vieille (CoRR, 2006)

Complexity of Monadic inf-datalog. Application to temporal logic - Eugénie Foustoucos; Irène Guessarian (CoRR, 2006)

Multiple serial episodes matching. - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (Inf. Process. Lett., 2006)

Tree inclusion problems. - Patrick Cégielski; Irène Guessarian; Yuri V. Matiyasevich (RAIRO Theor. Informatics Appl., 2008)

Inf-datalog, Modal Logic and Complexities. - Eugénie Foustoucos; Irène Guessarian (RAIRO Theor. Informatics Appl., 2009)

Normalization of Some Extended Abstract State Machines. - Patrick Cégielski; Irène Guessarian (Fields of Logic and Computation, 2010)

Newton representation of functions over natural integers having integral difference ratios. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (CoRR, 2013)

Integral Difference Ratio Functions on Integers. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Computing with New Resources, 2014)

On lattices of regular sets of natural integers closed under decrementation. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Inf. Process. Lett., 2014)

Arithmetical Congruence Preservation: From Finite to Infinite. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Fields of Logic and Computation II, 2015)

Characterizing congruence preserving functions $Z/nZ to Z/mZ$ via rational polynomials. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (CoRR, 2015)

Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Integers, 2016)

Congruence Preservation, Lattices and Recognizability. - Patrick Cégielski; Serge Grigorieff; Irène Guessarian (CoRR, 2020)

The algebra of binary trees is affine complete. - André Arnold; Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Discret. Math. Theor. Comput. Sci., 2021)

Affine Completeness of Some Free Binary Algebras. - André Arnold; Patrick Cégielski; Irène Guessarian (Fundam. Informaticae, 2022)