%0 Journal Article %1 journals/concurrency/Hansen94 %A Hansen, Per Brinch %D 1994 %J Concurr. Pract. Exp. %K dblp %N 2 %P 143-151 %T Do hypercubes sort faster than tree machines? %U http://dblp.uni-trier.de/db/journals/concurrency/concurrency6.html#Hansen94 %V 6

@article{journals/concurrency/Hansen94, added-at = {2020-05-21T00:00:00.000+0200}, author = {Hansen, Per Brinch}, biburl = {https://www.bibsonomy.org/bibtex/2cf12a43403bfd8ed6f455a4b53585f1b/dblp}, ee = {https://doi.org/10.1002/cpe.4330060205}, interhash = {363f9d3a04a9ad23d7bc330223c710a8}, intrahash = {cf12a43403bfd8ed6f455a4b53585f1b}, journal = {Concurr. Pract. Exp.}, keywords = {dblp}, number = 2, pages = {143-151}, timestamp = {2020-05-23T12:00:18.000+0200}, title = {Do hypercubes sort faster than tree machines?}, url = {http://dblp.uni-trier.de/db/journals/concurrency/concurrency6.html#Hansen94}, volume = 6, year = 1994 }