Bounds to Complexities of Networks for Sorting and for Switching.

David E. Muller, Franco P. Preparata: Bounds to Complexities of Networks for Sorting and for Switching. J. ACM 22(2): 195-201(1975)

@article{DBLP:journals/jacm/MullerP75,
  author    = {David E. Muller and
               Franco P. Preparata},
  title     = {Bounds to Complexities of Networks for Sorting and for Switching},
  journal   = {J. ACM},
  volume    = {22},
  number    = {2},
  year      = {1975},
  pages     = {195-201},
  ee        = {db/journals/jacm/MullerP75.html, http://doi.acm.org/10.1145/321879.321882},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Jai Menon: A Study of Sort Algorithms for Multiprocessor Database Machines. VLDB 1986: 197-206
Yuzuru Tanaka: Bit-Sliced VLSI Algorithm for Search and Sort. VLDB 1984: 225-234

BibTeX