Recif

Publications depuis 1999

Articles de revues internationales avec comité de lecture

Présentations dans des colloques internationaux avec actes

Présentations dans des colloques sans actes ou avec actes à diffusion restreinte
Rapports de recherche

Thèses soutenues

[BAhm02] Kadrie AHMAD. Quelques problèmes de mélanges contrôlés. Thèse de doctorat, Université de Nice Sophia-Antipolis, Avril 2002.

[BAug01] Xavier AUGROS. Des algorithmes autour des codes rationnels. Thèse de doctorat, Université de Nice Sophia-Antipolis, Décembre 2001.

[BDuc03] E. Duchi. Eco Methods and object Grammars : two methods for the enumeration of combinatorial objects. Thèse de doctorat, Université de Nice Sophia Antipolis, 2003.

[BDB03] A. Desideri Bracco. Codes quasi cycliques: constructions algébriques et représentation par treillis. Thèse de doctorat, Université de Nice Sophia Antipolis, 2003.

[Du03] J. Durand-Lose, Calculer géopétriquement sur le plan . Machines à Signaux. Mémoire d'habilitation à diriger des recherches, Université de Nice Sophia Antipolis, 2003.

[BDir01] Laurent DIRAT. Outils pour des mathématiques interactives et distribuées. Thèse de doctorat, Université de Nice Sophia Antipolis, 2001.

[BLic03] Nicolas Lichiardopol. Echange total, diffusion et quelques résultats sur les itérés des lines digraphs. Thèse de doctorat, Université de Nice Sophia Antipolis, 2003.

[BMar05] Bruno Martin. Simulation d'automates cellulaires. Mémoire d'habilitation à diriger des recherches, Université de Nice Sophia Antipolis, 2005.

Articles de revues internationales avec comité de lecture

[CAA01] Kadrie AHMAD et Xavier AUGROS. Somes results on codes for generalized factorizations. Journal of Automata, Languages and Combinatorics, 6(3):239–253, 2001.

[CADTS01] Kadrie AHMAD, V.R. DARE, D.G. THOMAS, et K.G. SUBRAMANIAN. Algebraic properties of the shuffle over w -trajectories. IPL, 80:139–244, 2001.

[CAGHOS99] T.Aoki, P. Gaborit, M. Harada, M. Ozeki, P. Solé . On the Covering radius of Z4 codes and their lattices, IEEE Trans. on Information Theory, 45 (1999) 2162-2168.

[CAGPS02] O. ATKIN, Philippe GABORIT, V. PLESS, et Patrick SOLÉ. Type II codes over F4 .Finite Fields and Applications, 8:171–183, 2002.

[CBBDS03] Jean-Claude BERMOND, Ioan BOND,D. Peleg, S. Perrenes. The power of small coalisions in graphs. Discrete Aplied Maths, Vol 127, pp339-414, 2003.

[CBBKPS99 ] JC Bermond, A. Bonnecaze, T. Kodate, S. Pérennes, P. Solé. Symmetric flows and broadcasting in hypercubes. Annales de l' Institut Fourier 49, fasc. 3 787-807, 1999

[CBBMPR 00] Jean-Claude BERMOND, Ioan BOND, C. MARTIN, A. PEKEC, et F.S. ROBERTS. Optimal orientation of annular networks. Journal of Interconnexion Networks, 1(1):21–46, 2000.

[CBBRSV] Jean-Claude BERMOND, Ioan BOND, S. RUDICH, M. SANTHA, et F. de la VEGA. The radius of graphs on alphabets.
Graphs and Combinatorics, À paraître.

[CBCDS03] A. Bonnecaze, Y-J. Choie,S. Dougherty, P. Solé. Splitting the shadow, Discrete Maths 270 , 43-60, 2003.

[CBCF05] F. Blanchard, J. Cervelle znd E. Formenti. Some results about chaotic behavior of cellular automata. TCS, 349, 3, 318-336, 2005

[CBDDNS03] A. Bonnecaze, A. Desideri Bracco, S. Dougherty, L. Nochefranca, P. Solé. Cubic Self Dual Binary Codes . IEEE Trans. on Information Theory. IT-49 , 2253-2259, 2003.

[CBDFK05]Vincent Bernardi , Bruno Durand , Enrico Formenti, Jarkko Kari : A new dimension sensitive property for cellular automata. Theor. Comput. Sci. 345 (2-3): 235-247, 2005.

