The SCEAS System
Navigation Menu

Journals in DBLP

ACM Trans. Math. Softw.
1977, volume: 3, number: 3

  1. Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel
    An Algorithm for Finding Best Matches in Logarithmic Expected Time. [Citation Graph (17, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:209-226 [Journal]
  2. Tetsuro Ito, Makoto Kizawa
    The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:227-231 [Journal]
  3. W. J. Cody, Rose M. Motley, L. Wayne Fullerton
    The Computation of Real Fractional Order Bessel Functions of the Second Kind. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:232-239 [Journal]
  4. Walter Gautschi
    Evaluation of Repeated Integrals of the Coerror Function. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:240-252 [Journal]
  5. Alastair J. Walker
    An Efficient Method for Generating Discrete Random Variables with General Distributions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:253-256 [Journal]
  6. A. J. Kinderman, J. F. Monahan
    Computer Generation of Random Variables Using the Ratio of Uniform Deviates. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:257-260 [Journal]
  7. Jacques Cohen, Joel Katcoff
    Symbolic Solution of Finite-Difference Equations. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:261-271 [Journal]
  8. Richard J. Fateman
    An Algorithm for Deciding the Convergence of the Rational Iteration xn+1 = f(xn). [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:272-278 [Journal]
  9. G. W. Hill
    Algorithm 518: Incomplete Bessel Function I0. The Von Mises Distribution [S14]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:279-284 [Journal]
  10. Ralph Kallman
    Algorithm 519: Three Algorithms for Computing Kolmogorov-Smirnov Probabilities with Arbitrary Boundaries and a Certification of Algorithm 487 [S14]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:285-294 [Journal]
  11. Jan Weglarz, Jacek Blazewicz, Wojciech Cellary, Roman Slowinski
    Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:295-300 [Journal]
  12. Walter Gautschi
    Algorithm 521: Repeated Integrals of the Coerror Function [S15]. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:301-302 [Journal]
  13. Paolo Sipala
    Remark on "Algorithm 408: A Sparse Matrix Package (Part I) [F4]". [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:303- [Journal]
  14. Dennis Tenney
    Remark on "Algorithm 219: Topological Ordering for PERT Networks". [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:303- [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002