default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 48
Volume 48, Number 1, March 1992
- Wolfgang Händler:
A multiprocessor working as a Fault-Tolerant cellular automaton. 5-20 - Raghu Shankar, Daniel P. Miranker:
Credible execution of bounded-time parallel systems with delayed diagnosis. 21-37 - Glen S. Miranker:
Titan III supercomputer architectural overview. 39-59 - Rong-Qing Jia, Charles A. Micchelli:
Using the refinement equation for the construction of pre-wavelets V: Extensibility of trigonometric polynomials. 61-72 - Craig C. Douglas, Jan Mandel:
An abstract theory for the domain reduction method. 73-96 - Jochen W. Schmidt:
Constrained smoothing of histograms by quadratic splines. 97-107 - Dario Bini, Victor Y. Pan:
Practical improvement of the divide-and-conquer eigenvalue algorithms. 109-123 - Günter Mayer:
Some remarks on two interval-arithmetic modifications of the newton method. 125-128 - Barry E. Willner, Hung-Jen Chang, John Foy:
Willard Graphs. 129-130
Volume 48, Number 2, June 1992
- Igor Moret:
A projection method for computing turning points of nonlinear equations. 133-147 - Basem S. Attili:
A direct method for the characterization and computation of bifurcation points with corank 2. 149-159 - Heru Suhartanto, Wayne H. Enright:
Detecting and locating a singular point in the numerical solution of IVPs for ODEs. 161-175 - H. W. Stolle, Raimond Strauss:
On the numerical integration of certain singular integrals. 177-189 - Valérie Brasey:
A half-explicit Runge-Kutta method of order 5 for solving constrained mechanical systems. 191-201 - Dusan Surla, Milos Rackovic
:
The application of ψ-transform for determining a near-optimal path in the presence of polyhedral obstacles. 203-212 - N. Muthiyalu, S. Usha:
Eigenvalues of centrosymmetric matrices. 213-218
Volume 48, Numbers 3-4, September 1992
- John K. Reid:
The advantages of Fortran 90. 219-238 - Daniel W. Lozier, Peter R. Turner:
Robust parallel computation in floating-point and SLI arithmetic. 239-257 - Marida Bertocchi, Luca Brandolini, Leszek Slominski, J. Sobczynska:
A Monte-Carlo approach for 0-1 programming problems. 259-274 - Guo-Jin Wang:
Generating NURBS curves by envelopes. 275-289 - Ferenc Kálovics:
A reliable method for solving nonlinear systems of equations of few variables. 291-302 - Yi Xiao, Fangjun Zhou:
Nonmonotone trust region methods with curvilinear path in unconstrained optimization. 303-317 - Harry Munack:
On global optimization using interval arithmetic. 319-336 - Günter Rote:
The convergence rate of the sandwich algorithm for approximating convex functions. 337-361 - Jochen W. Schmidt:
Positive, monotone, andS-convexC1-interpolation on rectangular grids. 363-371 - Rossana Morandi:
A blending function method with interior constraints. 373-380 - George J. Fix, Rangachary Kannan:
A random direction algorithm for an intersection problem. 381-385
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:35 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:
