740 search results - page 19 / 148 » Lower bounds for Buchsbaum* complexes |
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
103
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
103
click to vote
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
14 years 11 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...