[CBDLGJ02] J. BEAUQUIER, Jérôme DURAND-LOSE,M. GRADINARIU, et C. JOHNEN. Token based self-stabilizing uniform algorithms. Journal of Parallel and Distributed Computing, 62(5):899–921, 2002.

[CBFK99] F. Blanchard, E. Formenti and P. Kurka. Cellular automata in Cantor, Besicovitch and Weyl topological spaces. Complex Systems 11(2):107-123, 1999.

[CBGHKS99] A. Bonnecaze, P. Gaborit, M. Harada, M.Kitazume, P. Solé. Niemeier Lattices and Type II codes over Z4 , Discrete Math. 205 1-21, 1999

[CBMS99] A. Bonnecaze, B. Mourrain, P. Solé . Type II Codes, Jacobi polynomials and designs, Designs, Codes and Cryptography, Vol 16, 215-234, 1999.

[CBRS00] A. BONNECAZE, E. RAINS, et Patrick SOLÉ. 3-colored 5-designs and Z4 -codes. J. of Stat. and Inf., 86:349–368, 2000.

[CBS04] M. BRONSTEIN, P. SOLE. Linear Recurrences with Polynomial Coefficients, J. Of Complexity, Volume 20 171-181,2004.

[CBSU01] A. BONNECAZE, Patrick SOLÉ, et P. UDAYA. Tricolore 3-designs in type III codes. Discrete Math, 241 (Special Volume: Tverberg Anniversary):129–138,2001.

[CCCS03] H-H. CHAN, K-S. CHUA, et Patrick SOLÉ. 7- modular lattices and septic base Jacobi identity. J. Number Theory, Vol 99 ,N 2, 361-372, 2003

[CCCS03] H-H. CHAN, K-S. CHUA, et Patrick SOLÉ. Quadratic iterations to p associated with elliptic functions to the cubic and septic base. Trans. of the AMS,355, 1505-1520, 2003.

[CCDGS02] R. CHAPMAN, S. DOUGHERTY, Philippe GABORIT, et Patrick SOLÉ. 2-modular lattices from ternary codes. J. de théorie des Nombres de Bordeaux, 14:1–13, 2002.

[CCFM99] G. Cattaneo, E. Formenti, and L. Margara. On the Dynamical Behavior of Chaotic Cellular Automata . Theoretical Computer Science 217(1):31-51, 1999.

[CCFMM99] G. Cattaneo and E. Formenti and G. Manzini and L. Margara. Ergodicity and Regularity for Linear Cellular Automata overZ m. Theoretical Computer Science 233(1-2):147-164,1999.

[CCFM05]J. Cervelle, E. Formenti, et B. Masson. Basic properties for sand automata. MFCS 2005 , volume 3618 de Lecture Notes in Computer Science , pages 192-211, Springer-Verlag, 2005.

[CCMS01a] C. CHARNES, Bruno MARTIN, et Patrick SOLÉ. A lattice-based McEliece scheme for encryption and signature. Electronic Notes in Discrete Mathematics, 6, 2001.

[CCMS01b] Y-J. CHOIE, B. MOURRAIN, et Patrick SOLÉ. Rankin-Cohen brackets and Invariant Theory. J. of Algebraic Combinatorics, 13:5–13, 2001.

[CCNPR04] Codrin M. Nichitiu , Christophe Papazian, Eric Rémila : Leader election in plane cellular automata, only with left-right global convention. Theor. Comput. Sci. 319 (1-3): 367-384 (2004)

[CCS02a] Y-J. CHOIE et Patrick SOLÉ. A Gleason formula for Ozeki polynomials. J. of Combinatorial Th. series A, 98:60–73, 2002.

[CCS02b] Y-J. CHOIE et Patrick SOLÉ. Self-dual codes over Z4 and half-integral weight modular forms. Proceedings of the AMS, 130:3125–3131, 2002.

[CCS04] K-S. CHUA et Patrick SOLÉ. Eisenstein lattices, Shrikhande graph, Doob codes, Galois rings. Europ. J. of Combinatorics, Vol 25, N2, 179-185, 2004.

[CCZS03] Donald I. Cartwright, P. Solé, Andrzej Zuk. Ramanujan geometries of type Ãn, Discrete Mathematics Volume 269, Issues 1-3, Pages 35-43,2003.

