6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
16 - More rings
-
- Book:
- A Computational Introduction to Number Theory and Algebra
- Published online:
- 05 February 2015
- Print publication:
- 04 December 2008, pp 421-464
-
- Chapter
- Export citation
20 - Algorithms for finite fields
-
- Book:
- A Computational Introduction to Number Theory and Algebra
- Published online:
- 05 February 2015
- Print publication:
- 04 December 2008, pp 522-547
-
- Chapter
- Export citation
21 - Deterministic primality testing
-
- Book:
- A Computational Introduction to Number Theory and Algebra
- Published online:
- 05 February 2015
- Print publication:
- 04 December 2008, pp 548-560
-
- Chapter
- Export citation
Efficient validation and construction of border arrays and validation of string matching automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 04 December 2008, pp. 281-297
- Print publication:
- April 2009
-
- Article
- Export citation
Polynomial languages with finite antidictionaries
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 22 November 2008, pp. 269-279
- Print publication:
- April 2009
-
- Article
- Export citation
Directive words of episturmian words: equivalences and normalization
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 22 November 2008, pp. 299-319
- Print publication:
- April 2009
-
- Article
- Export citation
When is an Almost Monochromatic K4 Guaranteed?
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 823-830
-
- Article
- Export citation
Coloured Loop-Erased Random Walk on the Complete Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 727-740
-
- Article
- Export citation
The Hitting Time for the Height of a Random Recursive Tree
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 831-835
-
- Article
- Export citation
B2[g] Sets and a Conjecture of Schinzel and Schmidt
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 741-747
-
- Article
- Export citation
Individual Displacements in Hashing with Coalesced Chains
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 799-814
-
- Article
- Export citation
A Weakening of the Odd Hadwiger's Conjecture
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 815-821
-
- Article
- Export citation
Bounds For The Real Zeros of Chromatic Polynomials
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 749-759
-
- Article
- Export citation
Winning Fast in Sparse Graph Construction Games
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 781-791
-
- Article
- Export citation
On a Form of Coordinate Percolation
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 837-845
-
- Article
- Export citation
A Weighted Generalization of Gao's n + D − 1 Theorem
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 793-798
-
- Article
- Export citation
Dobrushin Conditions and Systematic Scan
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 761-779
-
- Article
- Export citation
A note on dual approximation algorithms for class constrained bin packing problems
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 21 October 2008, pp. 239-248
- Print publication:
- April 2009
-
- Article
- Export citation
Thread algebra for noninterference
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 02 October 2008, pp. 249-268
- Print publication:
- April 2009
-
- Article
- Export citation
On the Connectivity of Random k-th Nearest Neighbour Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 4 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 September 2008, pp. 343-362
-
- Article
- Export citation