default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Vol. 16, 1976
Volume 16, Numbers 1-2, March 1976
- Ramon E. Moore:
On computing the range of a rational function of n variables over a bounded region. 1-15 - Jon G. Rokne:
Errorbounds for simple zeros of lambda-matrices. 17-27 - C. J. Hegedüs:
A method for calculating the reciprocal coefficients of function matrices. 29-37 - F. Fuchs:
A-stability of Runge-Kutta methods with single and multiple nodes. 39-48 - Wolf Hofmann, Heinrich Voss:
Über die Konvergenz von Shooting-Verfahren. 49-60 - P. Rentrop:
Numerical solution of the singular Ginzburg-Landau equations by multiple shooting. 61-67 - Jean Marie François Chamayou:
On a direct algorithm for the generation of log-normal pseudo-random numbers. 69-76 - Andrzej Osyczka:
An algorithm of optimization for a special class of networks. 77-97 - Kurt Mehlhorn, Zvi Galil:
Monotone switching circuits and boolean matrix product. 99-111 - Manfred Nagl
:
Formal languages of labelled graphs. 113-137 - Michael M. Weigand:
Algorithmus 27 Ein neuer Algorithmus zur Bestimmung vonk-kürzesten Wegen in einem Graphen. 139-151 - K. R. James, W. Riha:
Algorithm 28 algorithm for generating graphs of a given partition. 153-161 - W. Riha, K. R. James:
Algorithm 29 efficient algorithms for doubly and multiply restricted partitions. 163-168
Volume 16, Number 3, September 1976
- Reinhard Menzel, Hubert Schwetlick:
Über einen Ordnungsbegriff bei Einbettungsalgorithmen zur Lösung nichtlinearer Gleichungen. 187-199 - W. Solak, M. Strus:
The secand method in banach spaces. 201-209 - Jochen W. Schmidt:
Monotone Einschließung von Inversen positiver Elemente durch Verfahren vom Schulz-Typ. 211-219 - Franz-Jürgen Delvos, H.-W. Kösters:
On periodic M-Splines. 221-229 - D. S. Henderson, C. J. Wright:
A schmidt type process for the solution of Ax=b. 231-237 - Ulrich W. Kulisch, Gerd Bohlender:
Formalization and implementation of floating-point matrix operations. 239-261 - Christos H. Papadimitriou:
The NP-Completeness of the bandwidth minimization problem. 263-270 - Karl Dürre:
Fast reversible coding and indexing of colorations. 271-279 - Seymour Ginsburg, Hermann A. Maurer:
On strongly equivalent context-free grammar forms. 281-290 - B. Einarsson:
Remark on algorithm 24, regarding a very common violation of the Fortran standard. 291-292
Volume 16, Number 4, December 1976
- Peter Gordon Anderson, M. R. Garey, Lee E. Heindel:
Computational aspects of deciding if all roots of a polynomial lie within the unit circle. 293-304 - K. L. Majumder, G. P. Bhattacharjee:
Some algorithms for interval interpolating polynomial. 305-317 - W. Baron:
Zur trigonometrischen Interpolation. 319-328 - Kozo Ichida, Fujiichi Yoshimoto, Takeshi Kiyono:
curve fitting by a piecewise cubic polynomial. 329-338 - J. Thomas King, Steven M. Serbin:
Boundary flux estimates for elliptic problems by the perturbed variational method. 339-347 - O. Nevanlinna:
Positive quadratures for volterra equations. 349-357 - L. Fahrmeir:
Approximation von stochastischen Differentialgleichungen auf Digital- und Hybridrechnern. 359-371 - Nicholas V. Findler, W. Rhomberg:
On an approach to the automatic evaluation of the subjects' verbal behavior in Roemer's inkblot tests. 373-378 - Helmuth Späth:
Algorithm 30 L1 cluster analysis. 379-387
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-11-22 19:42 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:
