Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Vol. 31, 1983
Volume 31, Number 1, March 1983
- Ekow J. Otoo, T. H. Merrett:
A storage scheme for extendible arrays. 1-9 - Ernst-Erich Doberkat:
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms. 11-31 - D. G. Papworth:
Exact tests of fit for a poisson distribution. 33-45 - Zahari Zlatev
:
Consistency and convergence of general linear multistep variable stepsize variable formula methods. 47-67 - Rainer Ansorge, Klaus Taubert:
Remarks on composite integration methods for ordinary differential equations. 69-82 - Giorgio Carpaneto, Paolo Toth:
Algorithm for the solution of the assignment problem for sparse matrices. 83-94
Volume 31, Number 2, June 1983
- E. L. Ortiz, H. Samara:
Numerical solution of differential eigenvalue problems with an operational approach to the Tau method. 95-103 - George I. Tsamasphyros, Pericles S. Theocaris:
On the convergence of some quadrature rules for Cauchy principal-value and finite-part integrals. 105-114 - Arnold L. Rosenberg, Ivan Hal Sudborough:
Bandwidth and pebbling. 115-139 - Peter Bathelt, F. Hofmann:
A comparison of two Petri net types. 141-148 - L. Hering:
Darstellung von Bézier-Kurven als B-Spline-Kurven. 149-153 - W. Prochazka:
Conformal mapping of the unit circle or of the upper half plane onto a polygon. 155-172 - Felix Breitenecker:
On the choice of an appropriate imbedding algorithm for the solution of unstable linear boundary value problems. 173-176 - M. Lautsch:
An implicit off-step point method for the integration of stiff differential equations. 177-183 - Jürgen Wolff von Gudenberg:
Computing zy with maximum accuracy. 185-189
Volume 31, Number 3, September 1983
- Hossam A. ElGindy, David Avis, Godfried T. Toussaint:
Applications of a two-dimensional hidden-line algorithm to other geometric problems. 191-202 - M. B. Korchemkin:
A heuristic partitioning algorithm for a packaging problem. 203-209 - G. Münzel, G. Renner:
Zur Charakterisierung und Berechnung von symmetrischen Kubaturformeln. 211-230 - W. M. Häußler:
A local convergence analysis for the Gauss-Newton and Levenberg-Morrison-Marquardt Algorithms. 231-244 - Rudolf Krawczyk:
Interval operators of a function of which the Lipschitz matrix is an interval M-matrix. 245-253 - Rudolf Krawczyk:
A remark about the convergence of interval sequences. 255-259 - Qin Mengzhao:
Difference schemes for the dispersive equation. 261-267 - H. Werner:
Algorithm 51. A reliable and numerically stable program for rational interpolation of lagrange data. 269-286
Volume 31, Number 4, December 1983
- W. B. van Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan:
The asymptotic behaviour of a distributive sorting method. 287-303 - Gunter Bolch:
Approximation von Leistungsgrößen symmetrischer Mehrprozessorsysteme. 305-315 - Gregor Engels, Rupert Gall, Manfred Nagl, Wilhelm Schäfer:
Software specification using graph grammars. 317-346 - C. Maas:
Determining the interval number of a triangle-free graph. 347-354 - Burkhard Monien:
The complexity of determining a shortest cycle of even length. 355-369 - Karl Strehmel, Rüdiger Weiner:
Nonlinear contractivity of a class of semi-implicit multistep methods. 371-381
a service of 
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 2024-04-18 20:21 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:
