6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Weakly maximal decidable structures
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 1 / January 2008
- Published online by Cambridge University Press:
- 18 January 2008, pp. 137-145
- Print publication:
- January 2008
-
- Article
- Export citation
Hierarchies of function classes defined by the first-value operator
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 25 December 2007, pp. 253-270
- Print publication:
- April 2008
-
- Article
- Export citation
On an algorithm to decide whether a free group is a free factor of another
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 20 December 2007, pp. 395-414
- Print publication:
- April 2008
-
- Article
- Export citation
Inf-datalog, Modal Logic and Complexities
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 20 December 2007, pp. 1-21
- Print publication:
- January 2009
-
- Article
- Export citation
Equations on partial words
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 20 December 2007, pp. 23-39
- Print publication:
- January 2009
-
- Article
- Export citation
On Critical exponents in fixed points of k-uniform binary morphisms
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 20 December 2007, pp. 41-68
- Print publication:
- January 2009
-
- Article
- Export citation
Hyper-minimizing minimized deterministic finite state automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 20 December 2007, pp. 69-94
- Print publication:
- January 2009
-
- Article
- Export citation
D0L sequence equivalence is in P for fixed alphabets
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 13 December 2007, pp. 361-374
- Print publication:
- April 2008
-
- Article
- Export citation
Binary operations on automatic functions
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 13 December 2007, pp. 217-236
- Print publication:
- April 2008
-
- Article
- Export citation
State complexity of cyclic shift
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 13 December 2007, pp. 335-360
- Print publication:
- April 2008
-
- Article
- Export citation
A morphic approach to combinatorial games: the Tribonacci case
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 13 December 2007, pp. 375-393
- Print publication:
- April 2008
-
- Article
- Export citation
On the Laplacian Eigenvalues of Gn,p
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 923-946
-
- Article
- Export citation
Poisson Representation of a Ewens Fragmentation Process
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 819-827
-
- Article
- Export citation
Regular Partitions of Hypergraphs: Regularity Lemmas
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 833-885
-
- Article
- Export citation
Regular Partitions of Hypergraphs: Counting Lemmas
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 887-901
-
- Article
- Export citation
Teasing Apart Two Trees
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 903-922
-
- Article
- Export citation
Graphs with Large Girth Not Embeddable in the Sphere
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 829-832
-
- Article
- Export citation
Distance Hereditary Graphs and the Interlace Polynomial
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 947-973
-
- Article
- Export citation
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 25 September 2007, pp. 237-252
- Print publication:
- April 2008
-
- Article
- Export citation
Learning tree languages from text
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 41 / Issue 4 / October 2007
- Published online by Cambridge University Press:
- 25 September 2007, pp. 351-374
- Print publication:
- October 2007
-
- Article
- Export citation