The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
We propose to return to the roots of Artificial/Computational Intelligence applicability to board games domain by attempting to mimic human way of playing (or human intelligence ...
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the c...