Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...