"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
- A new system of curriculum evaluation of formative assessment has been established in secondary education system in China for seven years. Attention has been given to teaching an...
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....