Search dblp for Publications

export results for "toc:db/journals/ita/ita21.bht:"

 download as .bib file

@article{DBLP:journals/ita/Arsac87,
  author       = {Jacques J. Arsac},
  title        = {Algorithmes pour V{\'{e}}rifier La Conjecture De Syracuse},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {3--9},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100031},
  doi          = {10.1051/ITA/1987210100031},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Arsac87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/BoassonP87,
  author       = {Luc Boasson and
                  Antoine Petit},
  title        = {Langages Alg{\'{e}}briques D{\'{e}}terministes Non G{\'{e}}n{\'{e}}rateurs},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {41--57},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100411},
  doi          = {10.1051/ITA/1987210100411},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/BoassonP87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Bonneau87,
  author       = {Pierre G. Bonneau},
  title        = {Poids Et {\'{E}}quivalence Des Codes Lin{\'{e}}aires},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {331--339},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210303311},
  doi          = {10.1051/ITA/1987210303311},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Bonneau87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Bordat87,
  author       = {Jean Paul Bordat},
  title        = {Complexit{\'{e}} De Probl{\`{e}}mes Li{\'{e}}s Aux Graphes
                  Sans Circuit},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {181--197},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210201811},
  doi          = {10.1051/ITA/1987210201811},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Bordat87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Chemillier87,
  author       = {Marc Chemillier},
  title        = {Mono{\"{\i}}de Libre Et Musique Premi{\`{e}}re Partie: Les Musiciens
                  Ont-Ils Besoin Des Math{\'{e}}matiques?},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {341--371},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210303411},
  doi          = {10.1051/ITA/1987210303411},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Chemillier87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Chemillier87a,
  author       = {Marc Chemillier},
  title        = {Mono{\"{\i}}de Libre Et Musique: Deuxi{\`{e}}me Partie},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {4},
  pages        = {379--417},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210403791},
  doi          = {10.1051/ITA/1987210403791},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Chemillier87a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/CourcelleG87,
  author       = {Bruno Courcelle and
                  Jean H. Gallier},
  title        = {Decidable Subcases of The Equivalence Problem for Recursive Program
                  Schemes},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {245--286},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210302451},
  doi          = {10.1051/ITA/1987210302451},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/CourcelleG87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/HelaryMR87,
  author       = {Jean{-}Michel H{\'{e}}lary and
                  Aomar Maddi and
                  Michel Raynal},
  title        = {Calcul R{\'{e}}parti D'un Extr{\'{e}}mum Et Du Routage Associ{\'{e}}
                  Dans Un R{\'{e}}seau Quelconque},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {223--244},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210302231},
  doi          = {10.1051/ITA/1987210302231},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/HelaryMR87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/KatajainenN87,
  author       = {Jyrki Katajainen and
                  Olli Nevalainen},
  title        = {An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs
                  in L\({}_{\mbox{p}}\) Metrics},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {199--215},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210201991},
  doi          = {10.1051/ITA/1987210201991},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/KatajainenN87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/KoblerSW87,
  author       = {Johannes K{\"{o}}bler and
                  Uwe Sch{\"{o}}ning and
                  Klaus W. Wagner},
  title        = {The Difference and Truth-Table Hierarchies for {NP}},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {4},
  pages        = {419--435},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210404191},
  doi          = {10.1051/ITA/1987210404191},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/KoblerSW87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Krob87,
  author       = {Daniel Krob},
  title        = {Codes Limites Et Factorisations Finies Du Mono{\"{\i}}de Libre},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {4},
  pages        = {437--467},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210404371},
  doi          = {10.1051/ITA/1987210404371},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Krob87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Latteux87,
  author       = {Michel Latteux},
  title        = {Sur Les Ensembles Lin{\'{e}}aires},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {33--40},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100331},
  doi          = {10.1051/ITA/1987210100331},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Latteux87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/LobsteinC87,
  author       = {Antoine Lobstein and
                  G{\'{e}}rard D. Cohen},
  title        = {Sur La Complexit{\'{e}} D'un Probl{\`{e}}me De Codage},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {25--32},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100251},
  doi          = {10.1051/ITA/1987210100251},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/LobsteinC87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Louchard87,
  author       = {Guy Louchard},
  title        = {Exact and Asymptotic Distributions in Digital and Binary Search Trees},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {4},
  pages        = {479--495},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210404791},
  doi          = {10.1051/ITA/1987210404791},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Louchard87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Marchetti-SpaccamelaP87,
  author       = {Alberto Marchetti{-}Spaccamela and
                  Antonella Pelaggi},
  title        = {Worst Case Analysis of Two Heuristics for The Set Partitioning Problem},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {11--23},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100111},
  doi          = {10.1051/ITA/1987210100111},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Marchetti-SpaccamelaP87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Mery87,
  author       = {Dominique M{\'{e}}ry},
  title        = {M{\'{e}}thode Axiomatique Pour Les Propri{\'{e}}t{\'{e}}s
                  De Fatalit{\'{e}} Des Programmes Parall{\`{e}}les},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {287--322},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210302871},
  doi          = {10.1051/ITA/1987210302871},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Mery87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Naudin87,
  author       = {Patrice Naudin},
  title        = {Comparaison Et {\'{E}}quivalence De S{\'{e}}mantiques Pour
                  Les Sch{\'{e}}mas De Programmes Non D{\'{e}}terministes},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {1},
  pages        = {59--91},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210100591},
  doi          = {10.1051/ITA/1987210100591},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Naudin87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Ryslinkova87,
  author       = {Jana Ryslinkov{\'{a}}},
  title        = {Church-Rosser Property and Decidability of Monadic Theories of Unary
                  Algebras},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {3},
  pages        = {323--329},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210303231},
  doi          = {10.1051/ITA/1987210303231},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Ryslinkova87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Schwer87,
  author       = {Sylviane R. Schwer},
  title        = {D{\'{e}}pliage D'un Graphe Pointe En Un Cactus},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {4},
  pages        = {469--477},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210404691},
  doi          = {10.1051/ITA/1987210404691},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Schwer87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Staiger87,
  author       = {Ludwig Staiger},
  title        = {Sequential Mappings of omega-Languages},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {147--173},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210201471},
  doi          = {10.1051/ITA/1987210201471},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Staiger87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Terlutte87,
  author       = {Alain Terlutte},
  title        = {Sur Les Centres De Dol-Languages},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {137--145},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210201371},
  doi          = {10.1051/ITA/1987210201371},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Terlutte87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Toran87,
  author       = {Jacobo Tor{\'{a}}n},
  title        = {On The Complexity of Computable Real Sequences},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {175--180},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210201751},
  doi          = {10.1051/ITA/1987210201751},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Toran87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Zielonka87,
  author       = {Wieslaw Zielonka},
  title        = {Notes on Finite Asynchronous Automata},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {21},
  number       = {2},
  pages        = {99--135},
  year         = {1987},
  url          = {https://doi.org/10.1051/ita/1987210200991},
  doi          = {10.1051/ITA/1987210200991},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Zielonka87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.