1578 search results - page 259 / 316 » Direct Routing: Algorithms and Complexity |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
ASPLOS
2000
ACM
14 years 2 months ago
2000
ACM
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
ISSTA
2000
ACM
14 years 2 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
ALGORITHMICA
2011
13 years 5 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
PODS
2009
ACM
14 years 10 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...