Journals in DBLP

ACM Trans. Math. Softw.
1980, volume: 6, number: 3

1. C. William Gear
   Runge-Kutta Starters for Multistep Methods. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:263-279 [Journal]
   
2. David Barton
   On Taylor Series and Stiff Equations. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:280-294 [Journal]
   
3. K. R. Jackson, Ron Sacks-Davis
   An Alternative Implementation of Variable Step-Size Multistep Formulas for Stiff ODEs. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:295-318 [Journal]
   
4. G. K. Gupta
   A Note About Overhead Costs in ODE Solvers. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:319-326 [Journal]
   
5. David Coleman, Paul Holland, Neil Kaden, Virginia Klema, Stephen C. Peters
   A System of Subroutines for Iteratively Reweighted Least Squares Computations. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:327-336 [Journal]
   
6. Alan George, Joseph W. H. Liu
   A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:337-358 [Journal]
   
7. Jon Louis Bentley, James B. Saxe
   Generating Sorted Lists of Random Numbers. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:359-364 [Journal]
   
8. Donald E. Amos
   Computation of Exponential Integrals. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:365-377 [Journal]
   
9. Jeffrey L. Arthur, A. Ravindran
   PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Math. Softw., 1980, v:6, n:3, pp:378-386 [Journal]
   
10. To-Yat Cheung
    Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:387-390 [Journal]
    
11. J. T. Betts
    A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:391-397 [Journal]
    
12. Bo Kågström, Axel Ruhe
    An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:398-419 [Journal]
    
13. Donald E. Amos
    Algorithm 556: Exponential Integrals [S13]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:420-428 [Journal]
    
14. Jeffrey L. Arthur, A. Ravindran
    Algorithm 557: PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems [H]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:429- [Journal]
    
15. To-Yat Cheung
    Algorithm 558: A Program for the Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach [H]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:430-431 [Journal]
    
16. J. T. Betts
    Algorithm 559: The Stationary Point of a Quadratic Function Subject to Linear Constraints [E4]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:432-436 [Journal]
    
17. Bo Kågström, Axel Ruhe
    Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:437-443 [Journal]
    
18. David K. Kahaner
    Algorithm 561: Fortran Implementation of Heap Programs for Efficient Table Maintenance [Z]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:444-449 [Journal]
    
19. U. Pape
    Algorithm 562: Shortest Path Lengths [H]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:450-455 [Journal]
    
20. U. Harms, H. Kollakowski, G. Möller
    Remark on ``Algorithm 408: A Sparse Matrix Package (Part 1) [F4]''. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:456-457 [Journal]