Selecting the Kth Element in X + Y and X₁ + X₂ + \cdots + X_m
From MaRDI portal
Publication:4154059
DOI10.1137/0207013zbMATH Open0375.68022OpenAlexW2040895999MaRDI QIDQ4154059FDOQ4154059
Authors: Donald B. Johnson, Tetsuo Mizoguchi
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207013
Cited In (32)
- eummd
- Optimal algorithms for generalized searching in sorted matrices
- The complexity of the \(K\)th largest subset problem and related problems
- EuMMD: efficiently computing the MMD two-sample test statistic for univariate data
- A linear-time algorithm for solving continuous maximin knapsack problems
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Selection in monotone matrices and computing k th nearest neighbors
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- A linear time algorithm for a matching problem on the circle
- Algorithm 1034: an accelerated algorithm to compute the \(Q_n\) robust statistic, with corrections to constants
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- Weighted median algorithms for \(L_ 1\) approximation
- Generating the best \(K\) sequences in relocation problems
- Simple characterizations of \(P(\# P)\) and complete problems
- Algorithm 616: fast computation of the Hodges-Lehmann location estimator
- The Kantorovich metric for probability measures on the circle
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- A simple and competitive estimator of location
- Weighted selectin for the multiset x∓xwith application to r–estimates and associated confidence limits
- Incomplete generalized \(L\)-statistics
- Selection in \(X+Y\) and matrices with sorted rows and columns
- Efficient calculation of hodges-lehmann estimators of location
- The complexity of searching in \(X+Y\) and other multisets
- On search over rationals
- Complexity of selection in \(X+Y\)
- A routing and scheduling approach to rail transportation of hazardous materials with demand due dates
- A robust scale estimator based on pairwise means
- A parallel selection algorithm
- The stochastic linear continuous type knapsack problem: A generalized P model
- Online analysis of time series by the \(Q_n\) estimator
This page was built for publication: Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154059)