The following pages link to Computing dominances in \(E^ n\) (Q1178238):
Displaying 16 items.
- Parallel skyline queries (Q269332) (← links)
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066) (← links)
- More on change-making and related problems (Q2051861) (← links)
- K-dominance in multidimensional data: theory and applications (Q2173457) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
- Computation of Non-dominated Points Using Compact Voronoi Diagrams (Q3404431) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- (Q5091170) (← links)
- K-Dominance in Multidimensional Data: Theory and Applications (Q5111754) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- (Q5874497) (← links)
