


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 27 matches
- 1985
- Alkiviadis G. Akritas, Stylianos D. Danielopoulos:
A converse rule of signs for polynomials. Computing 34(3): 283-286 (1985) - M. N. Anwar, Mouhamed Nabih El Tarazi:
Asynchronous algorithms for poisson's equation with nonlinear boundary conditions. Computing 34(2): 155-168 (1985) - Jesse L. Barlow, Erwin H. Bareiss:
On roundoff error distributions in floating point and logarithmic arithmetic. Computing 34(4): 325-347 (1985) - Jesse L. Barlow, Erwin H. Bareiss:
Probabilistic error analysis of gaussian elimination in floating point and logarithmic arithmetic. Computing 34(4): 349-364 (1985) - Hanspeter Bieri, Walter Nef:
A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form. Computing 34(4): 287-302 (1985) - M. E. Brewster, Rangachary Kannan:
Global convergence of nonlinear successive overrelaxation via linear theory. Computing 34(1): 73-79 (1985) - M. E. Brewster, Rangachary Kannan:
Varying relaxation parameters in nonlinear successive overrelaxation. Computing 34(1): 81-85 (1985) - Søren Christiansen:
Modifications of some first kind integral equations with logarithmic kernel to improve numerical conditioning. Computing 34(3): 221-242 (1985) - A. M. Cohen:
A bounding approach to calculating α1/p. Computing 34(1): 87-89 (1985) - Annie A. M. Cuyt, Brigitte Verdonk:
Multivariate rational interpolation. Computing 34(1): 41-61 (1985) - James Weldon Demmel, Fritz Krückeberg:
An interval algorithm for solving systems of linear equations to prespecified accuracy. Computing 34(2): 117-129 (1985) - Erwin Fehlberg:
Some old and new Runge-Kutta formulas with stepsize control and their error coefficients. Computing 34(3): 265-270 (1985) - Siegfried Filippi, Josef Gräf:
Ein Runge-Kutta-Nyström-Formelpaar der Ordnung 11(12) für Differentialgleichungen der Form y″=f(x, y). Computing 34(3): 271-282 (1985) - Bruno Gabutti:
An algorithm for computing generalized Euler's transformations of series. Computing 34(2): 107-116 (1985) - Willi Hahn, Karlheinz Mohr, Ulrich Schauer:
Some techniques for solving linear equation systems with guarantee. Computing 34(4): 375-379 (1985) - Peter Kaps, Samuel W. H. Poon, Tien Dai Bui:
Rosenbrock methods for Stiff ODEs: A comparison of Richardson extrapolation and embedding technique. Computing 34(1): 17-40 (1985) - Rudolf Krawczyk:
Centered forms and interval operators. Computing 34(3): 243-259 (1985) - Mila E. Majster-Cederbaum:
Elimination of redundant operations in relational queries with general selection operators. Computing 34(4): 303-323 (1985) - Reinhard Menzel:
On solving nonlinear least-squares problems in case of rankdeficient Jacobians. Computing 34(1): 63-72 (1985) - Bernd Anton Merschen:
Minimal quadrature formulae for the spaces H. Computing 34(2): 169-177 (1985) - Arnold Neumaier
:
Inner product rounding error analysis in the presence of underflow. Computing 34(4): 365-373 (1985) - Klaus Neumann:
EOR project networks. Computing 34(1): 1-15 (1985) - Jon G. Rokne:
A low complexity explicit rational centered form. Computing 34(3): 261-263 (1985) - Günter Rote:
A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion). Computing 34(3): 191-219 (1985) - Fritz Schwarz:
Automatically determining symmetries of partial differential equations. Computing 34(2): 91-106 (1985) - Lawrence F. Shampine:
Local error estimation by doubling. Computing 34(2): 179-190 (1985) - Peter Wildenauer:
A new method for automatical computation of error bounds for the set of all solutions of nonlinear boundary value problems. Computing 34(2): 131-154 (1985)
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-02 03:36 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