Periodic sorting using minimum delay, recursively constructed merging networks.
Bender, Edward A.; Williamson, S.Gill
The Electronic Journal of Combinatorics [electronic only] (1998)
- Volume: 5, Issue: 1, page Research paper R5, 21 p.-Research paper R5, 21 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBender, Edward A., and Williamson, S.Gill. "Periodic sorting using minimum delay, recursively constructed merging networks.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R5, 21 p.-Research paper R5, 21 p.. <http://eudml.org/doc/119227>.
@article{Bender1998,
author = {Bender, Edward A., Williamson, S.Gill},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {merging network},
language = {eng},
number = {1},
pages = {Research paper R5, 21 p.-Research paper R5, 21 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Periodic sorting using minimum delay, recursively constructed merging networks.},
url = {http://eudml.org/doc/119227},
volume = {5},
year = {1998},
}
TY - JOUR
AU - Bender, Edward A.
AU - Williamson, S.Gill
TI - Periodic sorting using minimum delay, recursively constructed merging networks.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper R5, 21 p.
EP - Research paper R5, 21 p.
LA - eng
KW - merging network
UR - http://eudml.org/doc/119227
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.