LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS.
Publication
, Journal Article
Reif, JH; Valiant, LG
Published in: Conference Proceedings of the Annual Acm Symposium on Theory of Computing
December 1, 1983
Duke Scholars
Published In
Conference Proceedings of the Annual Acm Symposium on Theory of Computing
ISSN
0734-9025
Publication Date
December 1, 1983
Start / End Page
10 / 16
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H., & Valiant, L. G. (1983). LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS. Conference Proceedings of the Annual Acm Symposium on Theory of Computing, 10–16.
Reif, J. H., and L. G. Valiant. “LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, December 1, 1983, 10–16.
Reif JH, Valiant LG. LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS. Conference Proceedings of the Annual Acm Symposium on Theory of Computing. 1983 Dec 1;10–6.
Reif, J. H., and L. G. Valiant. “LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS.” Conference Proceedings of the Annual Acm Symposium on Theory of Computing, Dec. 1983, pp. 10–16.
Reif JH, Valiant LG. LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS. Conference Proceedings of the Annual Acm Symposium on Theory of Computing. 1983 Dec 1;10–16.
Published In
Conference Proceedings of the Annual Acm Symposium on Theory of Computing
ISSN
0734-9025
Publication Date
December 1, 1983
Start / End Page
10 / 16