[CDDF01]Jean-Christophe Dubacq , Bruno Durand , Enrico Formenti: Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259 (1-2): 271-285, 2001.

[CDDF01] J.-C. Dubacq, B. Durand and E. Formenti. Kolmogorov complexity and cellular automata classification. Theoretical Computer Science 259(1-2):271-285, 2001.

[CDF03a] I. Dutour, J-M Fédou, Object grammars and bijections, Theoretical Comp. Sci. 290 (2003) 1915-1929.

[CDFR03] B. Durand, E. Formenti and Z. Róka. Number conserving cellular automata I: decidability . Theoretical Computer Science 299(1-3):523-535, 2003.

[CDFR04] E. Duchi, J-M Fédou, S. Rinaldi. From object grammars to ECO-systems. Theoretical Computer Science, 314, 2004, 57-95.

[CDGHMS 99] S. DOUGHERTY, Philippe GABORIT, M. HARADA, A. MUNEMASA, et Patrick SOLÉ. Type IV self-dual codes over rings. IEEE Trans. on Information Theory, Vol 45, N 7, 2345-2360, 1999.

[CDHS99] S. Dougherty, M. Harada, P. Solé . Codes over Rings and the Chinese remainder theorem. Hokkaido J. of Math., 28 , 253-283, 1999.

[CDHS00] S. DOUGHERTY, M. HARADA, et Patrick SOLÉ. Shadow codes and shadow lattices. Discrete Mathematics, 219:49–64, 2000.

[CDHS01] S. DOUGHERTY, M. HARADA, et Patrick SOLÉ. Shadow codes over Z4 . Finite Fields and Applications, 7:507–529, 2001.

[CDSST05] Cunsheng Ding, Arto Salomaa, Patrick Solé , Xiaojian Tian. Three constructions of authentication/secrecy codes, Journal of Pure and Applied Algebra, Volume 196, Issues 2-3, pp. 149-168 , 2005.

[CF03] E. Formenti. On the sensitivity of cellular automata in Besicovitch spaces . Theoretical Computer Science 301(1-3):341-354, 2003.

[CF05] E. Formenti. On computing gixed points for generalized sand piles. International Journal on Unconventional Computing, Vol 2, N1, p 13-25, 2005

[CFDS99] F. Chung et C. Delorme, P. Solé Multidiameters and Multiplicities, Europ. J. of Comb. 20, 629-640, 1999.

[CFG03] E. Formenti and A. Grange. Number conserving cellular automata II: dynamics . Theoretical Computer Science, 304(1-3):269-290, 2003.

[CFM05] E. Formenti and B. Masson. A note on fixed points of generalized ice piles models. International Journal on Unconventional Computing, 2005, accepted for publication

[CGNS06] P. Gaborit, A.M. Natividad, P. Solé. Eisenstein lattices, Galois rings, and quaternary codes, Int. J. of Number Theory, 2006.

[CLic03a] N. Lichiardopol. A new proof of Wedderburn’s theorem, American Mathematical Monthly, Vol.110,
octobre 2003, 736-737.

[CLic03b] N. Lichiardopol: Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. Discrete Mathematics 280 (1-3): 119-131 , 2004.

[CLic04] N. Lichiardopol: Broadcast time and connectivity. Discrete Applied Mathematics 143 (1-3): 359-363 , 2004.

[CLic05] N. Lichiardopol, Independence number of iterated line digraphs, Discrete Mathematics, issue spéciale BCC
19, 293 (2005), 185-193.

[CLic06] N. Lichiardopol. Independence number of de Bruijn graphs, à paraître dans Discrete Mathematics.

[CLic06] N. Lichiardopol. Cycles in a tournament with pairwise zero, one or two vertices in common, à paraitre dans Discrete Mathematics, numéro spécial BCC 20.

[CLLSZ04] J. Lahtonen, S. Ling, P. Solé, D. Zinoviev Z8-Kerdock codes and pseudo random binary sequences, J. Of Complexity Volume 20, pp. 312--330, 2004.

[CLNS06] S. Ling, H. Niederreiter,P.Solé. On the algebraic structure of quasi-cyclic codes IV: repeated roots, Designs, Codes and Cryptography, 2006.

[CLS00] P. LANGEVIN et Patrick SOLÉ. Duadic Z4 -codes. Finite Fields and Applications,6:309–326, 2000.

