8651 results in Discrete Mathematics, Information Theory and Coding
CPC volume 22 issue 1 Cover and Front matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 07 December 2012, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Improved Mixing Time Bounds for the Thorp Shuffle
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 07 December 2012, pp. 118-132
-
- Article
- Export citation
A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 07 December 2012, pp. 97-111
-
- Article
- Export citation
CPC volume 22 issue 1 Cover and Back matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 07 December 2012, pp. b1-b4
-
- Article
-
- You have access
- Export citation
A NOTE ON THE HAUSDORFF DIMENSION OF SOME LIMINF SETS APPEARING IN SIMULTANEOUS DIOPHANTINE APPROXIMATION
- Part of
-
- Journal:
- Mathematika / Volume 59 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 05 December 2012, pp. 56-64
- Print publication:
- January 2013
-
- Article
- Export citation
ON THE DIOPHANTINE PROPERTIES OF λ-EXPANSIONS
- Part of
-
- Journal:
- Mathematika / Volume 59 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 05 December 2012, pp. 65-86
- Print publication:
- January 2013
-
- Article
- Export citation
CONTINUOUS LOWER BOUNDS FOR MOMENTS OF ZETA AND L-FUNCTIONS
- Part of
-
- Journal:
- Mathematika / Volume 59 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 15 November 2012, pp. 119-128
- Print publication:
- January 2013
-
- Article
- Export citation
Sums of Dilates in p
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 2 / March 2013
- Published online by Cambridge University Press:
- 30 October 2012, pp. 282-293
-
- Article
- Export citation
The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 19 October 2012, pp. 112-117
-
- Article
- Export citation
Hypergraph Independent Sets
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 11 October 2012, pp. 9-20
-
- Article
- Export citation
Probably Intersecting Families are Not Nested
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 09 October 2012, pp. 146-160
-
- Article
- Export citation
Turán and Ramsey Properties of Subcube Intersection Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 03 October 2012, pp. 55-70
-
- Article
- Export citation
Explosive Percolation in Erdős–Rényi-Like Random Graph Processes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 03 October 2012, pp. 133-145
-
- Article
- Export citation
Embedding Spanning Bipartite Graphs of Small Bandwidth
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 03 October 2012, pp. 71-96
-
- Article
- Export citation
CPC volume 21 issue 6 Cover and Front matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 27 September 2012, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 27 September 2012, pp. 952-962
-
- Article
- Export citation
CPC volume 21 issue 6 Cover and Back matter
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 27 September 2012, pp. b1-b2
-
- Article
-
- You have access
- Export citation
THE RESONANCE METHOD FOR LARGE CHARACTER SUMS
- Part of
-
- Journal:
- Mathematika / Volume 59 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 11 September 2012, pp. 87-118
- Print publication:
- January 2013
-
- Article
- Export citation
(k+1)-Cores Have k-Factors
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 11 September 2012, pp. 882-896
-
- Article
- Export citation
Fast Strategies In Maker–Breaker Games Played on Random Boards
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 6 / November 2012
- Published online by Cambridge University Press:
- 10 September 2012, pp. 897-915
-
- Article
- Export citation