default search action
Serge Grigorieff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j27]Verónica Becher
, Serge Grigorieff:
Randomness and uniform distribution modulo one. Inf. Comput. 285(Part): 104857 (2022) - 2021
- [j26]André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - 2020
- [p2]Olivier Bournez
Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 1-50 - [p1]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 51-89 - [i16]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Congruence Preservation, Lattices and Recognizability. CoRR abs/2004.05943 (2020) - [i15]André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. CoRR abs/2011.03925 (2020)
2010 – 2019
- 2016
- [j25]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials. Integers 16: A50 (2016) - 2015
- [j24]Christian Choffrut, Serge Grigorieff:
Logical Theory of the Monoid of Languages over a Non Tally Alphabet. Fundam. Informaticae 138(1-2): 159-177 (2015) - [j23]Verónica Becher
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Math. Struct. Comput. Sci. 25(7): 1490-1519 (2015) - [j22]Verónica Becher
Wadge hardness in Scott spaces and its effectivization. Math. Struct. Comput. Sci. 25(7): 1520-1545 (2015) - [c10]Christian Choffrut, Serge Grigorieff:
Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations. Fields of Logic and Computation II 2015: 109-128 - [c9]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Arithmetical Congruence Preservation: From Finite to Infinite. Fields of Logic and Computation II 2015: 210-225 - [i14]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials. CoRR abs/1506.00133 (2015) - 2014
- [j21]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On lattices of regular sets of natural integers closed under decrementation. Inf. Process. Lett. 114(4): 197-202 (2014) - [c8]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Integral Difference Ratio Functions on Integers. Computing with New Resources 2014: 277-291 - 2013
- [i13]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On Lattices of Regular Sets of Natural Integers Closed under Decrementation. CoRR abs/1310.1378 (2013) - [i12]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Newton representation of functions over natural integers having integral difference ratios. CoRR abs/1310.1507 (2013) - [i11]Verónica Becher, Serge Grigorieff:
Borel and Hausdorff Hierarchies in Topological Spaces of Choquet Games and Their Effectivization. CoRR abs/1311.0330 (2013) - [i10]Verónica Becher, Serge Grigorieff:
Wadge Hardness in Scott Spaces and Its Effectivization. CoRR abs/1311.0331 (2013) - 2012
- [j20]Serge Grigorieff, Pierre Valarcher:
Classes of Algorithms: Formalization and Comparison. Bull. EATCS 107: 95-127 (2012) - [j19]Christian Choffrut, Serge Grigorieff:
Rational relations having a rational trace on each finite intersection of rational relations. Theor. Comput. Sci. 454: 88-94 (2012) - [c7]Serge Grigorieff, Pierre Valarcher:
Functionals Using Bounded Information and the Dynamics of Algorithms. LICS 2012: 345-354 - 2010
- [c6]Marie Ferbus-Zanda, Serge Grigorieff:
ASMs and Operational Algorithmic Completeness of Lambda Calculus. Fields of Logic and Computation 2010: 301-327 - [c5]Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
A Topological Approach to Recognition. ICALP (2) 2010: 151-162 - [c4]Serge Grigorieff, Pierre Valarcher:
Evolving Multialgebras Unify All Usual Sequential Computation Models. STACS 2010: 417-428 - [i9]Serge Grigorieff, Pierre Valarcher:
Evolving MultiAlgebras unify all usual sequential computation models. CoRR abs/1001.2160 (2010) - [i8]Marie Ferbus-Zanda, Serge Grigorieff:
ASMs and Operational Algorithmic Completeness of Lambda Calculus. CoRR abs/1010.2597 (2010) - [i7]Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes. CoRR abs/1010.3201 (2010)
2000 – 2009
- 2009
- [j18]Verónica Becher
From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II. J. Symb. Log. 74(1): 124-156 (2009) - [j17]Christian Choffrut, Serge Grigorieff:
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. Theor. Comput. Sci. 410(1): 16-34 (2009) - [j16]Christian Choffrut, Serge Grigorieff:
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. Theor. Comput. Sci. 410(30-32): 2870-2884 (2009) - 2008
- [c3]Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
Duality and Equational Theory of Regular Languages. ICALP (2) 2008: 246-257 - [i6]Marie Ferbus-Zanda, Serge Grigorieff:
Is Randomness "Native" to Computer Science? CoRR abs/0801.0289 (2008) - [i5]Marie Ferbus-Zanda, Serge Grigorieff:
Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity. CoRR abs/0801.0349 (2008) - [i4]Marie Ferbus-Zanda, Serge Grigorieff:
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities. CoRR abs/0801.0350 (2008) - [i3]Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. CoRR abs/0801.0351 (2008) - [i2]Marie Ferbus-Zanda, Serge Grigorieff:
Set theoretical Representations of Integers, I. CoRR abs/0801.0353 (2008) - [i1]Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexity in perspective. CoRR abs/0801.0354 (2008) - 2007
- [j15]Verónica Becher
Random reals à la Chaitin with or without prefix-freeness. Theor. Comput. Sci. 385(1-3): 193-201 (2007) - 2006
- [j14]Christian Choffrut, Serge Grigorieff:
Separability of rational relations in A* × Nm by recognizable relations is decidable. Inf. Process. Lett. 99(1): 27-32 (2006) - [j13]Olivier Carton
Decision problems among the main subfamilies of rational relations. RAIRO Theor. Informatics Appl. 40(2): 255-275 (2006) - [j12]Verónica Becher
Randomness and halting probabilities. J. Symb. Log. 71(4): 1411-1430 (2006) - [j11]Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexity and set theoretical representations of integers. Math. Log. Q. 52(4): 375-403 (2006) - [j10]Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. Theor. Comput. Sci. 352(1-3): 159-180 (2006) - [j9]Serge Grigorieff:
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D). Theor. Comput. Sci. 356(1-2): 170-185 (2006) - 2005
- [j8]Verónica Becher
Random reals and possibly infinite computations Part I: Randomness in ∅'. J. Symb. Log. 70(3): 891-913 (2005) - 2004
- [j7]Serge Grigorieff, Maurice Margenstern:
Register Cellular Automata in the Hyperbolic Plane. Fundam. Informaticae 61(1): 19-27 (2004) - [j6]Verónica Becher
Recursion and topology on 2<=omega for possibly infinite computations. Theor. Comput. Sci. 322(1): 85-136 (2004) - 2002
- [j5]Serge Grigorieff, Jean-Yves Marion:
Kolmogorov complexity and non-determinism. Theor. Comput. Sci. 271(1-2): 151-180 (2002) - [j4]Serge Grigorieff:
Modelization of deterministic rational relations. Theor. Comput. Sci. 281(1-2): 423-453 (2002) - 2001
- [j3]Marie Ferbus-Zanda, Serge Grigorieff:
Is Randomness "Native" to Computer Science? Bull. EATCS 74: 78-118 (2001) - [j2]Loïc Colson, Serge Grigorieff:
Syntactical Truth Predicates For Second Order Arithmetic. J. Symb. Log. 66(1): 225-256 (2001) - 2000
- [c2]Christian Choffrut, Serge Grigorieff:
The Theory of Rational Relations on Transfinite Strings. Words, Languages & Combinatorics 2000: 103-133
1990 – 1999
- 1999
- [c1]Christian Choffrut, Serge Grigorieff:
Uniformization of Rational Relations. Jewels are Forever 1999: 59-71 - 1990
- [j1]Serge Grigorieff:
Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)). J. Symb. Log. 55(1): 260-276 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: