


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 54 matches
- 1979
- Hiroshi Akima:
Remark on "Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1]". ACM Trans. Math. Softw. 5(2): 242 (1979) - Michael R. Anderson:
Remark on "Algorithm 474: Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures". ACM Trans. Math. Softw. 5(2): 241 (1979) - James Michael Bennett, Robert Neff Bryan:
A Single-Point Exchange Algorithm for Approximating Functions of Two Variables. ACM Trans. Math. Softw. 5(3): 296-307 (1979) - Richard A. Bogen:
Addendum to "Analytically Solving Integral Equations by Using Computer Algebra". ACM Trans. Math. Softw. 5(2): 234-237 (1979) - Carl de Boor:
Efficient Computer Manipulation of Tensor Products. ACM Trans. Math. Softw. 5(2): 173-182 (1979) - Carl de Boor:
Corrigenda: "Efficient Computer Manipulation of Tensor Products". ACM Trans. Math. Softw. 5(4): 525 (1979) - Richard P. Brent:
Remark on "Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]". ACM Trans. Math. Softw. 5(4): 518-519 (1979) - John G. Cleary:
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space. ACM Trans. Math. Softw. 5(2): 183-192 (1979) - Fred D. Crary:
A Versatile Precompiler for Nonstandard Arithmetics. ACM Trans. Math. Softw. 5(2): 204-217 (1979) - Harlan P. Crowder, Ron S. Dembo, John M. Mulvey:
On Reporting Computational Experiments with Mathematical Software. ACM Trans. Math. Softw. 5(2): 193-203 (1979) - Iain S. Duff, John K. Reid:
Some Design Features of a Sparse Matrix Code. ACM Trans. Math. Softw. 5(1): 18-35 (1979) - Louis W. Ehrlich:
Solving the Biharmonic Equation on Irregular Regions. ACM Trans. Math. Softw. 5(3): 251-258 (1979) - Wayne H. Enright, Mohamed S. Kamel
:
Automatic Partitioning of Stiff Systems and Exploiting the Resulting Structure. ACM Trans. Math. Softw. 5(4): 374-385 (1979) - Phyllis Fox:
Remark on "Algorithm 528: Framework for a Portable Library [Z]". ACM Trans. Math. Softw. 5(4): 524 (1979) - D. Fraser:
Algorithm 545: An Optimized Mass Storage FFT [C6]. ACM Trans. Math. Softw. 5(4): 500-517 (1979) - Walter Gautschi:
A Computational Procedure for Incomplete Gamma Functions. ACM Trans. Math. Softw. 5(4): 466-481 (1979) - Walter Gautschi:
Algorithm 542: Incomplete Gamma Functions [S14]. ACM Trans. Math. Softw. 5(4): 482-489 (1979) - C. William Gear:
Editor's Note. ACM Trans. Math. Softw. 5(4): 373 (1979) - Keith O. Geddes:
Symbolic Computation of Padé Approximants. ACM Trans. Math. Softw. 5(2): 218-233 (1979) - Keith O. Geddes:
Remark on "Algorithm 424: Clenshaw-Curtis Quadrature [O1]". ACM Trans. Math. Softw. 5(2): 240 (1979) - Alan George, Joseph W. H. Liu:
The Design of a User Interface for a Sparse Matrix Package. ACM Trans. Math. Softw. 5(2): 139-162 (1979) - Alan George, Joseph W. H. Liu:
An Implementation of a Pseudoperipheral Node Finder. ACM Trans. Math. Softw. 5(3): 284-295 (1979) - Philip E. Gill, Walter Murray, Susan M. Picken, Margaret H. Wright:
The Design and Structure of a Fortran Program Library for Optimization. ACM Trans. Math. Softw. 5(3): 259-283 (1979) - Ian Gladwell:
Initial Value Routines in the NAG Library. ACM Trans. Math. Softw. 5(4): 386-400 (1979) - Elias N. Houstis, Theodore S. Papatheodorou:
High-Order Fast Elliptic Equation Solvers. ACM Trans. Math. Softw. 5(4): 431-441 (1979) - Elias N. Houstis, Theodore S. Papatheodorou:
Algorithm 543: FFT9, Fast Solution of Helmholtz-Type Partial Differential Equations [D3]. ACM Trans. Math. Softw. 5(4): 490-493 (1979) - David K. Kahaner, Mark B. Wells:
An Experimental Algorithm for N-Dimensional Adaptive Quadrature. ACM Trans. Math. Softw. 5(1): 86-96 (1979) - Linda Kaufman:
Application of Dense Householder Transformation to a Sparse Matrix. ACM Trans. Math. Softw. 5(4): 442-450 (1979) - H. D. Knoble:
Algorithm 536: An Efficient One-Way Enciphering Algorithm [Z]. ACM Trans. Math. Softw. 5(1): 108-111 (1979) - H. D. Knoble, C. Forney Jr., F. S. Bader:
An Efficient One-Way Enciphering Algorithm. ACM Trans. Math. Softw. 5(1): 97-107 (1979)
skipping 24 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 2025-03-07 21:46 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