The Elementary Theory of the Natural Lattice Is Finitely Axiomatizable. - Patrick Cégielski (Notre Dame J. Formal Log., 1989)

Definability, Decidability, Complexity. - Patrick Cégielski (Ann. Math. Artif. Intell., 1996)

Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate. - Patrick Cégielski; Yuri V. Matiyasevich; Denis Richard (J. Symb. Log., 1996)

Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France. - Patrick Cégielski; Leszek Pacholski; Denis Richard; Jerzy Tomasik; Alex Wilkie (Ann. Pure Appl. Log., 1997)

On Arithmetical First-Order Theories Allowing Encoding and Decoding of Lists. - Patrick Cégielski; Denis Richard (Theor. Comput. Sci., 1999)

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

Decidability of the theory of the natural integers with the cantor pairing function and the successor. - Patrick Cégielski; Denis Richard (Theor. Comput. Sci., 2001)

On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity. - Patrick Cégielski; François Heroult; Denis Richard (Theor. Comput. Sci., 2003)

Foreword. - Patrick Cégielski; Malika More (Theor. Comput. Sci., 2004)

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)

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

Preface. - Ruy J. G. B. de Queiroz; Patrick Cégielski (Theor. Comput. Sci., 2006)

On the Additive Theory of Prime Numbers. - Patrick Cégielski; Denis Richard; Maxim Vsemirnov (Fundam. Informaticae, 2007)

Weakly maximal decidable structures. - Alexis Bès; Patrick Cégielski (RAIRO Theor. Informatics Appl., 2008)

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

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)

Study of Stepwise Simulation Between ASM. - Patrick Cégielski; Julien Cervelle (CiE, 2019)

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)