205
click to vote
ICALP
16 years 2 days 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 ...
188
click to vote
ICALP
16 years 2 days 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...
185
click to vote
ICALP
16 years 2 days ago
2004 Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
183
click to vote
ICALP
16 years 2 days 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 ...
180
click to vote
ICALP
16 years 2 days 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...
|
Programming Languages