Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)). - Serge Grigorieff (J. Symb. Log., 1990)

Uniformization of Rational Relations. - Christian Choffrut; Serge Grigorieff (Jewels are Forever, 1999)

The Theory of Rational Relations on Transfinite Strings. - Christian Choffrut; Serge Grigorieff (Words, Languages & Combinatorics, 2000)

Is Randomness "Native" to Computer Science? - Marie Ferbus-Zanda; Serge Grigorieff (Bull. EATCS, 2001)

Syntactical Truth Predicates For Second Order Arithmetic. - Loïc Colson; Serge Grigorieff (J. Symb. Log., 2001)

Modelization of deterministic rational relations. - Serge Grigorieff (Theor. Comput. Sci., 2002)

Kolmogorov complexity and non-determinism. - Serge Grigorieff; Jean-Yves Marion (Theor. Comput. Sci., 2002)

Register Cellular Automata in the Hyperbolic Plane. - Serge Grigorieff; Maurice Margenstern (Fundam. Informaticae, 2004)

Recursion and topology on 2<=omega for possibly infinite computations. - Verónica Becher; Serge Grigorieff (Theor. Comput. Sci., 2004)

Random reals and possibly infinite computations Part I: Randomness in ∅'. - Verónica Becher; Serge Grigorieff (J. Symb. Log., 2005)

Separability of rational relations in A* × Nm by recognizable relations is decidable. - Christian Choffrut; Serge Grigorieff (Inf. Process. Lett., 2006)

Decision problems among the main subfamilies of rational relations. - Olivier Carton; Christian Choffrut; Serge Grigorieff (RAIRO Theor. Informatics Appl., 2006)

Randomness and halting probabilities. - Verónica Becher; Santiago Figueira; Serge Grigorieff; Joseph S. Miller (J. Symb. Log., 2006)

Kolmogorov complexity and set theoretical representations of integers. - Marie Ferbus-Zanda; Serge Grigorieff (Math. Log. Q., 2006)

Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. - Marie Ferbus-Zanda; Serge Grigorieff (Theor. Comput. Sci., 2006)

Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D). - Serge Grigorieff (Theor. Comput. Sci., 2006)

Random reals à la Chaitin with or without prefix-freeness. - Verónica Becher; Serge Grigorieff (Theor. Comput. Sci., 2007)

Duality and Equational Theory of Regular Languages. - Mai Gehrke; Serge Grigorieff; Jean-Eric Pin (ICALP (2), 2008)

Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2008)

Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2008)

Kolmogorov complexities Kmax, Kmin on computable partially ordered sets - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2008)

Set theoretical Representations of Integers, I - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2008)

Kolmogorov complexity in perspective - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2008)

From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II. - Verónica Becher; Serge Grigorieff (J. Symb. Log., 2009)

Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2009)

The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2009)

ASMs and Operational Algorithmic Completeness of Lambda Calculus. - Marie Ferbus-Zanda; Serge Grigorieff (Fields of Logic and Computation, 2010)

A Topological Approach to Recognition. - Mai Gehrke; Serge Grigorieff; Jean-Eric Pin (ICALP (2), 2010)

Evolving Multialgebras Unify All Usual Sequential Computation Models. - Serge Grigorieff; Pierre Valarcher (STACS, 2010)

Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes - Marie Ferbus-Zanda; Serge Grigorieff (CoRR, 2010)

Functionals Using Bounded Information and the Dynamics of Algorithms. - Serge Grigorieff; Pierre Valarcher (LICS, 2012)

Classes of Algorithms: Formalization and Comparison. - Serge Grigorieff; Pierre Valarcher (Bull. EATCS, 2012)

Rational relations having a rational trace on each finite intersection of rational relations. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2012)

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)

Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations. - Christian Choffrut; Serge Grigorieff (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)

Logical Theory of the Monoid of Languages over a Non Tally Alphabet. - Christian Choffrut; Serge Grigorieff (Fundam. Informaticae, 2015)

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. - Verónica Becher; Serge Grigorieff (Math. Struct. Comput. Sci., 2015)

Wadge hardness in Scott spaces and its effectivization. - Verónica Becher; Serge Grigorieff (Math. Struct. Comput. Sci., 2015)

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

Theoretical Computer Science: Computability, Decidability and Logic. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Theoretical Computer Science: Computational Complexity. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

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)

Randomness and uniform distribution modulo one. - Verónica Becher; Serge Grigorieff (Inf. Comput., 2022)