From post

Efficiently Computing Static Single Assignment Form and the Control Dependence Graph.

, , , , и . ACM Trans. Program. Lang. Syst., 13 (4): 451-490 (1991)preliminary version: POPL 1989: 25-35.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation., и . ICPP, стр. 19-27. Pennsylvania State University Press, (1987)Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors., и . ICPP, стр. 217-225. Pennsylvania State University Press, (1987)Useful Parallelism in a Multiprocessing Environment.. ICPP, стр. 450-457. IEEE Computer Society Press, (1985)Workshop PC Chairs' Message., , и . OTM Workshops, том 2889 из Lecture Notes in Computer Science, стр. 318. Springer, (2003)Automated discovery of scoped memory regions for real-time Java., и . MSP/ISMM, стр. 132-142. ACM, (2002)Sensus: A Security-Conscious Electronic Polling System for the Internet., и . HICSS (3), стр. 561-570. IEEE Computer Society, (1997)Middleware Scheduling Optimization Techniques for Distributed Real-Time and Embedded Systems., , и . WORDS, стр. 311-318. IEEE Computer Society, (2002)Efficient Accomodation of May-Alias Information in SSA Form., и . PLDI, стр. 36-45. ACM, (1993)Automatic Discovery of Parallelism: A Tool and an Experiment (Extended Abstract)., , , , , и . PPOPP/PPEALS, стр. 77-84. ACM, (1988)Empirical Differences between COTS Middleware Scheduling Strategies., , , и . OTM, том 2519 из Lecture Notes in Computer Science, стр. 922-948. Springer, (2002)