scientific article; zbMATH DE number 962463

MaRDI QIDQ5690734zbMATH OpenFDO

Authors Xunrang Gu, Yuzhang Zhu

Publication date 27 April 1997

zbMATH Keywords

O(f(n))uniform cost criterionworst-case complexity

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Probabilistic methods, stochastic differential equations (65C99) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• Bit complexity of order statistics on a distributed star network
• The recursive structure of some ordering problems
• scientific article; zbMATH DE number 3947421

Cited in

(12)

• Order statistics and estimating cardinalities of massive data sets
• Complexity of min-max subsequence problems
• Bit complexity of order statistics on a distributed star network
• A note on counting independent terms in asymptotic expressions of computational complexity
• Order Statistics in the Farey Sequences in Sublinear Time
• scientific article; zbMATH DE number 3947421 (Why is no real title available?)
• scientific article; zbMATH DE number 4090789 (Why is no real title available?)
• Stably Computing Order Statistics with Arithmetic Population Protocols
• Three and One Questions to Dr. B. Mirkin About Complexity Statistics
• Algorithmic Number Theory
• Principles and Practice of Constraint Programming – CP 2004
• An approximate distribution for the maximum order complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690734)