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
- 1987
- Peter Abel:
On the choice of the pivot columns of the Simplex-method: Gradient criteria. Computing 38(1): 13-21 (1987) - Alkiviadis G. Akritas:
A simple proof of the validity of the reduced prs algorithm. Computing 38(4): 369-372 (1987) - Klaus Böhmer, Thomas Römer:
Grid strategy and high accuracy via defect corrections for the Kreiss-method for stiff boundary value problems. Computing 38(3): 269-273 (1987) - Peter Brucker, Wolfgang Meyer:
Approximation of a set of points by points of a grid. Computing 38(4): 341-345 (1987) - Franca Caliò, Elena Marchetti:
Derivation and implementation of an algorithm for singular integrals. Computing 38(3): 235-245 (1987) - M. Davis, John Dowden:
Interpolation by a local taut cubic piecewise polynomial. Computing 38(4): 299-313 (1987) - Franz-Jürgen Delvos:
Bernoulli functions and periodic B-splines. Computing 38(1): 23-31 (1987) - James Weldon Demmel:
Three methods for refining estimates of invariant subspaces. Computing 38(1): 43-57 (1987) - Hans-Jürgen Dobner:
Bounds for the solution of hyperbolic problems. Computing 38(3): 209-218 (1987) - Ulrich Faigle, Rainer Schrader:
Interval orders without odd crowns are defect optimal. Computing 38(1): 59-69 (1987) - Jerry Michael Fine:
Low order practical Runge-Kutta-Nyström methods. Computing 38(4): 281-297 (1987) - Jürgen Herzberger:
On the monotonicity of the interval versions of Schulz's method. Computing 38(1): 71-74 (1987) - Frank R. Hoog, Robert Martinus Maria Mattheij:
An algorithm for solving multi-point boundary value problems. Computing 38(3): 219-234 (1987) - Snezhana G. Hristova, Drumi D. Bainov:
Numeric-analytic method for finding the periodic solutions of nonlinear differential-difference equations with impulses. Computing 38(4): 363-368 (1987) - Kazuo Ishihara:
Successive overrelaxation method with projection for finite element solutions of nonlinear radiation cooling problems. Computing 38(2): 117-132 (1987) - Roy Jonker, A. Volgenant:
A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4): 325-340 (1987) - Abdulwalab Kharab, Ronald B. Guenther:
A free boundary value problem for water invading an unsaturated medium. Computing 38(3): 185-207 (1987) - H. P. Märchy:
On a modification of the QZ algorithm with fast givens rotations. Computing 38(3): 247-259 (1987) - José Mario Martínez:
Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations. Computing 38(2): 133-141 (1987) - Hans Ploss:
On simulation methods for solving the Boltamann equation. Computing 38(2): 101-115 (1987) - John K. Scheidt, Charles W. Schelin:
Distributions of floating point numbers. Computing 38(4): 315-324 (1987) - Jochen W. Schmidt, Walter Heß:
Positive interpolation with rational quadratic splines. Computing 38(3): 261-267 (1987) - Josef Schneid:
A new approach to optimal B-convergence. Computing 38(1): 33-42 (1987) - Hartmut Schwandt:
Iterative methods for systems of equations with interval coefficients and linear form. Computing 38(2): 143-161 (1987) - Peter Seifert:
Computational experiments with algorithms for stiff ODEs. Computing 38(2): 163-176 (1987) - Z. Shen, Y. Zhu:
An interval version of Shubert's iterative method for the localization of the global maximum. Computing 38(3): 275-280 (1987) - Mouhamed Nabih El Tarazi, Samer Sallam:
On quartic splines with application to quadratures. Computing 38(4): 355-361 (1987) - Hubert Telley, Thomas M. Liebling, Alain Mocellin:
Reconstruction of polycrystalline structures: a new application of combinatorial optimization. Computing 38(1): 1-11 (1987) - Cees R. Traas:
Smooth approximation of data on the sphere with splines. Computing 38(2): 177-184 (1987) - De-ren Wang, Yu-Jiang Wu:
Some modifications of the parallel Halley iteration method and their convergence. Computing 38(1): 75-87 (1987)
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-10-04 16:56 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