Amanote Research
Register
Sign In
Do Hypercubes Sort Faster Than Tree Machines?
Concurrency: Practice and Experience
doi 10.1002/cpe.4330060205
Full Text
Open PDF
Abstract
Available in
full text
Date
April 1, 1994
Authors
Per Brinch Hansen
Publisher
Wiley
Related search
Binary Tree Sort Is More Robust Than Quick Sort in Average Case
International Journal of Computer Science, Engineering and Applications
Do Men Slow Down Faster Than Women?
SSRN Electronic Journal
Faster Than a Speeding CD?
Against the Grain
Messages Diffuse Faster Than Messengers
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
Assigning Machines to Incomparable Maintenance Strategies With ELECTRE-SORT
Omega
Management Science
Information Systems
Management
Operations Research
Strategy
Driving Faster Than a Human Player
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Superoscillations: Faster Than the Nyquist Rate
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
Solving Multicut Faster Than 2 N
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
More Substance Information. Faster Than Ever.
Chemical and Engineering News
Chemical Engineering