[CLS01a] San LING et Patrick SOLÉ. Duadic codes over F2+uF2 . J. of the AAECC, pages 365–380, 2001.

[CLS01b] San LING et Patrick SOLÉ. Duadic codes over Z2k . IEEE trans. on Information Theory, IT-47:1581–1589, 2001.

[CLS01c] San LING et Patrick SOLÉ. On the algebraic structure of quasi-cyclic codes I : finite fields. ieee Transactions on Information Theory, 47:2751–2760, 2001.

[CLS01d] San LING et Patrick SOLÉ. Type II codes over F4+uF4 . European J. of Combinatorics, 22:983–997, 2001.

[CLS03a] San LING et Patrick SOLÉ. Good self dual quasi_cyclic codes exist, IEEE Transactions on Information Theory, 49:1052–1054, 2001.

[CLS03b] San LING et Patrick SOLÉ. Non-linear p-ary sequences. J. of the AAECC 14 , 117-125, 2003.

[CLS03c] San LING et Patrick SOLÉ. On the algebraic structure of quasi-cyclic codes II: chain rings, Designs, Codes and Cryptography ,30, (1), 113-130,2003.

[CLS05] San LING et Patrick SOLÉ. On the algebraic structure of quasi-cyclic codes III: generator theory, IEEE Transactions on Information Theory, Vol. 51,2692-2700,2005.

[CMar01] Bruno MARTIN. A simulation of cellular automata on hexagons by cellular automata on rings. tcs, 263:231–234, 2001.

[CMS05] P. Moree, P. Solé Around Pelikan conjecture on very odd sequences, Manuscripta Mathematica 117 , 219-238, 2005.

[CPOS06] M. Petitot, P. Olver,P. Solé. Symplectic transvectants and Siegel modular forms, Advances in Applied Math, 2006.

[CPS06] F. Patras, P.Solé The coordinator polynomial of some cyclotomic lattices, European J. of Combinatorics ,2006.

[CSKP03] Sanjay Jain , Efim B. Kinber , Christophe Papazian, Carl H. Smith , Rolf Wiehagen : On the intrinsic complexity of learning recursive functions. Inf. Comput. 184 (1): 45-70 (2003)

[CSol00] Patrick SOLÉ. Tower of function fields and iterated means. IEEE Trans. on Information Theory, IT-46:1532–1535, 2000.

[CSZ04a]P.Solé, D. Zinoviev Quaternary Codes and Biphase Sequences from Z8-Codes, Problems of Information Transmission, V 40. No. 2. P. 147--158, 2004.

[CSZ04b]P.Solé, D. Zinoviev The Most Significant Bit of Maximum Length Sequences Over Z2l: Autocorrelation and Imbalance, IEEE Transactions on Information Theory, Vol. 50, pp. 1844--1846, 2004.

Présentations dans des colloques internationaux avec actes

[DAA01] Kadrie AHMAD et Xavier AUGROS. Codes and generalized factorizations. Multiconference on Systemics, Cybernetics and Informatics, numéro 14 dans invited session Finite State Automata for Modeling and Analyzing Systems Behaviour, pages 112–115, 2001.

[DAug99] Xavier AUGROS. Automata to recognize finite and infinite words with at least two factorizations on a given finite set. Dans J-M. CHAMPARNAUD, D. MAUREL, et D. ZIADI, éditeurs,Workshop on Implementating Automata, numéro 1660 dans Lecture Notes in Computer
Science, pages 220–225. Springer Verlag, 1999.

[DBCF037] François Blanchard, Julien Cervelle and Enrico Formenti. Periodicity and transitivity for cellular automata in Besicovitch topologies . Lecture Notes in Computer Sciences 2747, August 25-29, 228-238, Bratislava, 2003

[DBDFK04] V. Bernardi, B. Durand, E. Formenti and J. Kari. A new dimension sensitive property for cellular automata . Accepté à MFCS '04. 2004.

[DBDFÜ 01] Michel BUFFA, Laurent DIRAT, Jean-Marc FÉDOU, S. LAVIROTTE, et P. SANDER. Incorporating interactive mathematical content into web-base distance learning systems. DansWorld Conferenc on Open Learning and Distance Education, ICDEU20, pages 1455–1461, Düsseldorf, Allemagne, 2001. IEEE.

