Automata, Languages and Programming
From MaRDI portal
Publication:5466513
DOI10.1007/b99859zbMath1099.68123OpenAlexW2505584480MaRDI QIDQ5466513
Ely Porat, Ohad Lipsky, Piotr Indyk, Moshe Lewenstein
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Related Items (13)
On the Complexity of Closest Pair via Polar-Pair of Point-Sets ⋮ Approximate matching in the \(L_{\infty }\) metric ⋮ \(L_{1}\) pattern matching lower bound ⋮ The Closest Pair Problem under the Hamming Metric ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics ⋮ Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances ⋮ Hamming Distance Completeness ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ On the Complexity of Closest Pair via Polar-Pair of Point-Sets ⋮ Unnamed Item ⋮ Dominance Product and High-Dimensional Closest Pair under L_infty
This page was built for publication: Automata, Languages and Programming
