Publication | Closed Access
An 0(n log n) sorting network
665
Citations
6
References
1983
Year
Unknown Venue
Circuit ComplexityDirected GraphEngineeringGraph TheorySorting NetworkNetwork AlgorithmStructural Graph TheorySorting AlgorithmComputer EngineeringNetwork AnalysisEducationComputational ComplexityComputer ScienceDiscrete MathematicsSize 0Combinatorial OptimizationN Log NNetwork Topology
The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n).
| Year | Citations | |
|---|---|---|
Page 1
Page 1