6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 277-286
- Print publication:
- May 2001
-
- Article
- Export citation
Les types de données syntaxiques du système ${\cal F}$
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 207-221
- Print publication:
- May 2001
-
- Article
- Export citation
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 287-309
- Print publication:
- May 2001
-
- Article
- Export citation
Number-Conserving Reversible Cellular Automata and Their Computation-Universality
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 239-258
- Print publication:
- May 2001
-
- Article
- Export citation
Les I-types du système ${\cal F}$
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 223-237
- Print publication:
- May 2001
-
- Article
- Export citation
Division in logspace-uniform NC1
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 259-275
- Print publication:
- May 2001
-
- Article
- Export citation
Concentration of Measure for Products of Markov Kernels and Graph Products via Functional Inequalities
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 12 April 2001, pp. 1-28
-
- Article
- Export citation
Simulated Annealing and Graph Colouring
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 12 April 2001, pp. 29-40
-
- Article
- Export citation
A Large Deviation Result on the Number of Small Subgraphs of a Random Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 12 April 2001, pp. 79-94
-
- Article
- Export citation
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 12 April 2001, pp. 41-77
-
- Article
- Export citation
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 489-511
-
- Article
- Export citation
On Restricted Sums
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 513-518
-
- Article
- Export citation
Excluding Minors in Nonplanar Graphs of Girth at Least Five
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 573-585
-
- Article
- Export citation
On Compound Poisson Approximation for Sequence Matching
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 529-548
-
- Article
- Export citation
The Maximum Degree of a Random Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 549-572
-
- Article
- Export citation
Expected Number of Distinct Part Sizes in a Random Integer Composition
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 519-527
-
- Article
- Export citation
Locally Thin Set Families
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 6 / November 2000
- Published online by Cambridge University Press:
- 09 April 2001, pp. 481-488
-
- Article
- Export citation
PAC Learning under Helpful Distributions
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 2 / March 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 129-148
- Print publication:
- March 2001
-
- Article
- Export citation
On the number of iterations required by Von Neumann addition
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 2 / March 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 187-206
- Print publication:
- March 2001
-
- Article
- Export citation
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 2 / March 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 149-162
- Print publication:
- March 2001
-
- Article
- Export citation