Author of the publication

Elimination of Java array bounds checks in the presence of indirection.

, , , and . Concurrency - Practice and Experience, 17 (5-6): 489-514 (2005)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Elimination of Java array bounds checks in the presence of indirection., , , and . Java Grande, page 76-85. ACM, (2002)GCF: a general coupling framework., , , , and . Concurrency and Computation: Practice and Experience, 18 (2): 163-181 (2006)Calculating polynomial zeros on a local memory parallel computer.. Parallel Computing, 12 (3): 351-358 (1989)A Comparison of Parallel Algorithms for Multi-Dimensional Integration., and . PPSC, SIAM, (1997)Asynchronous polynomial zero-finding algorithms., and . Parallel Computing, 17 (6-7): 673-681 (1991)Parallel numerical algorithms., and . Prentice Hall International Series in Computer Science Prentice Hall, (1992)Storage Formats for Sparse Matrices in Java., , , , and . International Conference on Computational Science (1), volume 3514 of Lecture Notes in Computer Science, page 364-371. Springer, (2005)Feedback Guided Scheduling of Nested Loops., , , and . PARA, volume 1947 of Lecture Notes in Computer Science, page 149-159. Springer, (2000)Shared Memory and Message Passing Implementations of Parallel Algorithms for Numerical Integration., and . PARA, volume 879 of Lecture Notes in Computer Science, page 219-228. Springer, (1994)DIFOJO: A Java Fork/Join Framework for Heterogeneous Networks., , , and . PDP, page 297-304. IEEE Computer Society, (2005)