Helmuth Späth

Affiliations:

University of Oldenburg, Germany

According to our database¹, Helmuth Späth authored at least 40 papers between 1967 and 1999.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

1999

Incomplete total least squares.

[BibT_eX]

[DOI]

K. Brüntjen

Helmuth Späth

Numerische Mathematik, 1999

Estimating the parameters of an ellipse when angular differences are known.

[BibT_eX]

[DOI]

Helmuth Späth

Comput. Stat., 1999

Partial Linearization of One Class of the Nonlinear Total Least Squares Problem by Using the Inverse Model Function.

[BibT_eX]

[DOI]

Dragan Jukic

Rudolf Scitovski

Helmuth Späth

Computing, 1999

1996

Least-Squares Fitting by Circles.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1996

1995

One-dimensional spline interpolation algorithms.

[BibT_eX]

Helmuth Späth

A K Peters, ISBN: 978-1-56881-016-4, 1995

Two-dimensional spline interpolation algorithms.

[BibT_eX]

Helmuth Späth

A K Peters, ISBN: 978-1-56881-017-1, 1995

1994

Numerik - eine Einführung für Mathematiker und Informatiker.

[BibT_eX]

Helmuth Späth

Mathematische Grundlagen der Informatik, Vieweg, ISBN: 978-3-528-05389-5, 1994

1988

Flexible smoothing with periodic cubic splines and fitting with closed curves.

[BibT_eX]

[DOI]

Helmuth Späth

Jörg Meier

Computing, 1988

1986

Clusterwise linear least absolute deviations regression.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1986

1985

Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs.

[BibT_eX]

[DOI]

Helmuth Späth

Z. Oper. Research, 1985

1982

A fast algorithm for clusterwise linear regression.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1982

1981

Correction to algorithm 39 clusterwise linear regression.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1981

1979

Algorithm 39 Clusterwise linear regression.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1979

1978

Explizite Lösung des dreidimensionalen Minimax-Standortproblems in der City-Block-Distanz.

[BibT_eX]

[DOI]

Helmuth Späth

Z. Oper. Research, 1978

1977

Buchbesprechungen.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1977

Partitionierende Cluster-Analyse bei Binärdaten am Beispiel von bundesdeutschen Hochschulen und Diplomstudiengängen.

[BibT_eX]

[DOI]

Helmuth Späth

Math. Methods Oper. Res., 1977

Buchbesprechungen.

[BibT_eX]

[DOI]

Joachim Gwinner

H. Läpple

Christoph Schneeweiss

Math. Methods Oper. Res., 1977

1976

Buchbesprechungen.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1976

Buchbesprechungen.

[BibT_eX]

[DOI]

Helmuth Späth

U. Hielscher

H. E. Büschgen

Math. Methods Oper. Res., 1976

Buchbesprechungen.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1976

Buchbesprechungen.

[BibT_eX]

[DOI]

Hermann Meyer zu Selhausen

H. Dellwing

Helmuth Späth

Hans-Joachim Lenz

Math. Methods Oper. Res., 1976

Buchbesprechungen.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1976

Algorithm 30 L<sub>1</sub> cluster analysis.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1976

1975

Buchbesprechungen.

[BibT_eX]

[DOI]

Helmuth Späth

Hans-Jürgen Zimmermann

Z. Oper. Research, 1975

Buchbesprechungen.

[BibT_eX]

[DOI]

Z. Oper. Research, 1975

1974

Buchbesprechungen.

[BibT_eX]

[DOI]

Z. Oper. Research, 1974

Computational experiences with discrete L<sub>p</sub>-Approximation.

[BibT_eX]

[DOI]

G. Merle

Helmuth Späth

Computing, 1974

1973

Clustering of one-dimensional ordered data.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1973

1972

Zur Glättung empirischer Häufigkeitsverteilungen.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1972

1971

Berichtigung zu Algorithmus 10.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1971

Algorithm 16 two-dimensional exponential splines.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1971

The numerical calculation of quintic splines by blockunderrelaxation.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1971

The numerical calculation of high degree lidstone splines with equidistant knots by blockunderrelaxation.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1971

1970

Algorithm 376: Least squares fit by f(x) = A cos(Bx+C [E2].

[BibT_eX]

[DOI]

Helmuth Späth

Commun. ACM, 1970

Algorithm 375: Fitting data to one exponential [E2].

[BibT_eX]

[DOI]

Helmuth Späth

Commun. ACM, 1970

1969

Exponential spline interpolation.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1969

Algorithmus 10 Zweidimensionale glatte Interpolation.

[BibT_eX]

[DOI]

Helmuth Späth

Computing, 1969

1967

Certification of algorithm 285: the mutual primal-dual method.

[BibT_eX]

[DOI]

Helmuth Späth

Commun. ACM, 1967

Algorithm 315: The damped Taylor's series method for minimizing a sum of squares and for solving systems of nonlinear equations.

[BibT_eX]

[DOI]

Helmuth Späth

Commun. ACM, 1967

Algorithm 295: Exponential curve fit.

[BibT_eX]

[DOI]

Helmuth Späth

Commun. ACM, 1967

Helmuth Späth

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...