186
click to vote
ICALP
15 years 11 months ago
2004 Springer 
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
178
click to vote
ICALP
15 years 11 months ago
2004 Springer 
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
170
click to vote
ICALP
15 years 11 months ago
2004 Springer 
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
167
click to vote
ICALP
15 years 11 months ago
2004 Springer 
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
166
click to vote
ICALP
15 years 11 months ago
2004 Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
|
Programming Languages