Preview
Unable to display preview. Download preview PDF.
References
R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press, 1979.
C.-H. Huang and C. Lengauer, The automated proof of a trace transformation for a bitonic sort, Theoretical Computer Science, 46, (1986), pp. 261–284.
D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA,(1973).
C. Lengauer, A methodology for programming with concurrency: The formalism, Sci. of Comput. Programm., 2, (1), (1982), pp. 19–52.
C. Lengauer and E.C.R. Hehner, A methodology for programming with concurrency: An informal presentation, Sci. of Comput. Programm., 2, (1), (1982), pp. 1–18.
C.Lengauer and C.-H. Huang, A mechanically certified theorem about optimal concurrency of sorting networks, Proc. 13th Ann. ACM Symp. on Principles of Programming Languages, (1986), pp. 307–317.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gannett, E., Kothari, S.C., Yen, HC. (1987). On optimal parallelization of sorting networks. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_51
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive