Publication:4176809

zbMath0394.62002MaRDI QIDQ4176809

Michael Ian Shamos

Publication date: 1976

zbMATH Keywords

Computational Complexity; Explicit Machine Computation; Geometric Algorithms; Statistics Algorithms

Mathematics Subject Classification ID

62-04: Software, source code, etc. for problems pertaining to statistics

68Q25: Analysis of algorithms and problem complexity

60D05: Geometric probability and stochastic geometry

Related Items

Selection in \(X+Y\) and matrices with sorted rows and columns, Clustering to minimize the maximum intercluster distance, On the average length of Delaunay triangulations, An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems, L-infinity interdistance selection by parametric search, A study on two geometric location problems, A linear time algorithm for a matching problem on the circle, Maintenance of configurations in the plane, The complexity of selection and ranking in X+Y and matrices with sorted columns, Incomplete generalized \(L\)-statistics, On a 2-dimensional equipartition problem, Efficient calculation of the permutation distribution of robust two- sample statistics, Algorithms for bivariate zonoid depth, Multivariate spatial U-quantiles: A Bahadur-Kiefer representation, a Theil-Sen estimator for multiple regression, and a robust dispersion estimator, Unnamed Item