Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
In this essay, I examine differences between individual and social play and, in particular, the differences between individual and social play within digital media forms designed ...
Due to fierce industry competition and demand for novelty, games are a fertile research setting for studying interface design, input devices, graphics, social communication and de...
Kevin Keeker, Randy J. Pagulayan, Jonathan Sykes, ...