2084 search results - page 104 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
137
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
131
click to vote
ALGORITHMICA
2004
15 years 2 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
119
Voted
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
129
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
120
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...