6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 475-486
-
- Article
- Export citation
Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 515-528
-
- Article
- Export citation
Integer Partitions, Tilings of 2D-gons and Lattices
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 4 / October 2002
- Published online by Cambridge University Press:
- 15 February 2003, pp. 389-399
- Print publication:
- October 2002
-
- Article
- Export citation
On Shuffle Ideals
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 4 / October 2002
- Published online by Cambridge University Press:
- 15 February 2003, pp. 359-384
- Print publication:
- October 2002
-
- Article
- Export citation
On a characteristic property of ARNOUX–RAUZY sequences
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 4 / October 2002
- Published online by Cambridge University Press:
- 15 February 2003, pp. 385-388
- Print publication:
- October 2002
-
- Article
- Export citation
About the decision of reachability for register machines
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 4 / October 2002
- Published online by Cambridge University Press:
- 15 February 2003, pp. 341-358
- Print publication:
- October 2002
-
- Article
- Export citation
An Upper Bound on the Space Complexity of Random Formulae in Resolution
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 36 / Issue 4 / October 2002
- Published online by Cambridge University Press:
- 15 February 2003, pp. 329-339
- Print publication:
- October 2002
-
- Article
- Export citation
Bonferroni-Type Inequalities via Chordal Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 349-351
-
- Article
- Export citation
Quickselect and the Dickman Function
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 353-371
-
- Article
- Export citation
Constructing Trees in Graphs whose Complement has no K2,s
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 343-347
-
- Article
- Export citation
Pattern Avoidance and Overlap in Strings
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 393-402
-
- Article
- Export citation
A Note on Rough Isometry Invariance of Resistance
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 427-432
-
- Article
- Export citation
Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 373-392
-
- Article
- Export citation
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 323-341
-
- Article
- Export citation
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 4 / July 2002
- Published online by Cambridge University Press:
- 06 September 2002, pp. 403-426
-
- Article
- Export citation
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 3 / May 2002
- Published online by Cambridge University Press:
- 12 July 2002, pp. 249-261
-
- Article
- Export citation
Exact Expectations and Distributions for the Random Assignment Problem
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 3 / May 2002
- Published online by Cambridge University Press:
- 10 July 2002, pp. 217-248
-
- Article
- Export citation
Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 3 / May 2002
- Published online by Cambridge University Press:
- 10 July 2002, pp. 299-309
-
- Article
- Export citation
Packing Trees into the Complete Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 3 / May 2002
- Published online by Cambridge University Press:
- 10 July 2002, pp. 263-272
-
- Article
- Export citation
Permutation Pseudographs and Contiguity
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 3 / May 2002
- Published online by Cambridge University Press:
- 10 July 2002, pp. 273-298
-
- Article
- Export citation