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 30 matches
- 1983
- B. P. Acharya, R. N. Das:
Approximate evaluation of multiple complex integrals of analytic functions. Computing 30(3): 279-283 (1983) - Alkiviadis G. Akritas, H. Ng King:
Exact algorithms for polynomial real root approximation using continued fractions. Computing 30(1): 63-76 (1983) - Nikolaos Apostolatos, Vasilios Vlassopoulos:
Approximation der optimalen Vorhersage der Ausgabe stochastischer Quellen. Computing 30(3): 261-273 (1983) - D. J. Best:
A note on gamma variate generators with shape parameter less than unity. Computing 30(2): 185-188 (1983) - S. Bialas:
On certain properties of Hurwitz determinants for interval polynomials. Computing 30(2): 149-155 (1983) - W. Burmeister, Jochen W. Schmidt:
On the R-order of coupled sequences III. Computing 30(2): 157-169 (1983) - Luc Devroye:
Moment inequalities for random variables in computational geometry. Computing 30(2): 111-119 (1983) - Charles B. Dunham:
The one-sided Remez algorithm. Computing 30(3): 275-278 (1983) - J. Ebert:
st-Ordering the vertices of biconnected graphs. Computing 30(1): 19-33 (1983) - Reinhard Frank, Jörg Hertling, J. P. Monnet:
The application of iterated defect correction to variational methods for elliptic boundary value problems. Computing 30(2): 121-135 (1983) - Helmut Gfrerer, J. Guddat, Hansjörg Wacker:
A globally convergent algorithm based on imbedding and parametric optimization. Computing 30(3): 225-252 (1983) - R. Gold, Jürgen Sattler:
Modifikationen des Pollard-Algorithmus. Computing 30(1): 77-89 (1983) - W. Hock, Klaus Schittkowski:
A comparative performance evaluation of 27 nonlinear programming codes. Computing 30(4): 335-358 (1983) - B. J. Hoenders, Cornelis H. Slump:
On the calculation of the exact number of zeroes of a set of equations. Computing 30(2): 137-147 (1983) - Richard F. King:
Improving the Van de Vel Root-Finding method. Computing 30(4): 373-378 (1983) - F. Körner:
An efficient branch and bound algorithm to solve the quadratic integer programming problem. Computing 30(3): 253-260 (1983) - Ladislav Luksan:
Variable metric methods for linearly constrained nonlinear minimax approximation. Computing 30(4): 315-334 (1983) - Athena Makroglou:
A block-by-block method for the numerical solution of Volterra delay integro-differential equations. Computing 30(1): 49-62 (1983) - Gradimir V. Milovanovic, Miodrag S. Petkovic:
On the convergence order of a modified method for simultaneous finding polynomial zeros. Computing 30(2): 171-178 (1983) - W. Mönch:
Secant methods for sparse systems of nonlinear equations with a special structure. Computing 30(3): 213-223 (1983) - Karl Hans Müller:
Rounding error analysis of Horner's scheme. Computing 30(4): 285-303 (1983) - Jon G. Rokne, T. Wu:
A note on the circular complex centered form. Computing 30(3): 201-211 (1983) - Siegfried M. Rump, Harald Böhm:
Least significant bit evaluation of arithmetic expressions in single-precision. Computing 30(3): 189-199 (1983) - Lothar Schmitz:
An improved transitive closure algorithm. Computing 30(4): 359-371 (1983) - Claus-Peter Schnorr, Jürgen Sattler:
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. Computing 30(2): 91-110 (1983) - Jörg H. Siekmann:
Open mathematical problems computer competition. Computing 30(4): 379-380 (1983) - Karl Strehmel, Rüdiger Weiner:
Adaptive Nyström-Runge-Kutta-Methoden für gewöhnliche Differentialgleichungssysteme zweiter Ordnung. Computing 30(1): 35-47 (1983) - A. Yassouridis, R. Koller:
Mehrstufige Auswahldisziplin in einem M/G/1-Processor-sharing-System mit Prioritäten. Computing 30(1): 1-18 (1983) - Harry Yserentant:
A remark on the numerical computation of improper integrals. Computing 30(2): 179-183 (1983) - Harry Yserentant:
On the convergence of multi-level methods for strongly nonuniform families of grids and any number of smoothing steps per level. Computing 30(4): 305-313 (1983)
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-20 06:54 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