Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarComputing, Volume 27
Volume 27, Number 1, March 1981
L. H. Fohmann:
Ein Durchbruch zur "Semantisierung" relationaler Datenmodelle? Das Datenmodell der Sprache LEGOL-2. 1-14- Eduardo L. Ortiz, H. Samara:
An operational approach to the Tau method for the numerical solution of non-linear differential equations. 15-25 - Rembert Reemtsen:
On level sets and an approximation problem for the numerical solution of a free boundary problem. 27-35 - Miodrag S. Petkovic:
On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic. 37-55 - E. Karkoschka, Peter Werner:
Einige Ausnahmen zur Rosserschen Regel in der Theorie der Riemannschen Zetafunktion. 57-69 - George I. Tsamasphyros, Pericles S. Theocaris:
Equivalence and convergence of direct and indirect methods for the numerical solution of singular integral equations. 71-80 - Nikolaos I. Ioakimidis:
On the numerical evaluation of derivatives of Cauchy principal value integrals. 81-88 - Miroslaw Truszezynski:
A simple algorithm for finding a cycle of length greater than three and without diagonals. 89-91
Volume 27, Number 2, June 1981
- Klaus Taubert:
Converging multistep methods for initial value problems involving multivalued maps. 123-136 - Werner Höhn, Hans Detlef Mittelmann:
Some remarks on the discrete maximum-principle for finite elements of higher order. 145-154 - Hiroshi Yanai, Masanori Ozawa, S. Kaneko:
Interpolation methods in one dimensional optimization. 155-163 - Michael Struwe:
On the solvability of ordinary differential equations with only partially continuous right-hand-side by difference methods. 165-167 - Hans J. Stetter, Ewa Weinmüller:
On the error control in ODE solvers with local extrapolation. 169-177 - Giorgio Carpaneto, Paolo Toth:
Algorithm for the solution of the Bottleneck Assignment Problem. 179-187
Volume 27, Number 3, September 1981
- Célia Andrade, Neide Bertoldi Franco, Sean McKee:
Convergence of linear multistep methods for volterra first kind equations with k(t, t)≡0. 189-204 - S. Baboolal, George Alistair Watson:
Computational experience with an algorithm for discrete L1 approximation. 245-252 - Ian Robinson, Elise de Doncker:
Algorithm 45. Automatic computation of improper integrals over a bounded or unbounded planar region. 253-284
Volume 27, Number 4, December 1981
- Robert Martinus Maria Mattheij:
Estimates for the errors in the solutions of linear boundary value problems, due to perturbations. 299-318 - Emmanuel Loukakis, Constantine Tsouros:
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically. 349-366 - Burkhard Sündermann:
On a minimal property of trigonometric interpolation at equidistant nodes. 371-372 - B. P. Acharya, Rabindranath Das:
Numerical determination of Cauchy principal value integrals. 373-378
maintained by 
, founded at 
, founded at 
last updated on 2019-04-18 22:15 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
