Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions V. Grolmusz Pages: 341 - 353
An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology G. XueD.-Z. Du Pages: 354 - 362
Reductions Do Not Preserve Fast Convergence Rates in Average Time J. BelangerA. PavanJ. Wang Pages: 363 - 373