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