Search the dblp DataBase

Publications of Author

1. Christian Choffrut, Serge Grigorieff
   Uniformization of Rational Relations. [Citation Graph (0, 0)][DBLP]
   Jewels are Forever, 1999, pp:59-71 [Conf]
   
2. Marie Ferbus-Zanda, Serge Grigorieff
   Is Randomness "Native" to Computer Science? [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2001, v:74, n:, pp:78-118 [Journal]
   
3. Serge Grigorieff, Maurice Margenstern
   Register Cellular Automata in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2004, v:61, n:1, pp:19-27 [Journal]
   
4. Christian Choffrut, Serge Grigorieff
   Separability of rational relations in A* × N^m by recognizable relations is decidable. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:1, pp:27-32 [Journal]
   
5. Loïc Colson, Serge Grigorieff
   Syntactical Truth Predicates For Second Order Arithmetic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 2001, v:66, n:1, pp:225-256 [Journal]
   
6. Serge Grigorieff
   Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n)). [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1990, v:55, n:1, pp:260-276 [Journal]
   
7. Marie Ferbus-Zanda, Serge Grigorieff
   Kolmogorov complexity and set theoretical representations of integers. [Citation Graph (0, 0)][DBLP]
   Math. Log. Q., 2006, v:52, n:4, pp:375-403 [Journal]
   
8. Verónica Becher, Serge Grigorieff
   Recursion and topology on 2<=omega for possibly infinite computations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:322, n:1, pp:85-136 [Journal]
   
9. Marie Ferbus-Zanda, Serge Grigorieff
   Kolmogorov complexities K_max, K_min on computable partially ordered sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:352, n:1-3, pp:159-180 [Journal]
   
10. Serge Grigorieff
    Modelization of deterministic rational relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:423-453 [Journal]
    
11. Serge Grigorieff
    Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(log_m D). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:170-185 [Journal]
    
12. Serge Grigorieff, Jean-Yves Marion
    Kolmogorov complexity and non-determinism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:151-180 [Journal]
    
13. Verónica Becher, Serge Grigorieff
    Random reals à la Chaitin with or without prefix-freeness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:193-201 [Journal]
    
14. 
    ASMs and Operational Algorithmic Completeness of Lambda Calculus. [Citation Graph (, )][DBLP]
    
    
15. 
    Duality and Equational Theory of Regular Languages. [Citation Graph (, )][DBLP]
    
    
16. 
    A Topological Approach to Recognition. [Citation Graph (, )][DBLP]
    
    
17. 
    Evolving Multialgebras Unify All Usual Sequential Computation Models. [Citation Graph (, )][DBLP]
    
    
18. 
    Is Randomness "Native" to Computer Science? [Citation Graph (, )][DBLP]
    
    
19. 
    Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity [Citation Graph (, )][DBLP]
    
    
20. 
    Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities [Citation Graph (, )][DBLP]
    
    
21. 
    Kolmogorov complexities Kmax, Kmin on computable partially ordered sets [Citation Graph (, )][DBLP]
    
    
22. 
    Set theoretical Representations of Integers, I [Citation Graph (, )][DBLP]
    
    
23. 
    Kolmogorov complexity in perspective [Citation Graph (, )][DBLP]
    
    
24. 
    Evolving MultiAlgebras unify all usual sequential computation models [Citation Graph (, )][DBLP]