6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Matroid Automorphisms and Symmetry Groups
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 01 March 2000, pp. 105-123
-
- Article
- Export citation
A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 01 March 2000, pp. 97-104
-
- Article
- Export citation
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 157-171
- Print publication:
- March 2000
-
- Article
- Export citation
Spanning Subgraphs of Random Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 01 March 2000, pp. 125-148
-
- Article
- Export citation
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 87-97
- Print publication:
- March 2000
-
- Article
- Export citation
Three generators for minimal writing-space computations
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 131-138
- Print publication:
- March 2000
-
- Article
- Export citation
Asynchronous sliding block maps
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 139-156
- Print publication:
- March 2000
-
- Article
- Export citation
Iteration of rational transductions
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 99-129
- Print publication:
- March 2000
-
- Article
- Export citation
The Expected Norm of Random Matrices
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 01 March 2000, pp. 149-166
-
- Article
-
- You have access
- Export citation
Random Star Processes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 33-43
-
- Article
- Export citation
Succession rules and Deco polyominoes
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 1-14
- Print publication:
- January 2000
-
- Article
- Export citation
The Choice Number of Dense Random Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 19-26
-
- Article
- Export citation
Threshold Circuits for Iterated Matrix Product and Powering
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 39-46
- Print publication:
- January 2000
-
- Article
- Export citation
Bipartite Subgraphs and the Smallest Eigenvalue
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 1-12
-
- Article
- Export citation
A Note on Sequential Selection from Permutations
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 13-17
-
- Article
- Export citation
A characterization of poly-slender context-free languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 77-86
- Print publication:
- January 2000
-
- Article
- Export citation
Proof of the Van den Berg–Kesten Conjecture
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 27-32
-
- Article
- Export citation
Algorithms for Colouring Random k-colourable Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 01 January 2000, pp. 45-77
-
- Article
- Export citation
On codes with finite interpreting delay: a defect theorem
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 47-59
- Print publication:
- January 2000
-
- Article
- Export citation
Construction of Very Hard Functions for Multiparty Communication Complexity
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 1 / January 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 61-75
- Print publication:
- January 2000
-
- Article
- Export citation