179 search results - page 8 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
SPAA
2004
ACM
14 years 26 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
TALG
2010
13 years 5 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
TPDS
1998
13 years 7 months ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
ISPAN
2002
IEEE
14 years 11 days ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...