This Article 
 Bibliographic References 
 Add to: 
The Parallel Assignment Problem Redefined
June 1989 (vol. 15 no. 6)
pp. 821-824

[1] M. C. Er, "Optimizing procedure calls and returns,"Software-Practice and Experience, vol. 13, pp. 921-939, 1983.
[2] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[3] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[4] D. E. Knuth, "Mathematical analysis of algorithms," inProc. IFIP Congress 1971, Ljubljana, Yugoslavia, Aug. 1971, pp. 19-27.
[5] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley, 1973.
[6] C. May, "Mimic: A fast System/370 simulator," inProc. SIGPLAN '87 Symp. Interpreters and Interpretive Techniques, St. Paul, MN, June 1987, pp. 1-13.
[7] R. Melville, "A time/space tradeoff for in-place array permutation,"J. Algorithms, vol. 2, pp. 139-143, 1981.
[8] R. Sethi, "A note on implementing parallel assignment instructions,"Inform. Processing Lett., vol. 2, pp. 91-95, 1973.
[9] H. R. Strong, Jr., A. Maggiolo-Schettini, and B. K. Rosen, "Recursion structure simplification,"SIAM J. Comput., vol. 4, no. 3, pp. 307-320, Sept. 1975.
[10] P. H. Welch, "Parallel assignment revisited,"Software-Practice and Experience, vol. 13, pp. 1175-1180, 1983.

C. May, "The Parallel Assignment Problem Redefined," IEEE Transactions on Software Engineering, vol. 15, no. 6, pp. 821-824, June 1989, doi:10.1109/32.24735
Usage of this product signifies your acceptance of the Terms of Use.