Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
In studying the relationship between risk factors and breast cancer, the growth patterns of fat pads and glandular tissues are considered as important biomarkers. The aim of this ...
Yimo Tao, Jianhua Xuan, Matthew T. Freedman, Glori...