default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 1982
- Joachim H. Ahrens, Ulrich Dieter:
Computer Generation of Poisson Deviates from Modified Normal Distributions. ACM Trans. Math. Softw. 8(2): 163-179 (1982) - Walter L. Anderson:
Fast Hankel Transforms Using Related and Lagged Convolutions. ACM Trans. Math. Softw. 8(4): 344-368 (1982) - Walter L. Anderson:
Algorithm 588: Fast Hankel Transforms Using Related and Lagged Convolutions. ACM Trans. Math. Softw. 8(4): 369-370 (1982) - Claude Brezinski:
Algorithm 585: A Subroutine for the General Interpolation and Extrapolation Problems. ACM Trans. Math. Softw. 8(3): 290-301 (1982) - Albert G. Buckley:
Remark on "Algorithm 580: QRUP: A Set of FORTRAN Routines for Updating QR Factorizations". ACM Trans. Math. Softw. 8(4): 405 (1982) - Tony F. Chan:
An Improved Algorithm for Computing the Singular Value Decomposition. ACM Trans. Math. Softw. 8(1): 72-83 (1982) - Tony F. Chan:
Algorithm 581: An Improved Algorithm for Computing the Singular Value Decomposition [F1]. ACM Trans. Math. Softw. 8(1): 84-88 (1982) - George F. Corliss, Y. F. Chang:
Solving Ordinary Differential Equations Using Taylor Series. ACM Trans. Math. Softw. 8(2): 114-144 (1982) - Narsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy:
Algorithms for Generating Fundamental Cycles in a Graph. ACM Trans. Math. Softw. 8(1): 26-42 (1982) - David S. Dodson, Roger G. Grimes:
Remark on "Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage". ACM Trans. Math. Softw. 8(4): 403-404 (1982) - Jack J. Dongarra:
Algorithm 589: SICEDR: A FORTRAN Subroutine for Improving the Accuracy of Computed Matrix Eigenvalues. ACM Trans. Math. Softw. 8(4): 371-375 (1982) - Paul Van Dooren:
Algorithm 590: DSUBSP and EXCHQZ: FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum. ACM Trans. Math. Softw. 8(4): 376-382 (1982) - Charles B. Dunham:
Choice of Basis for Chebyshev Approximation. ACM Trans. Math. Softw. 8(1): 21-25 (1982) - Eldon F. D. Ellison, Gautam Mitra:
UIMP: User Interface for Mathematical Programming. ACM Trans. Math. Softw. 8(3): 229-255 (1982) - David S. Flamm, Robert A. Walker:
Remark on "Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix". ACM Trans. Math. Softw. 8(2): 219-220 (1982) - Burton S. Garbow:
Remark on "Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem". ACM Trans. Math. Softw. 8(4): 402 (1982) - R. J. Hanson:
Remark on "Algorithm 507: Procedures for Quintic Natural Spline Interpolation". ACM Trans. Math. Softw. 8(3): 334 (1982) - Richard J. Hanson, Karen H. Haskell:
Algorithm 587: Two Algorithms for the Linearly Constrained Least Squares Problem. ACM Trans. Math. Softw. 8(3): 323-333 (1982) - William J. Hemmerle:
Algorithm 591: A Comprehensive Matrix-Free Algorithm for Analysis of Variance. ACM Trans. Math. Softw. 8(4): 383-401 (1982) - K. L. Hiebert:
An Evaluation of Mathematical Software That Solves Systems of Nonlinear Equations. ACM Trans. Math. Softw. 8(1): 5-20 (1982) - David C. Hoaglin, Virginia Klema, Stephen C. Peters:
Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines. ACM Trans. Math. Softw. 8(2): 145-162 (1982) - David R. Kincaid, John R. Respess, David M. Young, Rober R. Grimes:
Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods. ACM Trans. Math. Softw. 8(3): 302-322 (1982) - Fred T. Krogh:
ACM Algorithms Policy. ACM Trans. Math. Softw. 8(1): 1-4 (1982) - D. P. Laurie:
Algorithm 584: CUBTRI: Automatic Cubature over a Triangle. ACM Trans. Math. Softw. 8(2): 210-218 (1982) - John G. Lewis:
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms. ACM Trans. Math. Softw. 8(2): 180-189 (1982) - John G. Lewis:
Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices. ACM Trans. Math. Softw. 8(2): 190-194 (1982) - John G. Lewis:
Remark on "Algorithms 508 and 509: Matrix Bandwidth and Profile Reduction and A Hybrid Profile Reduction Algorith". ACM Trans. Math. Softw. 8(2): 221 (1982) - Christopher C. Paige, Michael A. Saunders:
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Trans. Math. Softw. 8(1): 43-71 (1982) - Christopher C. Paige, Michael A. Saunders:
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. ACM Trans. Math. Softw. 8(2): 195-209 (1982) - Tateaki Sasaki, Hirokazu Murao:
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems. ACM Trans. Math. Softw. 8(3): 277-289 (1982)
skipping 4 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-06 14:04 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint