default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelmuth Späth
Person information
- affiliation: University of Oldenburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
[j37]Dragan Jukic, Rudolf Scitovski
, Helmuth Späth:
Partial Linearization of One Class of the Nonlinear Total Least Squares Problem by Using the Inverse Model Function. Computing 62(2): 163-178 (1999)- [j36]Helmuth Späth:
Estimating the parameters of an ellipse when angular differences are known. Comput. Stat. 14(4): 491-500 (1999) - [j35]K. Brüntjen, Helmuth Späth:
Incomplete total least squares. Numerische Mathematik 81(4): 521-538 (1999) - 1996
- [j34]Helmuth Späth:
Least-Squares Fitting by Circles. Computing 57(2): 179-185 (1996) - 1995
- [b3]Helmuth Späth:
Two-dimensional spline interpolation algorithms. A K Peters 1995, ISBN 978-1-56881-017-1, pp. I-VIII, 1-304 - [b2]Helmuth Späth:
One-dimensional spline interpolation algorithms. A K Peters 1995, ISBN 978-1-56881-016-4, pp. I-X, 1-404 - 1994
- [b1]Helmuth Späth:
Numerik - eine Einführung für Mathematiker und Informatiker. Mathematische Grundlagen der Informatik, Vieweg 1994, ISBN 978-3-528-05389-5, pp. I-X, 1-301
1980 – 1989
- 1988
- [j33]Helmuth Späth, Jörg Meier:
Flexible smoothing with periodic cubic splines and fitting with closed curves. Computing 40(4): 293-300 (1988) - 1986
- [j32]Helmuth Späth:
Clusterwise linear least absolute deviations regression. Computing 37(4): 371-377 (1986) - 1985
- [j31]Helmuth Späth:
Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs. Z. Oper. Research 29(3): 125-131 (1985) - 1982
- [j30]Helmuth Späth:
A fast algorithm for clusterwise linear regression. Computing 29(2): 175-181 (1982) - 1981
- [j29]Helmuth Späth:
Correction to algorithm 39 clusterwise linear regression. Computing 26(3): 275 (1981)
1970 – 1979
- 1979
- [j28]Helmuth Späth:
Algorithm 39 Clusterwise linear regression. Computing 22(4): 367-373 (1979) - 1978
- [j27]Helmuth Späth:
Explizite Lösung des dreidimensionalen Minimax-Standortproblems in der City-Block-Distanz. Z. Oper. Research 22(1): 229-237 (1978) - 1977
- [j26]S. Stöppler, Dietrich Ohse, Helmuth Späth, D. Günter Liesegang, Josef Heinhold, W. P. Schmidt:
Buchbesprechungen. Math. Methods Oper. Res. 21(2): B80-B84 (1977) - [j25]Joachim Gwinner, H. Läpple, Christoph Schneeweiss, Hans G. Bartels, Egon F. Kasper, Karl-Heinz Waldmann, Reiner Horst, R. Hebel, Helmuth Späth:
Buchbesprechungen. Math. Methods Oper. Res. 21(4): B159-B164 (1977) - [j24]Helmuth Späth:
Partitionierende Cluster-Analyse bei Binärdaten am Beispiel von bundesdeutschen Hochschulen und Diplomstudiengängen. Math. Methods Oper. Res. 21(4): B85-B96 (1977) - 1976
- [j23]Helmuth Späth:
Algorithm 30 L1 cluster analysis. Computing 16(4): 379-387 (1976) - [j22]K. Malinowski, H. Läpple, Klaus-Peter Kistner, Helmuth Späth, T. Talmon:
Buchbesprechungen. Math. Methods Oper. Res. 20(1): 65-68 (1976) - [j21]Helmuth Späth, U. Hielscher, H. E. Büschgen:
Buchbesprechungen. Math. Methods Oper. Res. 20(2): B84-B86 (1976) - [j20]Joachim Gwinner, Helmuth Späth, Wolfgang Gentzsch, G. Gallus, Manfred Meyer, G. Kiefer, Tomas Gal:
Buchbesprechungen. Math. Methods Oper. Res. 20(3): 146-150 (1976) - [j19]Wei Ping Loh, Karl Inderfurth, M. Hollinger, Peter Hammann, Hermann Meyer zu Selhausen, H. Dellwing, Helmuth Späth, Hans-Joachim Lenz:
Buchbesprechungen. Math. Methods Oper. Res. 20(4): B168-B174 (1976) - [j18]W. Stahl, Wolfgang Domschke, Dietrich Ohse, Helmuth Späth, Ch. Niedereichholz:
Buchbesprechungen. Math. Methods Oper. Res. 20(5): 237-240 (1976) - 1975
- [j17]Helmuth Späth, Helmut Wegmann, K. Fallaschinski, F. Münnich, Rainer E. Burkard, Thomas M. Liebling, Wolfgang Bühler, Josef Heinhold, K. Eicher, H. Läpple:
Buchbesprechungen. Z. Oper. Research 19(4): B141-B148 (1975) - [j16]Helmuth Späth, Hans-Jürgen Zimmermann, R. Hujer, Willi Törnig, T. Talmon, G. Reckel, Werner Dinkelbach, R. Gollers, F. Münnich, Peter Stahlknecht, W. Schmale:
Buchbesprechungen. Z. Oper. Research 19(5): 213-221 (1975) - 1974
- [j15]G. Merle, Helmuth Späth:
Computational experiences with discrete Lp-Approximation. Computing 12(4): 315-321 (1974) - [j14]H. Läpple, H. Todt, Helmuth Späth, A. Schub, F. Isenbart, T. Talmon, H.-D. Heike, P. Schaltegger, H. Wiggert, G. Gallus, Tomas Gal:
Buchbesprechungen. Z. Oper. Research 18(6): B256-B263 (1974) - 1973
- [j13]Helmuth Späth:
Clustering of one-dimensional ordered data. Computing 11(2): 175-177 (1973) - 1972
- [j12]Helmuth Späth:
Zur Glättung empirischer Häufigkeitsverteilungen. Computing 10(4): 353-357 (1972) - 1971
- [j11]Helmuth Späth:
The numerical calculation of high degree lidstone splines with equidistant knots by blockunderrelaxation. Computing 7(1-2): 65-74 (1971) - [j10]Helmuth Späth:
The numerical calculation of quintic splines by blockunderrelaxation. Computing 7(1-2): 75-82 (1971) - [j9]Helmuth Späth:
Algorithm 16 two-dimensional exponential splines. Computing 7(3-4): 364-369 (1971) - [j8]Helmuth Späth:
Berichtigung zu Algorithmus 10. Computing 8(1-2): 200-201 (1971) - 1970
- [j7]Helmuth Späth:
Algorithm 375: Fitting data to one exponential [E2]. Commun. ACM 13(2): 120 (1970) - [j6]Helmuth Späth:
Algorithm 376: Least squares fit by f(x) = A cos(Bx+C [E2]. Commun. ACM 13(2): 121-122 (1970)
1960 – 1969
- 1969
- [j5]Helmuth Späth:
Algorithmus 10 Zweidimensionale glatte Interpolation. Computing 4(2): 178-182 (1969) - [j4]Helmuth Späth:
Exponential spline interpolation. Computing 4(3): 225-233 (1969) - 1967
- [j3]Helmuth Späth:
Algorithm 295: Exponential curve fit. Commun. ACM 10(2): 87 (1967) - [j2]Helmuth Späth:
Certification of algorithm 285: the mutual primal-dual method. Commun. ACM 10(7): 453 (1967) - [j1]Helmuth Späth:
Algorithm 315: The damped Taylor's series method for minimizing a sum of squares and for solving systems of nonlinear equations. Commun. ACM 10(11): 726-728 (1967)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 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:
