Journals in DBLP
ITA Jean-Paul Allouche , F. Dress Tours de Hanoï et automates. [Citation Graph (0, 0)][DBLP ] Journal ] J.-C. Fournier Pour en finir avec la dérécursivation du problème de Tours de Hanoï. [Citation Graph (0, 0)][DBLP ] Journal ] Edward Ochmanski , Wojciech Penczek Inevitability in diamond processes. [Citation Graph (0, 0)][DBLP ] Journal ] Jean-Camille Birget Two-way automaton computations. [Citation Graph (0, 0)][DBLP ] Journal ] Do Long Van , D. G. Thomas , K. G. Subramanian , Rani Siromoney Bi-infinitary codes. [Citation Graph (0, 0)][DBLP ] Journal ] Rainer Parchmann , Jürgen Duske The structure of index sets and reduced indexed grammars. [Citation Graph (0, 0)][DBLP ] Journal ] Habib Abdulrab Solving word equations. [Citation Graph (0, 0)][DBLP ] Journal ] Pierre Jouvelot , P. Feautrier Parallélisation sémantique. [Citation Graph (0, 0)][DBLP ] Journal ] A. Paugam Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander. [Citation Graph (0, 0)][DBLP ] Journal ] Carlo Gaibisso , Giorgio Gambosi , Maurizio Talamo A partially persistent data structure for the set-union problem. [Citation Graph (0, 0)][DBLP ] Journal ] Aldo de Luca , Stefano Varricchio A combinatorial theorem on p-power-free words and an application to semigroups. [Citation Graph (0, 0)][DBLP ] Journal ] Ker-I Ko A note on separating the relativized polynomial time hierarchy by immune sets. [Citation Graph (0, 0)][DBLP ] Journal ] M. T. Milani , D. A. Workman Epsilon weak precedence grammars and languages. [Citation Graph (0, 0)][DBLP ] Journal ] Joost Engelfriet , George Leih Complexity of boundary graph languages. [Citation Graph (0, 0)][DBLP ] Journal ] Laurent Pierre , Jean-Marc Farinone Context-free languages with rational index in Theta(nlambda ) for algebraic numbers lambda. [Citation Graph (0, 0)][DBLP ] Journal ] Karel Culik II , Juhani Karhumäki Loops in automata and HDTOL relations. [Citation Graph (0, 0)][DBLP ] Journal ] Didier Caucal Graphes canoniques de graphes algébriques. [Citation Graph (0, 0)][DBLP ] Journal ] Carole Delporte-Gallet , Hugues Fauconnier , Maurice Nivat Parallélisation d'algorithmes avec un nombre fixe de processeurs. [Citation Graph (0, 0)][DBLP ] Journal ] Guy Viry Factorisation sur Z[X] des polynômes de degré élevé à l'aide d'un monomorphisme. [Citation Graph (0, 0)][DBLP ] Journal ] Giovanna Guaiana , Antonio Restivo , Sergio Salemi Complete subgraphs of bipartite graphs and applications to trace languages. [Citation Graph (0, 0)][DBLP ] Journal ] Maurice Boffa Une remarque sur les systèmes complets d'identités rationnelles. [Citation Graph (0, 0)][DBLP ] Journal ] G. Gagliardi , Sauro Tulipani On algebraic specifications of computable algebras with the discriminator technique. [Citation Graph (0, 0)][DBLP ] Journal ] Nguyen Huong Lam , Do Long Van On a class of infiinitary codes. [Citation Graph (0, 0)][DBLP ] Journal ] Jean Neraud Elementariness of a finite set of words is co-NP-complete. [Citation Graph (0, 0)][DBLP ] Journal ] Ulrich Huckenbeck On geometric automata which can nondeterminstically choose auxiliary points. [Citation Graph (0, 0)][DBLP ] Journal ] Manfred Kudlek Comparison of basic language generating devices (non-deterministic systems). [Citation Graph (0, 0)][DBLP ] Journal ] Robert Cori , Maria Rosaria Formisano Partially Abelian squarefree words. [Citation Graph (0, 0)][DBLP ] Journal ] Francine Blanchet-Sadri On dot-depth two. [Citation Graph (0, 0)][DBLP ] Journal ] F. Morain , J. Olivos Speeding up the computations on an elliptic curve using addition-subtraction chains. [Citation Graph (0, 0)][DBLP ] Journal ] Bertrand Le Saëc Saturating right congruences. [Citation Graph (0, 0)][DBLP ] Journal ] Laureano González-Vega , Henri Lombardi , Tomás Recio , Marie-Françoise Roy Spécialisation de la suite de Sturm et sous-résulants. [Citation Graph (0, 0)][DBLP ] Journal ] 