2924 search results - page 49 / 585 » Lower Bounds in Distributed Computing |
COMPGEOM
1996
ACM
14 years 1 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
ENDM
2010
13 years 9 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
JCB
2002
13 years 8 months ago
2002
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
ISSS
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...