2924 search results - page 40 / 585 » Lower Bounds in Distributed Computing |
110
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
121
click to vote
JOC
2008
15 years 1 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
119
click to vote
ENDM
2010
14 years 8 months ago
2010
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
ICALP
1999
Springer
15 years 6 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
121
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...