1. Bartelt, M. W., and McLaughlin, H. W., “Characterizations of strong unicity in approximation theory”, J. Approximation Theory 9, 1973, pp. 255–266.
2. Bartelt, M. W., and Schmidt, D., “On Poreda’s prob1em for strong unicity constants”, J. Approximation Theory 33, 1981, pp. 69–79.
3. Blatt, H.-P., “Strenge Eindeutigkeitskonstanten und Fehlerabschätzungen bei linearer Tschebyscheff-Approximation”, appeared in L. Collatz, G. Meinardus,H. Werner (ed.): Numerische Methoden der Approximationstheorie, Birkhäuser, Basel, 1982, pp. 9–25.
4. Blatt, H.-P, Kaiser, U., and Ruffer-Beedgen, B., “A multiple exchange algorithm in convex programming”, appeared in J. B. Hiriart-Urruty, W. Oettli, J. Stoer (ed.): Optimization: Theory and Algorithms, Marcel Dekker, New York, 1983, pp. 113–130.
5. Blatt, H.-P., and Klotz, V., “Zur Anzahl der Interpolationspunkte polynomialer Tschebyscheff-Approximationen im Einheitskreis”, appeared in L. Collatz, G. Meinardus, H. Werner (ed.): Numerische Methoden der Approximations theore, ISNM 42, Birkhäuser, Basel, 1978, pp. 61–77.