453 search results - page 39 / 91 » Tight bounds for the partial-sums problem |
COMBINATORICA
2007
13 years 8 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We describe a distributed algorithm for solving the rendezvous problem based on consensus protocols. We extend our previous work by considering the case when the evolution of t...
SPAA
1993
ACM
14 years 17 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...