6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 4 / October 2012
- Published online by Cambridge University Press:
- 30 July 2012, pp. 459-460
- Print publication:
- October 2012
-
- Article
-
- You have access
- Export citation
Are Stable Instances Easy?
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 26 July 2012, pp. 643-660
-
- Article
- Export citation
CPC volume 21 issue 5 Cover and Back matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 26 July 2012, pp. b1-b3
-
- Article
-
- You have access
- Export citation
CPC volume 21 issue 5 Cover and Front matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 26 July 2012, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Note on the Smallest Root of the Independence Polynomial
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 18 July 2012, pp. 1-8
-
- Article
- Export citation
A Graph Polynomial for Independent Sets of Bipartite Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 10 July 2012, pp. 695-714
-
- Article
- Export citation
Complexity of Ising Polynomials
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 04 July 2012, pp. 743-772
-
- Article
- Export citation
A Generalization of the Erdős–Turán Law for the Order of Random Permutation
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 03 July 2012, pp. 715-733
-
- Article
- Export citation
Longest Path Distance in Random Circuits
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 03 July 2012, pp. 856-881
-
- Article
- Export citation
Probabilistic operational semantics for the lambda calculus
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 3 / July 2012
- Published online by Cambridge University Press:
- 22 June 2012, pp. 413-450
- Print publication:
- July 2012
-
- Article
- Export citation
Undecidability of infinite post correspondence problem for instances of size 8
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 3 / July 2012
- Published online by Cambridge University Press:
- 22 June 2012, pp. 451-457
- Print publication:
- July 2012
-
- Article
- Export citation
On biautomata∗
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 4 / October 2012
- Published online by Cambridge University Press:
- 19 June 2012, pp. 573-592
- Print publication:
- October 2012
-
- Article
- Export citation
CPC volume 21 issue 4 Cover and Front matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 07 June 2012, pp. f1-f2
-
- Article
-
- You have access
- Export citation
CPC volume 21 issue 4 Cover and Back matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 07 June 2012, pp. b1-b3
-
- Article
-
- You have access
- Export citation
On the decidability of semigroup freeness∗
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 3 / July 2012
- Published online by Cambridge University Press:
- 29 May 2012, pp. 355-399
- Print publication:
- July 2012
-
- Article
- Export citation
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 14 May 2012, pp. 661-682
-
- Article
- Export citation
Getting a Directed Hamilton Cycle Two Times Faster
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 04 May 2012, pp. 773-801
-
- Article
- Export citation
Strong Convergence of Partial Match Queries in Random Quadtrees
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 27 April 2012, pp. 683-694
-
- Article
- Export citation
Unit Distances in Three Dimensions
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 25 April 2012, pp. 597-610
-
- Article
- Export citation
Distance Preserving Ramsey Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 23 April 2012, pp. 554-581
-
- Article
- Export citation