default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 29
Volume 29, Number 1, 1995
- John Rhodes, Pascal Weil:
Algebraic and Topological Theory of Languages. 1-44 - Rainer Kemp:
Uniformly Growing Backtrack Trees. 45-73 - Stasys Jukna:
A Note on Read-k Times Branching Programs. 75-83
Volume 29, Number 2, 1995
- Marie-Pierre Béal:
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. 85-103 - Juha Honkala:
On Morphycally Generated Formal Power Series. 105-127 - Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
On Parallel Deletions Applied to a Word. 129-144 - Nguyen Huong Lam:
On Codes Having no Finite Completion. 145-155
Volume 29, Number 3, 1995
- Francine Blanchet-Sadri:
Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k. 157-170 - Helen Cameron, Derick Wood:
Binary Trees, Fringe Thickness and Minimum Path Length. 171-191 - Richard Mijoule:
Fibrations and Recursivity. 193-208 - Roman R. Redziejowski:
Schützenberger-Like Products in Non-Free Monoids. 209-226 - Claude Jard, Guy-Vincent Jourdan, Jean-Xavier Rampon:
On-Line Computations of the Ideal Lattice of Posets. 227-244 - Helmut Prodinger:
Comments on the Analysis of Parameters in a Random Graph Model. 245-253
Volume 29, Number 4, 1995
- Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe:
Analysis of Quickselect: An Algorithm for Order Statistics. 255-276 - Marianne Maksimenko:
Algorithme quadratique de calcul de la solution général d'équation en mots à une variable. 277-284 - T. Tapsoba:
Minimum Complexity of Automatic non Sturmian Sequences. 285-291 - Karim Nour:
Entiers intuitionnistes et entiers classiques en lambda C-calcul. 293-313 - Marc Huou, Jean-Pierre Elloy:
Sémantique du parallélisme et du choix du langage electre. 315-338
Volume 29, Number 5, 1995
- Laurent Rosaz:
Unavoidable Languages, Cuts and Innocent Sets of Words. 339-382 - Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Token Transfer in a Faulty Network. 383-400 - Bruno Courcelle, A. Pariès:
Mineurs d'arbres avec racines. 401-422 - Maciej Slusarek:
Optimal On-Line Coloring of Circular Arc Graphs. 423-429 - Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette:
On-Line Evaluation of Powers Using Euclid's Algorithm. 431-450
Volume 29, Number 6, 1995
- V. B. Balayogan, C. Pandu Rangan:
Parallel Algorithms on Interval Graphs. 451-470 - Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. 471-485 - Dominique Barth, François Pellegrini, André Raspaud, Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs. 487-508 - André Raspaud, Ondrej Sýkora, Imrich Vrto:
Cutwidth of the Bruijn Graph. 509-514 - M. Boffa:
Une condition impliquant toutes les identités rationnelles. 515-518
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.
last updated on 2024-12-22 19:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
