On the Optimality of Some Set Algorithms
From MaRDI portal
Publication:5659062
DOI10.1145/321724.321730zbMath0246.68008OpenAlexW2082045536MaRDI QIDQ5659062
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321724.321730
Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (15)
A probabilistic distributed algorithm for set intersection and its analysis ⋮ Geometric complexity of some location problems ⋮ A lower bound for the edit-distance problem under an arbitrary cost function ⋮ Finding modes with equality comparisons ⋮ Checking similarity of planar figures ⋮ On genuinely time bounded computations ⋮ A time-space tradeoff for sorting on non-oblivious machines ⋮ Stable set and multiset operations in optimal time and space ⋮ On the complexity of inferring functional dependencies ⋮ Finding Mode Using Equality Comparisons ⋮ A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane ⋮ Simulating probabilistic by deterministic algebraic computation trees ⋮ A probabilistic lower bound for checking disjointness of sets ⋮ Decision trees: Old and new results. ⋮ Lower bounds on probabilistic linear decision trees
This page was built for publication: On the Optimality of Some Set Algorithms
