Skip to contents

  3. Comin, Carlo [Author] ; Paris Est [Contributor]; Università degli studi di Trento (Trentin, Italie) [Contributor]; Vialette, Stéphane [Contributor]; Rizzi, Romeo [Contributor]

    Complexité dans les Jeux Infinis sur les Graphes et les Réseaux de Contraintes Temporelles ; Complexity in Infinite Games on Graphs and Temporal Constraint Networks

    Thesis
    View online
    Schließen
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    theses.fr, 2017-03-20

  4. Parshina, Olga [Author] ; Lyon [Contributor]; Sobolev Institute of Mathematics [Contributor]; Zamboni, Luca [Contributor]; Avgusinovich, Sergey [Contributor]

    Structures périodiques en mots morphiques et en colorations de graphes circulants infinis ; Periodic structures in morphic words and in colorings of infinite circulant graphs ; ПЕРИОДИЧЕСКИЕ СТРУКТУРЫ В МОРФИЧЕСКИХ СЛОВАХ И РАСКРАСКАХ БЕСКОНЕЧНЫХ ЦИРКУЛЯНТНЫХ ГРАФОВ

    Thesis
    View online
    Schließen
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    theses.fr, 2019-05-29

  6. Ben-Hamou, Anna [Author] ; Sorbonne Paris Cité [Contributor]; Boucheron, Stéphane [Contributor]; Salez, Justin [Contributor]

    Concentration et compression sur alphabets infinis, temps de mélange de marches aléatoires sur des graphes aléatoires ; Concentration and compression over infinite alphabets, mixing times of random walks on random graphs

    Thesis
    View online
    Schließen
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    theses.fr, 2016-09-15

  16. Laborde, Jean-Marie

    Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics: L'Hypercube Infini Et La Connexite Dans Les Graphes Infinis

    Articles
    View online
    Schließen
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Elsevier, 1983

    Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics