External Links

    Journal: Computing

    Volume 21, Issue 4

    273 -- 294Edmund M. Clarke. Program invariants as fixedpoints
    295 -- 322Wolfgang Lindenberg, Leonhard Gerhards. Clique detection for nondirected graphs: Two new algorithms
    323 -- 331Herbert Sonntag. Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen
    333 -- 342Helmut Jürgensen. Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen
    343 -- 358Sean McKee. Best convergence rates of linear multistep methods for Volterra first kind equations
    359 -- 364Iván Lux. Another special method to sample probability density functions

    Volume 21, Issue 3

    183 -- 194Silvano Martello. An algorithm for finding a minimal equivalent graph of a strongly connected digraph
    195 -- 211Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood. Height balanced 2-3 trees
    213 -- 220Gheorghe Paun. On the generative capacity of tree controlled grammars
    221 -- 232Helmut Alt. Square rooting is as difficult as multiplication
    233 -- 243Silke Stiller. Konvergenzverhalten bei der numerischen Lösung von Randwertproblemen mittels eines Doppelschichtpotential-Ansatzes
    245 -- 258E. Huntley, Alan Solon Ivor Zinober. Applications of numerical double laplace transform algorithms to the solution of linear partial differential equations
    259 -- 266David J. Evans, Apostolos Hadjidimos. On the factorization of special symmetric periodic and non-periodic quindiagonal matrices
    267 -- 272Götz Alefeld. Zur Konvergenz des Iterationsverfahrens bei linearen Gleichungssystemen

    Volume 21, Issue 2

    93 -- 104Theodore J. Rivlin. Approximation by circles
    105 -- 111J. T. Marti. On the convergence of the discrete ART algorithm for the reconstruction of digital pictures from their projections
    113 -- 125Reginald P. Tewarson. A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations
    127 -- 141Jürgen Bräuninger. A quasi-Newton method for minimization under linear constraints without evaluating any derivatives
    143 -- 150Klaus D. Heidtmann. Verbesserte Einzelschrittverfahren
    151 -- 157Hermann Brunner. Superconvergence of collocation methods for Volterra integral equations of the first kind
    159 -- 170Jon G. Rokne. A note on the Bernstein algorithm for bounds for interval polynomials
    171 -- 175F. Lether, D. Wilhelmsen, R. Frazier. On the positivity of cotes numbers for interpolatory quadratures with Jacobi abscissas
    177 -- 182Gerald Bitzer. Über eine Minimaleigenschaft der äquidistanten trigonometrischen Interpolation in 2n+1 Knoten

    Volume 21, Issue 1

    1 -- 16Rudolf Bayer, Theo Härder. Preplanning of disk merges
    17 -- 35Rudolf Bayer, Theo Härder. A performance model for preplanned disk sorting
    37 -- 52Ludwig J. Cromme. Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm
    53 -- 69Sven-Åke Gustafson. Convergence acceleration on a general class of power series
    71 -- 79Augustin Paulik. On the determination of the weights in multi-dimensional numerical quadrature
    81 -- 86Silvano Martello, Paolo Toth. Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem
    87 -- 91Sven-Åke Gustafson. Algorithm 38 two computer codes for convergence acceleration
    runs on