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 32 matches
- 1989
- Cleve Ashcraft, Roger Grimes:
The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw. 15(4): 291-309 (1989) - Paul T. Boggs, Janet R. Donaldson, Richard H. Byrd, Robert B. Schnabel:
Algorithm 676: ODRPACK: software for weighted orthogonal distance regression. ACM Trans. Math. Softw. 15(4): 348-364 (1989) - R. W. Brankin, Ian Gladwell, J. R. Dormand, P. J. Prince, Wendy Louise Seward:
Algorithm 670: a Runge-Kutta-Nyström code. ACM Trans. Math. Softw. 15(1): 31-40 (1989) - Albert G. Buckley:
Remark on algorithm 630. ACM Trans. Math. Softw. 15(3): 262-274 (1989) - Jeff R. Cash:
A block 6(4) Runge-Kutta formula for nonstiff initial value problems. ACM Trans. Math. Softw. 15(1): 15-28 (1989) - Jeff R. Cash:
Algorithm 669: BRKF45: a FORTRAN subroutine for solving first-order systems of nonstiff initial value problems for ordinary differential equations. ACM Trans. Math. Softw. 15(1): 29-30 (1989) - Michael D. Chang, Chou-Hong J. Chen, Michael Engquist:
An improved primal simplex variant for pure processing networks. ACM Trans. Math. Softw. 15(1): 64-78 (1989) - William J. Cody, L. Stoltz:
Performance evaluation of programs for certain Bessel functions. ACM Trans. Math. Softw. 15(1): 41-48 (1989) - Angelo Corana, Claudio Martini, Sandro Ridella:
Corrigenda: "Minimizing Multimodal Functions of Continuous Variables with the 'Simulated Annealing' Algorithm". ACM Trans. Math. Softw. 15(3): 287 (1989) - George F. Corliss, Gary S. Krenz:
Indefinite integration with validation. ACM Trans. Math. Softw. 15(4): 375-393 (1989) - Virginijus Dadurkevicius:
Remark on algorithm 587. ACM Trans. Math. Softw. 15(3): 257-261 (1989) - Paul D. Domich:
Residual hermite normal form computations. ACM Trans. Math. Softw. 15(3): 275-286 (1989) - Iain S. Duff, Roger G. Grimes, John G. Lewis:
Sparse matrix test problems. ACM Trans. Math. Softw. 15(1): 1-14 (1989) - Wayne H. Enright, John D. Pryce:
Corrigenda: "Two FORTRAN Packages for Assessing Initial Value Methods". ACM Trans. Math. Softw. 15(3): 287 (1989) - Nicholas J. Higham:
Algorithm 674: Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 15(2): 168 (1989) - Voratas Kachitvichyanukul, Bruce W. Schmeiser:
Algorithm 678: BTPEC: sampling from the binomial distribution. ACM Trans. Math. Softw. 15(4): 394-397 (1989) - Fred T. Krogh:
ACM Algorithms Policy. ACM Trans. Math. Softw. 15(2): 169-172 (1989) - D. Le:
Corrigenda: "An Efficient Derivative-Free Method for Solving Nonlinear Equations". ACM Trans. Math. Softw. 15(3): 287 (1989) - Joseph W. H. Liu:
A graph partitioning algorithm by node separators. ACM Trans. Math. Softw. 15(3): 198-219 (1989) - Joseph W. H. Liu:
The multifrontal method and paging in sparse Cholesky factorization. ACM Trans. Math. Softw. 15(4): 310-325 (1989) - Nezam Mahdavi-Amiri, Richard H. Bartels:
Constrained nonlinear least squares: an exact penalty approach with projected structured quasi-Newton updates. ACM Trans. Math. Softw. 15(3): 220-242 (1989) - William F. Mitchell:
A comparison of adaptive refinement techniques for elliptic problems. ACM Trans. Math. Softw. 15(4): 326-347 (1989) - Laura Bacchelli Montefusco, Giulio Casciola:
Algorithm 677 C1 surface interpolation. ACM Trans. Math. Softw. 15(4): 365-374 (1989) - Alexander P. Morgan, Andrew J. Sommese, Layne T. Watson:
Finding all isolated solutions to polynomial systems using HOMPACK. ACM Trans. Math. Softw. 15(2): 93-122 (1989) - Thomas N. L. Patterson:
An algorithm for generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions. ACM Trans. Math. Softw. 15(2): 123-136 (1989) - Thomas N. L. Patterson:
Algorithm 672: generation of interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions. ACM Trans. Math. Softw. 15(2): 137-143 (1989) - Albrecht Preusser:
Algorithm 671: FARB-E-2D: fill area with bicubics on rectangles - a contour plot program. ACM Trans. Math. Softw. 15(1): 79-89 (1989) - Calvin J. Ribbens:
A fast adaptive grid scheme for elliptic partial differential equations. ACM Trans. Math. Softw. 15(3): 179-197 (1989) - David F. Shanno, Kang-Hoh Phua:
Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming. ACM Trans. Math. Softw. 15(1): 49-63 (1989) - Ping Tak Peter Tang:
Table-driven implementation of the exponential function in IEEE floating-point arithmetic. ACM Trans. Math. Softw. 15(2): 144-157 (1989)
skipping 2 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-12-19 18:17 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