3208 search results - page 390 / 642 » A Lower Bound for Primality |
151
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
192
click to vote
PODS
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
163
click to vote
SIGIR
1992
ACM
15 years 10 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
152
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
141
click to vote
FSTTCS
1990
Springer
15 years 10 months ago
1990
Springer
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...