dblp.uni-trier.dewww.uni-trier.de

Tim Hopkins

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2004
11EERichard J. Hanson, Tim Hopkins: Algorithm 830: Another visit with standard and modified givens transformations and a remark on algorithm 539. ACM Trans. Math. Softw. 30(1): 86-94 (2004)
2003
10EETim Hopkins: Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 29(3): 349-351 (2003)
2002
9EETim Hopkins: Renovating the collected algorithms from ACM. ACM Trans. Math. Softw. 28(1): 59-74 (2002)
8EETim Hopkins: A comment on the presentation and testing of CALGO codes and a remark on algorithm 639: To integrate some infinite oscillating tails. ACM Trans. Math. Softw. 28(3): 285-300 (2002)
7EETim Hopkins: Remark on algorithm 705: A Fortran-77 software package for solving the Sylvester matrix equation AXBT + CXDT = E. ACM Trans. Math. Softw. 28(3): 372-375 (2002)
1998
6EETim Hopkins: Certification of algorithm 734: a Fortran 90 code for unconstrained nonlinear minimization. ACM Trans. Math. Softw. 24(3): 351-354 (1998)
5EEMark Russell, Tim Hopkins: CFTP: A Caching FTP Server. Computer Networks 30(22-23): 2211-2222 (1998)
1996
4 Tim Hopkins, Peter H. Welch: Transputer data-flow solution for systems of linear equations. Concurrency - Practice and Experience 8(8): 569-580 (1996)
1995
3 Tim Hopkins: Purpose and Scope: CALGO. ACM Trans. Math. Softw. 21(1): 3 (1995)
1994
2EERudnei Dias da Cunha, Tim Hopkins: A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations. Adv. Comput. Math. 2(3): 261-277 (1994)
1990
1EETim Hopkins: Remark on algorithm 620. ACM Trans. Math. Softw. 16(4): 401-403 (1990)

Coauthor Index

1Rudnei Dias da Cunha [2]
2Richard J. Hanson [11]
3Mark Russell [5]
4Peter H. Welch [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)