227
click to vote
ICALP
16 years 23 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 ...
224
Voted
ICALP
16 years 23 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...
212
click to vote
ICALP
16 years 23 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...
212
click to vote
ICALP
16 years 23 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 ...
205
click to vote
ICALP
16 years 23 days ago
2004 Springer 
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
|
Programming Languages