Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
The paper identies some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
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...