Our work is a fundamental study of the notion of approximation in Q-categories and in (U, Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, appro...
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
As the explosive growth of the ISM band usage continues, there are many scenarios where different systems operate in the same place at the same time. One of growing concerns is th...
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...