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 36 matches
- 1975
- Thomas J. Aird, Robert E. Lynch:
Computable Accurate Upper and Lower Error Bounds for Approximate Solutions of Linear Algebraic Systems. ACM Trans. Math. Softw. 1(3): 217-231 (1975) - Algorithms Distribution Service. ACM Trans. Math. Softw. 1(1): 4 (1975)
- Papers from Mathematical Software II. ACM Trans. Math. Softw. 1(1): 7-12 (1975)
- Carl B. Bailey, Rondall E. Jones:
Usage and Argument Monitoring of Mathematical Library Routines. ACM Trans. Math. Softw. 1(3): 196-209 (1975) - Lawrence L. Barinka:
Some Experience with Constructing, Testing, and Certifying a Standard Mathematical Subroutine Library. ACM Trans. Math. Softw. 1(2): 165-177 (1975) - Ian Barrodale, C. Phillips:
Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]. ACM Trans. Math. Softw. 1(3): 264-270 (1975) - Gordon E. Bromage:
Certification of "Algorithm 475: Visible Surface Plotting Program [J6]". ACM Trans. Math. Softw. 1(4): 381-382 (1975) - J. C. P. Bus, T. J. Dekker:
Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function. ACM Trans. Math. Softw. 1(4): 330-345 (1975) - George D. Byrne, Alan C. Hindmarsh:
A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations. ACM Trans. Math. Softw. 1(1): 71-96 (1975) - William J. Cody:
The FUNPACK Package of Special Function Subroutines. ACM Trans. Math. Softw. 1(1): 13-25 (1975) - Robert Feinstein:
Remark on "Algorithm 483: Masked Three-Dimensional Plot Program with Rotations [J6]". ACM Trans. Math. Softw. 1(3): 285 (1975) - Lloyd D. Fosdick:
Algorithms Policy. ACM Trans. Math. Softw. 1(1): 5-6 (1975) - James E. George:
Algorithms to Reveal the Representation of Characters, Integers, and Floating-Point Numbers. ACM Trans. Math. Softw. 1(3): 210-216 (1975) - Fred W. Glover, Darwin Klingman:
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently. ACM Trans. Math. Softw. 1(1): 47-55 (1975) - Michael A. Jenkins:
Algorithm 493: Zeros of a Real Polynomial [C2]. ACM Trans. Math. Softw. 1(2): 178-189 (1975) - Michael A. Jenkins, Joseph F. Traub:
Principles for Testing Polynomial Zerofinding Programs. ACM Trans. Math. Softw. 1(1): 26-34 (1975) - Linda Kaufman:
Algorithm 496: The LZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2]. ACM Trans. Math. Softw. 1(3): 271-281 (1975) - Jules J. Lambiotte Jr., Robert G. Voigt:
The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer. ACM Trans. Math. Softw. 1(4): 308-329 (1975) - John Gregg Lewis:
Certification of "Algorithm 349: Polygamma Functions with Arbitrary Precision". ACM Trans. Math. Softw. 1(4): 380-382 (1975) - Michael A. Malcolm, R. Bruce Simpson:
Local Versus Global Strategies for Adaptive Quadrature. ACM Trans. Math. Softw. 1(2): 129-146 (1975) - Webb Miller:
Software for Roundoff Analysis. ACM Trans. Math. Softw. 1(2): 108-128 (1975) - Jayadev Misra:
Remark on "Algorithm 246: Graycode [Z]". ACM Trans. Math. Softw. 1(3): 285 (1975) - Kenneth W. Neves:
Automatic Integration of Functional Differential Equations: An Approach. ACM Trans. Math. Softw. 1(4): 357-368 (1975) - Kenneth W. Neves:
Algorithm 497: Automatic Integration of Functional Differential Equations [D2]. ACM Trans. Math. Softw. 1(4): 369-371 (1975) - Edward W. Ng:
A Comparison of Computational Methods and Algorithms for the Complex Gamma Function. ACM Trans. Math. Softw. 1(1): 56-70 (1975) - A. C. Norman:
Computing with Formal Power Series. ACM Trans. Math. Softw. 1(4): 346-356 (1975) - Beresford N. Parlett, Y. Wang:
The Influence of the Compiler on the Cost of Mathematical Software - In Particular on the Cost of Triangular Factorization. ACM Trans. Math. Softw. 1(1): 35-46 (1975) - M. J. D. Powell:
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives. ACM Trans. Math. Softw. 1(2): 97-107 (1975) - P. J. Prince:
Algorithm 498: Airy Functions Using Chebyshev Series Approximations. ACM Trans. Math. Softw. 1(4): 372-379 (1975) - John R. Rice:
Purpose and Scope. ACM Trans. Math. Softw. 1(1): 1-3 (1975)
skipping 6 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-09-26 11:36 CEST 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