| 2008 | ||
|---|---|---|
| j8 | Christopher W. Armstrong, Rupert W. Ford, T. L. Freeman, Graham D. Riley: NOAH: A CSP-based language for describing the behaviour of coupled models. Softw., Pract. Exper. 38(2): 135-159 (2008) | |
| 2006 | ||
| j7 | Rupert W. Ford, Graham D. Riley, Michael K. Bane, Christopher W. Armstrong, T. L. Freeman: GCF: a general coupling framework. Concurrency and Computation: Practice and Experience 18(2): 163-181 (2006) | |
| 2005 | ||
| j6 | Mikel Luján, John R. Gurd, T. L. Freeman, José Miguel-Alonso: Elimination of Java array bounds checks in the presence of indirection. Concurrency - Practice and Experience 17(5-6): 489-514 (2005) | |
| j5 | Mikel Luján, T. L. Freeman, John R. Gurd: On the conditions necessary for removing abstraction penalties in OOLALA. Concurrency - Practice and Experience 17(7-8): 839-866 (2005) | |
| c10 | Mikel Luján, Anila Usman, Patrick Hardie, T. L. Freeman, John R. Gurd: Storage Formats for Sparse Matrices in Java. International Conference on Computational Science (1) 2005: 364-371 | |
| c9 | Mikel Luján, Gibson Mukarakate, John R. Gurd, T. L. Freeman: DIFOJO: A Java Fork/Join Framework for Heterogeneous Networks. PDP 2005: 297-304 | |
| 2002 | ||
| c8 | Mikel Luján, John R. Gurd, T. L. Freeman, José Miguel-Alonso: Elimination of Java array bounds checks in the presence of indirection. Java Grande 2002: 76-85 | |
| 2000 | ||
| c7 | David J. Hancock, J. Mark Bull, Rupert W. Ford, T. L. Freeman: An Investigation of Feedback Guided Dynamic Scheduling of Nested Loops. ICPP Workshops 2000: 315- | |
| c6 | Mikel Luján, T. L. Freeman, John R. Gurd: OoLALA: an object oriented analysis and design of numerical linear algebra. OOPSLA 2000: 229-252 | |
| c5 | T. L. Freeman, David J. Hancock, J. Mark Bull, Rupert W. Ford: Feedback Guided Scheduling of Nested Loops. PARA 2000: 149-159 | |
| 1998 | ||
| j4 | J. Mark Bull, T. L. Freeman: Parallel Algorithms for Multidimensional Integration. Scalable Computing: Practice and Experience 1(1) (1998) | |
| 1997 | ||
| c4 | J. Mark Bull, T. L. Freeman: A Comparison of Parallel Algorithms for Multi-Dimensional Integration. PPSC 1997 | |
| 1994 | ||
| j3 | J. Mark Bull, T. L. Freeman: Parallel globally adaptive quadrature on the KSR-1. Adv. Comput. Math. 2(4): 357-373 (1994) | |
| c3 | T. L. Freeman, J. Mark Bull: Shared Memory and Message Passing Implementations of Parallel Algorithms for Numerical Integration. PARA 1994: 219-228 | |
| c2 | J. Mark Bull, T. L. Freeman: Parallel Algorithms and Interval Selection Strategies for Globally Adaptive Quadrature. PARLE 1994: 490-501 | |
| 1992 | ||
| b1 | T. L. Freeman, Chris Phillips: Parallel numerical algorithms. Prentice Hall International Series in Computer Science, Prentice Hall 1992, isbn 978-0-13-651597-5, pp. I-XI, 1-215 | |
| c1 | J. Mark Bull, T. L. Freeman: Numerical Performance of an Asynchronous Jacobi Iteration. CONPAR 1992: 361-366 | |
| 1991 | ||
| j2 | T. L. Freeman, Michael K. Bane: Asynchronous polynomial zero-finding algorithms. Parallel Computing 17(6-7): 673-681 (1991) | |
| 1989 | ||
| j1 | T. L. Freeman: Calculating polynomial zeros on a local memory parallel computer. Parallel Computing 12(3): 351-358 (1989) | |
Data released under the ODC-BY 1.0 license — See also our legal information page