6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
I - Basic Logic
-
- Book:
- Lectures in Logic and Set Theory
- Published online:
- 16 January 2010
- Print publication:
- 09 January 2003, pp 1-204
-
- Chapter
- Export citation
Lower Bounds for Las Vegas Automata by Information Theory
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 39-49
- Print publication:
- January 2003
-
- Article
- Export citation
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 51-66
- Print publication:
- January 2003
-
- Article
- Export citation
Fixpoints, games and the difference hierarchy
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 1-15
- Print publication:
- January 2003
-
- Article
- Export citation
Some algorithms to compute the conjugates of Episturmian morphisms
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 85-104
- Print publication:
- January 2003
-
- Article
- Export citation
On the Analysis of Petri Nets and their Synthesis from Process Languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 17-38
- Print publication:
- January 2003
-
- Article
- Export citation
Wadge Degrees of ω-Languages of Deterministic Turing Machines
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 67-83
- Print publication:
- January 2003
-
- Article
- Export citation
The Wiener Index of Random Trees
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 587-597
-
- Article
- Export citation
Triangle-Freeness is Hard to Detect
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 549-569
-
- Article
- Export citation
Information Loss in Top to Random Shuffling
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 607-627
-
- Article
- Export citation
Graphs without Large Complete Minors are Quasi-Random
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 571-585
-
- Article
- Export citation
Two Short Proofs Concerning Tree-Decompositions
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 541-547
-
- Article
- Export citation
Distances in Random Induced Subgraphs of Generalized n-Cubes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 599-605
-
- Article
- Export citation
An Improved Upper Bound for the Hexagonal Lattice Site Percolation Critical Probability
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 6 / November 2002
- Published online by Cambridge University Press:
- 21 November 2002, pp. 629-643
-
- Article
- Export citation
A Sharp Threshold for Network Reliability
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 465-474
-
- Article
- Export citation
The Minesweeper Game: Percolation and Complexity
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 487-499
-
- Article
- Export citation
Poisson–Dirichlet and GEM Invariant Distributions for Split-and-Merge Transformations of an Interval Partition
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 501-514
-
- Article
- Export citation
Lower and Upper Bounds for the Time Constant of First-Passage Percolation
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 433-445
-
- Article
- Export citation
The Residues modulo m of Products of Random Integers
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 529-540
-
- Article
- Export citation
Permutations with Restricted Cycle Structure and an Algorithmic Application
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 5 / September 2002
- Published online by Cambridge University Press:
- 09 October 2002, pp. 447-464
-
- Article
- Export citation