[DBDFS99] Michel BUFFA, Laurent DIRAT, Jean-Marc FÉDOU, et P. SANDER. JOME : Java OpenMath Editor. Dans ICTMT-4: Proceedings of The Fourth International Conferenceon Technology in Mathematics Teaching, pages 1455–1461, Plymouth, 1999, Sharp, J.

[DBDFS00] Michel BUFFA, Laurent DIRAT, Jean-Marc FÉDOU, et P. SANDER. JOME,un composant logiciel pour le téléenseignement des mathématiques via le web, compatible OpenMath etMathML. Dans TICE2000, pages 1455–1461, Troyes, France, 2000. Sharp, J.

[DCDF01] J. Cervelle, B. Durand and E. Formenti Algorithmic information theory and cellular automata dynamics . In Mathematical Foundations of Computer Science (MFCS'01), Lecture Notes in Computer Science, Marianske Lazne, Czech Republic, 2001. Springer-Verlag.

[DCF03]J. Cervelle et E. Formenti. On sand automata.. STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science , volume 2607 de Lecture Notes in Computer Science , pages 642-653, Springer-Verlag, 2003.

[DCMS01] C. CHARNES, Bruno MARTIN, et Patrick SOLÉ. A lattice-based McEliece scheme for encryption and signature. Dans D. AUGOT et C. CARLET, éditeurs, International Workshop on Coding and Cryptography, pages 497–506. Presses de l’Armée de Terre, 2001.

[DDS02] S. DOUGHERTY et Patrick SOLÉ. Shadow codes and shadow lattices. Dans T. SUNADA, P.W. SY, et Y. LO, éditeurs, Proceedings
of Asian Math Conference 2000, pages 139–152.World Scientific, 2002.

[DDFGR03] Bruno Durand , Enrico Formenti, Aristide Grange , Zsuzsanna Róka : Number conserving cellular automata: new results on decidability and dynamics. DMCS 2003 : 129-140

[DDFV03] Bruno Durand , Enrico Formenti, Georges Varouchas : On undecidability of equicontinuity classification for cellular automata. DMCS 2003 : 117-128 .

[DDSSX] C. Ding, A. Salomaa,P. Solé, T. Xiang Three authentication codes, Proceedings of AAECC-15, Springer Lect. Not. in Comp. Sc. 2643 (2003) 24-33, 2003.

[DDZF03] Silvano Dal Zilio and Enrico Formenti. On the dynamics of PB systems: a Petri net view . Proceedings of Workshop on membrane computing (WMC 2003), C. Martin-Vide, Gh. Paun, G. Rozemberg and A. Salomaa editors. Lecture Notes in Computer Sciences 2933, Tarragona (Spain), 2003.

[DFG02] Jean-Marc FÉDOU et Christine GARCIA. Algebraic succession rules. Dans SFCA2002, pages 1455–1461, Melbourne, Australie, 2002. IEEE.

[DKS01] A. KELAREV et Patrick SOLÉ. Error correcting codes as ideals in group rings. Dans Proceedings of AGRAM 2000, volume 273 de Contemp.Math, pages 11–18. AMS, 2001.

[DGHS99] P. Gaborit, M. Harada,P. Solé. Self-dual Codes over Z4 and lattices: a survey, Algebras and Combinatorics, K-P. Shum, E.J. Taft, Z-X. Wan eds, 255-276, 1999.

[DLS99] P. Langevin, P. Solé. Kernels and defaults, Proceedings of FQ4, R.C. Mullin and Gary L. Mullen eds, Contemporary Math 225 , 77-86, 1999.

[DLS01] San LING et Patrick SOLÉ. Decomposing quasi-cyclic codes. Dans D. AUGOT et C. CARLET, éditeurs, International Workshop
on Coding and Cryptography, pages 507–518. Presses de l’Armée de Terre, 2001.

[DLS04] S. Ling, P. Solé. Good self-dual quasi cyclic codes over Fp, p odd exist, HuangShan (Yellow Mountain) City 23-28 June, 2003 , Coding, Crypto and Combinatorics, K. Feng, H. Niederreiter, C. Xing eds, Birkhaueser 2004, PP 223-226.

[DMar99] Bruno MARTIN. A parallel simulation of cellular automata by spatial machines. Dans EuroPar’99, numéro 1685 dans LNCS, pages 557–560. Springer Verlag, 1999.

[DPR00] Christophe Papazian, Eric Rémila : Some Properties of Hyperbolic Networks. DGCI 2000 : 149-158

[DPR01] Christophe Papazian, Eric Rémila : Linear Time Recognizer for Subsets of Z 2 . FCT 2001 : 400-403

[DPR02] Christophe Papazian, Eric Rémila : Hyperbolic Recognition by Graph Automata. ICALP 2002 : 330-342

[DS99] P. Solé. Ramanujan Hypergraphs and Ramanujan geometries. Proceedings of Emerging Applications of Number Theory, Mineapolis 1996, IMA vol. 109, Springer ,583-590 , 1999 .

[DSZ05a] P. Solé, D. Zinoviev. Weighted degree trace codes for PAPR reduction, SETA 2004, LNCS 3486, pp. 406--413, 2005.

[DSZ05b] P. Solé, D. Zinoviev. Distribution of r-Pattern in the Most Significant Bit of a Maximum Length Sequence over Z2l, SETA 2004, LNCS 3486, pp. 275--281, 2005.

Présentations dans des colloques sans actes ou avec actes à diffusion restreinte

[FMP00] Bruno MARTIN et Claudine PEYRAT. On the simulation of CA on torus by CA on rings. Osaka Electro-Communication Univ., 2000. International Workshop on Cellular Automata.

Rapports de recherche

[GBDCS02] A. BONNECAZE, S. DOUGHERTY, Y-J. CHOIE, et Patrick SOLÉ. Splitting the shadow. Soumis à Discrete Mathematics
RR-2002-41-FR, I3S, 2002.

[GBDNS02] A. BONNECAZE, S. DOUGHERTY, L. NOCHEFRANCA, et Patrick SOLÉ. Cubic self dual binary codes. Soumis à IEEE Trans. on Information Theory RR-2002-42-FR,I 3S, 2002.

[GDFGP02] Enrica DUCHI, Jean-Marc FÉDOU, Christine GARCIA, et Élisa PERGOLA. ECO inversion.Soumis à Theoretical Computer Sciences. RR-2002-38-FR, I3S, 2002.

[GDFM00] M. Delorme, E. Formenti and J. Mazoyer. Open problems on cellular automata. RR-2000-25, ENS-Lyon, Juillet 2000. (Gzipped Postscript)

[GDFR02] Enrica DUCHI, Jean-Marc FÉDOU, et S. RINALDI. Object grammars and ECO method : two different approaches for the enumeration of combinatorial objects. Soumis à DCMS RR-2002-36-FR, I3S, 2002.

[GFG02] Jean-Marc FÉDOU et Christine GARCIA. Algebraic succession rules. Soumis à Discrete Mathematics. RR-2002-36-FR, I3S, 2002.

[GFM04] E. Formenti and B. Masson. On computing fixed points for generalized sand piles. In proceedings of DMCS'04. TUCS General Pubblication, 32:40-53, June 2004.

[GGHP02] Christine GARCIA, Pavol HELL, et Claudine PEYRAT. Whispering in one orthant. Soumis à Discrete Mathematics. RR-2002-43-FR, I3S, 2002.

[GLic02a] Nicolas LICHIARDOPOL. Broadcast time and Connectivity. Soumis à Discrete Applied Mathematics. RR-2002-46-FR, I3S,
2002.

[GLic02b] Nicolas LICHIARDOPOL. Concerning two conjectures on the set of fixed points of a complete rotation of a cayley digraph. Soumis à Discrete Mathematics.RR-2002-44-FR, I3S, 2002.

[GLic02c] Nicolas LICHIARDOPOL. Multiscattering in constant time. Soumis à Discrete Mathematics. RR-2002-45-FR, I3S, 2002.

[GLS02] San LING et Patrick SOLÉ. Two-weight codes over chain rings and partial differences sets. Soumis à Designs, Codes and Cryptography RR-2002-40-FR, I3S, 2002.

Livres

B. Martin : Codage, cryptologie et applications , Presses Polytechniques Universitaires Romandes, 372 pages, 2004.

G. Cattaneo and E. Formenti and L. Margara. Topological definitions of chaos: applications to cellular automata dynamics . In J. Mazoyer ed., Cellular Automata, chapter 8, Series in Mathematics and its Applications, Kluwer, 1999.

Articles de presse spécialisée

B.Martin : Bien employer la certification, Programmation sous linux, 1/2005: 62-66, 2005

B. Martin : Zertifizierung - die richtige Nützung , Programmieren unter linux,6/2005: 58-62, 2005