Computing dominances in \(E^ n\)
From MaRDI portal
Publication:1178238
DOI10.1016/0020-0190(91)90071-OzbMath0738.68080OpenAlexW2049153008MaRDI QIDQ1178238
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90071-o
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (15)
Parallel skyline queries ⋮ In-place algorithms for computing (Layers of) maxima ⋮ K-dominance in multidimensional data: theory and applications ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Unnamed Item ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems ⋮ All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time ⋮ Unnamed Item ⋮ More on change-making and related problems ⋮ Hamming Distance Completeness ⋮ Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem ⋮ K-Dominance in Multidimensional Data: Theory and Applications ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Dominance Product and High-Dimensional Closest Pair under L_infty
Cites Work
This page was built for publication: Computing dominances in \(E^ n\)
