default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 26
Volume 26, Number 1, March 1981
- Luc Devroye, T. Klincsek:
Average time behavior of distributive sorting algorithms. 1-7 - Jörg R. Mühlbacher:
Full table scatter storage parallel searching. 9-18 - Joachim H. Ahrens, K. D. Kohrt:
Computer methods for efficient sampling from largely arbitrary statistical distributions. 19-31 - Norbert Schneider:
Monotone Einschließung durch Verfahren vom Regula-falsi-Typ unter Verwendung eines verallgemeinerten Steigungsbegriffes. 33-44 - Michael A. Wolfe:
On the convergence of some methods for determining zeros of order-convex operators. 45-56 - Erich Nuding:
Schrankentreue Berechnung der Exponentialfunktion wesentlich-nichtnegativer Matrizen. 57-66 - Piero Filipponi:
An algorithm for computing functions of triangular matrices. 67-71 - Nikolaos I. Ioakimidis
:
On the natural interpolation formula for cauchy type singular integral equations of the first kind. 73-77 - Jiri Rohn:
Strong solvability of interval linear programming problems. 79-82 - V. M. Veselinov:
Derivatives of functions by derivatives of linear positive operators. 83-86 - K. Justen:
A note on regular resolution. 87-89
Volume 26, Number 2, June 1981
- Randolph E. Bank, Andrew H. Sherman:
An adaptive, multi-level method for elliptic boundary value problems. 91-105 - Gerd Pönisch, Hubert Schwetlick:
Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter. 107-121 - John W. Paine, Frank R. de Hoog, Robert S. Anderssen:
On the correction of finite difference eigenvalue approximations for Sturm-Liouville problems. 123-139 - Michael J. Best, Jürgen Bräuninger, Klaus Ritter, Stephen M. Robinson:
A globally and quadratically convergent algorithm for general nonlinear programming problems. 141-153 - Mark H. Overmars, Jan van Leeuwen:
Two general methods for dynamizing decomposable searching problems. 155-166 - Kees Dekker:
Formula manipulation in ALGOL 68 and application to Routh's algorithm. 167-187
Volume 26, Number 3, September 1981
- Manfred R. Trummer:
Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation. 189-195 - Luc Devroye:
The computer generation of poisson random variables. 197-207 - Jo van Nunen, Jaap Wessels:
Solving linear systems by methods based on a probabilistic interpretation. 209-225 - Götz Alefeld:
Bounding the slope of polynomial operators and some applications. 227-237 - John B. Kioustelidis:
Optimal segmented polynomial Ls-approximations. 239-246 - Man Mohan Chawla, Shweta R. Sharma:
Families of fifth order Nyström methods for y″=f(x, y) and intervals of periodicity. 247-256 - Johann Edenhofer, Gerd Schmitz:
Ein implizites Charakteristikenverfahren zur Lösung von Anfangsrandwertaufgaben bei hyperbolischen Systemen und seine Konvergenz. 257-264 - Lothar Berg:
On real factorizations of symmetric circulant sparse matrices. 265-270 - Gunnar Schröder:
Bemerkung zur Differentiation von intervallwertigen Funktionen. 271-274 - Helmuth Späth:
Correction to algorithm 39 clusterwise linear regression. 275
Volume 26, Number 4, December 1981
- Gerd Bohlender, Edgar Kaucher, Rudi Klatte, Ulrich W. Kulisch, Willard L. Miranker, Christian P. Ullrich, Jürgen Wolff von Gudenberg:
FORTRAN for contemporary numerical computation. 277-314 - Helmut Weber, Wilhelm Werner:
On the accurate determination of nonisolated solutions of nonlinear equations. 315-326 - Knut Merten:
Asymptotisch optimale Relaxationsparameter bei nichtlinearen SOR-Verfahren (Newton-SOR-Verfahren). 327-332 - Jochen W. Schmidt:
On the R-order of coupled sequences. 333-342 - Martin Bartusch:
An algorithm for generating all maximal independent subsets of posets. 343-354 - Björn A. Gottwald, Gerhard Wanner:
A reliable rosenbrock integrator for stiff differential equations. 355-360 - Luc Devroye, Godfried T. Toussaint:
A note on linear expected time algorithms for finding convex hulls. 361-366 - Thomas Ottmann, Hans-Werner Six, Derick Wood:
The implementation of insertion and deletion algorithms for 1-2 brother trees. 367-378
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-12-13 20:22 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:
