On the state complexity of semi-quantum finite automata

JOURNAL ARTICLE published April 2014 in RAIRO - Theoretical Informatics and Applications

Authors: Shenggen Zheng | Jozef Gruska | Daowen Qiu

Cutwidth of the de Bruijn graph

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: André Raspaud | Ondrej Sýkora | Imrich Vrt'o

Binary trees, fringe thickness and minimum path length

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Helen Cameron | Derick Wood

Token transfer in a faulty network

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Krzysztof Diks | Adam Malinowski | Andrzej Pelc

The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

JOURNAL ARTICLE published 1992 in RAIRO - Theoretical Informatics and Applications

Authors: B. Courcelle

When input-driven pushdown automata meet reversiblity

JOURNAL ARTICLE published October 2016 in RAIRO - Theoretical Informatics and Applications

Authors: Martin Kutrib | Andreas Malcher | Matthias Wendlandt

On the distributed decision-making complexity of the minimum vertex cover problem

JOURNAL ARTICLE published 1996 in RAIRO - Theoretical Informatics and Applications

Authors: Pierluigi Crescenzi | Luca Trevisan

A Generalized Model of PAC Learning and its Applicability

JOURNAL ARTICLE published April 2014 in RAIRO - Theoretical Informatics and Applications

Authors: Thomas Brodag | Steffen Herbold | Stephan Waack

Comments on the analysis of parameters in a Random Graph Model

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Helmut Prodinger

An upper bound on the complexity of recognizable tree languages

JOURNAL ARTICLE published April 2015 in RAIRO - Theoretical Informatics and Applications

Authors: Olivier Finkel | Dominique Lecomte | Pierre Simonnet

Sémantique du parallélisme et du choix du langage Electre

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: M. Huou | J.-P. Elloy

On bandwidth, cutwidth, and quotient graphs

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Dominique Barth | François Pellegrini | André Raspaud | Jean Roman

Moments of an amplitude process in a random walk and approximations : computations and applications

JOURNAL ARTICLE published 1995 in RAIRO - Operations Research

Authors: P. Vallois | C. S. Tapiero

Some results on complexity of μ-calculus evaluation in the black-box model

JOURNAL ARTICLE published January 2013 in RAIRO - Theoretical Informatics and Applications

Authors: Paweł Parys

A note on the number of squares in a partial word with one hole

JOURNAL ARTICLE published October 2009 in RAIRO - Theoretical Informatics and Applications

Authors: Francine Blanchet-Sadri | Robert Mercaş

Transcendence of numbers with an expansion in a subclass of complexity 2n + 1

JOURNAL ARTICLE published July 2006 in RAIRO - Theoretical Informatics and Applications

Authors: Tomi Kärki

On the accepting state complexity of operations on permutation automata

JOURNAL ARTICLE published 2023 in RAIRO - Theoretical Informatics and Applications

Authors: Christian Rauch | Markus Holzer

Editors: H. Bordihn | G. Vaszil | G. Horváth

Analysis of quickselect : an algorithm for order statistics

JOURNAL ARTICLE published 1995 in RAIRO - Theoretical Informatics and Applications

Authors: Hosam M. Mahmoud | Reza Modarres | Robert T. Smythe

Uncountable classical and quantum complexity classes

JOURNAL ARTICLE published April 2018 in RAIRO - Theoretical Informatics and Applications

Authors: Maksims Dimitrijevs | Abuzer Yakaryılmaz

Editors: Henning Bordihn | Benedek Nagy | György Vaszil

The complexity of the travelling repairman problem

JOURNAL ARTICLE published 1986 in RAIRO - Theoretical Informatics and Applications

Authors: Foto Afrati | Stavros Cosmadakis | Christos H. Papadimitriou | George Papageorgiou | Nadia Papakostantinou