Search Sciweavers | Sciweavers

126 search results - page 2 / 26

» Decreasing Diagrams II

click to vote

COMBINATORICS
2007

99views more COMBINATORICS 2007»

Permutations Without Long Decreasing Subsequences and Random Matrices

13 years 10 months ago

Download www.combinatorics.org

We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...

Piotr Sniady

claim paper

Read More »

click to vote

DCG
2007

91views more DCG 2007»

Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?

13 years 10 months ago

Download webhome.cs.uvic.ca

We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Speciﬁcally, for any n-Venn diagram of conve...

Jeremy Carroll, Frank Ruskey, Mark Weston

claim paper

Read More »

click to vote

CORR
2010
Springer

97views Education» more CORR 2010»

Bulking II: Classifications of Cellular Automata

13 years 11 months ago

Download hal.archives-ouvertes.fr

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...

Marianne Delorme, Jacques Mazoyer, Nicolas Ollinge...

claim paper

Read More »

click to vote

SIGCSE
2000
ACM

99views Education» more SIGCSE 2000»

Do visualizations improve program comprehensibility? experiments with control structure diagrams for Java

14 years 3 months ago

Download www.eng.auburn.edu

T. Dean Hendrix, James H. Cross II, Saeed Maghsood...

claim paper

Read More »