Login / Signup
O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube.
Sajal K. Das
Maria Cristina Pinotti
Published in:
J. Parallel Distributed Comput. (1998)
Keyphrases
</>
min max
data structure
worst case
orders of magnitude
theoretical analysis
suffix tree
computationally efficient
times faster
max min
computational complexity
significant improvement
matrix multiplication
image processing
pairwise
computational cost