default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 24
Volume 24, Number 1, March 1980
- John B. Kioustelidis:
Optimal segmented approximations. 1-8 - Klaus-Herrmann Meyn:
Convergent solution bounds for linear elliptic boundary value problems of monotone kind. 9-19 - H. Bauch:
On the iterative inclusion of solutions in characteristic initial-value problems with hyperbolic differential equation zst=f(s, t, z). 21-32 - Neli S. Dimitrova:
Über die Distributivgesetze der erweiterten Intervallarithmetik. 33-49 - Alkiviadis G. Akritas, Stylianos D. Danielopoulos:
On the complexity of algorithms for the translation of polynomials. 51-60 - Hussein M. Abdel-Wahab, Tiko Kameda:
On strictly optimal schedules for the cumulative cost-optimal scheduling problem. 61-86 - Lothar Berg:
On the simultaneous calculation of two zeros. 87-91
Volume 24, Numbers 2-3, June 1980
- Helmut Ratschek:
Representation of interval operations by coordinates. 93-96 - Karl Nickel:
Arithmetic of complex sets. 97-105 - Rudi Klatte, Christian P. Ullrich:
On conversions between screens. 107-114 - Dalcidio Moraes Claudio:
Contributions to the structure of computer arithmetic. 115-118 - Rudolf Krawczyk:
Interval extensions and interval iterations. 119-129 - Edgar Kaucher, Siegfried M. Rump:
Generalized iteration methods for bounds of the solution of fixed point operator-equations. 131-137 - Rudi Klatte, Christian P. Ullrich:
Complex sector arithmetic. 139-148 - Gerd Bohlender:
Embedding universal computer arithmetic in higher programming languages. 149-160 - Ernest Gardeñes, Albert Trepat:
Fundamentals of SIGLA, an interval computing system over the completed set of intervals. 161-179 - Kurt Grüner:
Implementation of universal computer arithmetic with optimal accuracy. 181-193 - M. Raith:
Existence and uniqueness of inclusion isotonic centered ball extensions. 195-202 - Jürgen Wolff von Gudenberg:
Determination of minimum sets of the set of zeros of a function. 203-212 - Dieter Oelschlägel, Herbert Süße:
Interval analytic treatment of convex programming problems. 213-225 - Frank R. de Hoog, Richard Weiss:
An approximation theory for boundary value problems on infinite intervals. 227-239 - A. Raptis:
Exponential-fitting methods for the numerical integration of the fourth-order differential equation yIV+f·y=g. 241-250 - Hans Joachim Schmid:
On the numerical solution of non-linear equation characterizing minimal cubature formulae. 251-257 - Apostolos Hadjidimos:
Some basic results on M-matrices in connection with the Accelerated Overrelaxation (AOR) method. 259-268 - K.-P. Kugler, Uwe Pape:
Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen. 269-274
Volume 24, Number 4, December 1980
- John L. Larson, Ahmed H. Sameh:
Algorithms for roundoff error analysis - A relative error approach. 275-297 - Alkiviadis G. Akritas:
The fastest exact algorithms for the isolation of the real roots of a polynomial equation. 299-313 - Eckart W. Gekeler:
Stability of Galerkin multistep procedures in time-homogeneous hyperbolic problems. 315-324 - Elias A. Lipitakis, David J. Evans:
Solving non-linear elliptic difference equations by extendable sparse factorization procedures. 325-339 - P. J. van der Houwen, P. H. M. Wolkenfelt:
On the stability of multistep formulas for Volterra integral equations of the second kind. 341-347 - Paul Dierckx:
Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints. 349-371
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:
