default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 21
Volume 21, Number 1, March 1978
- Rudolf Bayer, Theo Härder:
Preplanning of disk merges. 1-16 - Rudolf Bayer, Theo Härder:
A performance model for preplanned disk sorting. 17-35 - Ludwig J. Cromme:
Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm. 37-52 - Sven-Åke Gustafson:
Convergence acceleration on a general class of power series. 53-69 - Augustin Paulik:
On the determination of the weights in multi-dimensional numerical quadrature. 71-79 - Silvano Martello, Paolo Toth:
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem. 81-86 - Sven-Åke Gustafson:
Algorithm 38 two computer codes for convergence acceleration. 87-91
Volume 21, Number 2, June 1979
- Theodore J. Rivlin:
Approximation by circles. 93-104 - J. T. Marti:
On the convergence of the discrete ART algorithm for the reconstruction of digital pictures from their projections. 105-111 - Reginald P. Tewarson:
A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations. 113-125 - Jürgen Bräuninger:
A quasi-Newton method for minimization under linear constraints without evaluating any derivatives. 127-141 - Klaus D. Heidtmann:
Verbesserte Einzelschrittverfahren. 143-150 - Hermann Brunner:
Superconvergence of collocation methods for Volterra integral equations of the first kind. 151-157 - Jon G. Rokne:
A note on the Bernstein algorithm for bounds for interval polynomials. 159-170 - F. Lether, D. Wilhelmsen, R. Frazier:
On the positivity of cotes numbers for interpolatory quadratures with Jacobi abscissas. 171-175 - Gerald Bitzer:
Über eine Minimaleigenschaft der äquidistanten trigonometrischen Interpolation in 2n+1 Knoten. 177-182
Volume 21, Number 3, September 1979
- Silvano Martello:
An algorithm for finding a minimal equivalent graph of a strongly connected digraph. 183-194 - Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood:
Height balanced 2-3 trees. 195-211 - Gheorghe Paun:
On the generative capacity of tree controlled grammars. 213-220 - Helmut Alt:
Square rooting is as difficult as multiplication. 221-232 - Silke Stiller:
Konvergenzverhalten bei der numerischen Lösung von Randwertproblemen mittels eines Doppelschichtpotential-Ansatzes. 233-243 - E. Huntley, Alan Solon Ivor Zinober:
Applications of numerical double laplace transform algorithms to the solution of linear partial differential equations. 245-258 - David J. Evans, Apostolos Hadjidimos:
On the factorization of special symmetric periodic and non-periodic quindiagonal matrices. 259-266 - Götz Alefeld:
Zur Konvergenz des Iterationsverfahrens bei linearen Gleichungssystemen. 267-272
Volume 21, Number 4, December 1979
- Edmund M. Clarke:
Program invariants as fixedpoints. 273-294 - Wolfgang Lindenberg, Leonhard Gerhards:
Clique detection for nondirected graphs: Two new algorithms. 295-322 - Herbert Sonntag:
Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen. 323-331 - Helmut Jürgensen:
Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen. 333-342 - Sean McKee:
Best convergence rates of linear multistep methods for Volterra first kind equations. 343-358 - Iván Lux:
Another special method to sample probability density functions. 359-364
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-06-29 20:48 CEST 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:
