default search action
T. L. Freeman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 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. Exp. 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. Concurr. Comput. Pract. Exp. 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. Concurr. Pract. Exp. 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. Concurr. Pract. Exp. 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-328 - [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
1990 – 1999
- 1998
- [j4]J. Mark Bull, T. L. Freeman:
Parallel Algorithms for Multidimensional Integration. Parallel Distributed Comput. Pract. 1(1) (1998) - 1997
- [c4]J. Mark Bull, T. L. Freeman:
A Comparison of Parallel Algorithms for Multi-Dimensional Integration. PP 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 Comput. 17(6-7): 673-681 (1991)
1980 – 1989
- 1989
- [j1]T. L. Freeman:
Calculating polynomial zeros on a local memory parallel computer. Parallel Comput. 12(3): 351-358 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: