Patrick Cegielski
Publications
Publications
|
|
Congruence preserving functions on free monoidsAlgebra Universalis, 2017, 78 (3), pp.389 - 406. ⟨10.1007/s00012-017-0464-x⟩ |
Characterizing congruence preserving functions Z/nZ --> Z/nZ via rational polynomialsIntegers : Electronic Journal of Combinatorial Number Theory, 2016 |
|
|
|
Newton representation of functions over natural integers having integral difference ratiosInternational Journal of Number Theory, 2015, 11 (7), pp.2109-2139. ⟨10.1142/S179304211550092X⟩ |
|
|
On Lattices of Regular Sets of Natural Integers Closed under DecrementationInformation Processing Letters, 2014, 114 (4), pp.197-202. ⟨10.1016/j.ipl.2013.11.013⟩ |
Tree inclusion problemsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42 (1), pp.5-20. ⟨10.1051/ita:2007052⟩ |
|
Window Subsequence Problem for Compressed TextsLecture Notes in Computer Science, 2006, 3697, pp.127-136 |
|
Multiple serial episodes matchingInformation Processing Letters, 2006, 98/6, pp.211-218 |
|
Decidability and p-destiniesJournal of Mathematical Sciences, 2005, 130, pp.4620-4623 |
|
Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 04)Electronic Notes in Theoretical Computer Science, 2005, 123, pp.240 |
|
Foreword – Weak ArithmeticsTheoretical Computer Science, 2004, 322, pp.1-3 |
|
Il faut revenir aux sources !L'informatique professionnelle, Gartner ISSN 0750-1080, 2004, 229, pp.11-15 |
|
On the amplitude of intervals of natural numbers whose every element is coprime with no extremityTheoretical Computer Science, 2003, 303, pp.53-62 |
|
Decidability of natural integers equipped with Cantor pairing function and successorTheoretical Computer Science, 2001, 257, pp.51-77 |
|
Window Accumulated Subsequence Matching is linearAnnals of Pure and Applied Logic, 2001, 113, pp.59-80 |
|
La théorie élémentaire de la fonction de couplage de Cantor des entiers naturels est décidableComptes rendus de l'Académie des sciences. Série I, Mathématique, 2000, 331, pp.107-110 |
|
On arithmetical first-order theories allowing encoding and decoding of listsTheoretical Computer Science, 1999, 222, pp.55-75 |
|
C'est é-lé-mentaireQuadrature, 1996, 24, pp.13-17 |
|
Colloque National sur les Recherches en IUTQuadrature, 1996, 24, pp.120 |
|
Definability and decidability issues in extensions of the integers with the divisibility predicateThe Journal of Symbolic Logic, 1996, 61, pp.515-540 |
|
Definability, decidability and complexityAnnals of Mathematics and Artificial Intelligence, 1996, 111, pp.311-341 |
|
Indécidabilité de la théorie des entiers naturels munis d'une énumération des premiers et de la divisibilitéComptes rendus de l'Académie des sciences. Série I, Mathématique, 1992, 315, pp.1431-1434 |
|
La théorie des corps inductifs archimédiens rationnellement completsComptes rendus de l'Académie des sciences. Série I, Mathématique, 1990, 311, pp.847-850 |
|
La théorie des corps réels-clos inductifs est une extension conservative de l'arithmétique de PeanoComptes rendus de l'Académie des sciences. Série I, Mathématique, 1990, 310, pp.239-242 |
|
The Elementary Theory of the Natural Lattice is Finitely AxiomatizableNotre Dame Journal of Formal Logic, 1989, 30, pp.138-150 |
|
Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, FranceAnnals of Pure and Applied Logic, 1987, 89, pp.1-3 |
|
La théorie élémentaire de la divisibilité est finiment axiomatisableComptes rendus de l'Académie des sciences. Série I, Mathématique, 1984, 299, pp.367-369 |
|
La théorie élémentaire de la multiplicationLecture Notes in Mathematics, 1981, 890, pp.44-89 |
|
La théorie élémentaire de la multiplication est conséquence d'un nombre fini d'axiomes de ISigmaZéroComptes rendus de l'Académie des sciences. Série I, Mathématique, 1981, 293, pp.351-352 |
|
La théorie élémentaire de la multiplicationComptes rendus de l'Académie des sciences. Série I, Mathématique, 1980, 290, pp.935-938 |
Study of Stepwise Simulation Between ASM15th Conference on Computability in Europe, Jul 2019, Durham, United Kingdom. pp.156-167 |
|
|
|
Multiple serial episode matching2005, pp.26-38 |
|
|
On the additive theory of prime numbers II2005, pp.39-47 |
On the additive theory of prime numbers I2003, pp.90-99 |
|
Window Accumulated Subsequence Matching is linear1999, pp.327-336 |
Une introduction à la science informatique pour les enseignants de la discipline en lycéeGilles Dowek. CRDP Paris, pp.376, 2011, Repères pour agir (RPA disciplines & compétences), Christine Moulin, 978-2-86631-188-9 |
|
Conception des systèmes d'exploitation : Le cas linux. Deuxième édition.Eyrolles, pp.XIII+680, 2004 |
|
Comprendre les systèmes d'exploitation: le cas linuxEyrolles, 2003 |
|
Modélisation et simulation : actes du CNRIUT98L'Harmattan, pp.592, 1998 |
|
|
Arithmetical Congruence Preservation: from Finite to InfiniteFields of Logic and Computation II - Essays Dedicated to Yuri Gurevich, 9300, pp.210-225, 2015, LNCS |
Arithmetical Congruence Preservation: From Finite to Infinite, Lecture Notes in Computer Science 9300, Springer, 2015, pp. 210-225From Finite to Infinite, Lecture Notes in Computer Science 9300, Springer, 2015, 2015 |
|
|
|
Integral Difference Ratio Functions on IntegersComputing with new resouces, 8808, pp.210-225, 2014, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-13350-8_21⟩ |
|
|
Normal form of Some extended Abstract State MachinesFields of Logic and Computation, pp.165-180, 2010, 978-3-642-15025-8. ⟨10.1007/978-3-642-15025-8⟩ |
Théorie des nombres et informatiqueCNR'IUT 2001, Presses Universitaires de Saint-Étienne, pp.249-256, 2001 |
|
Comment vérifier l'accès à une page WebCNR'IUT 2000, tome 1, ISBN 2.913454-06-2, Presses Universitaires d'Orléans, pp.249-256, 2000 |
|
Un fondement des MathématiquesMichel Serfati. La recherche de la vérité, ACL-éditions (Paris), pp.177-209, 1999 |
|
Historique de la théorie élémentaire des ensemblesFragments d'histoire des mathématiques II, APMEP (Association des Professeurs de Mathématiques de l'Enseignement Public), pp.161-210, 1987 |
|
Modèles récursivement saturés de l'addition et de la multiplication des entiers naturelsD. van Dalen. Logic colloquium 80, North-Holland, pp.57-68, 1982 |
|
|
CHARACTERIZING CONGRUENCE PRESERVING FUNCTIONS Z/nZ → Z/mZ VIA RATIONAL POLYNOMIALS2016 |
|
|
On Lattices of Regular Sets of Natural Integers Closed under Decrementation2013 |
|
|
Newton representation of functions over natural integers having integral difference ratios2013 |
|
|
Tree inclusions in windows and slices2007 |
|
|
Non-Maximal Decidable Structures2007 |
|
|
Tree inclusion problems2007 |
|
|
Weakly Maximal Decidable Structures2007 |