We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...