Skip to main content
Erschienen in:
Buchtitelbild

2020 | OriginalPaper | Buchkapitel

In Memoriam: Ker-I Ko (1950–2018)

verfasst von : Ding-Zhu Du, Jie Wang

Erschienen in: Complexity and Approximation

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Ker-I Ko was a colleague and a friend, and our friendships began from the mid 1980’s. Ker-I passed away peacefully due to lung failure on the 13th of December in 2018 at a hospital in New York, with his wife Mindy Pien and all three children by his side. His passing is a great loss to the theoretical computer science community.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Li, W., Liu, W., Chen, T., Qu, X., Fang, Q., Ko, K.-I.: Competitive profit maximization in social networks. Theor. Comput. Sci. 694, 1–9 (2017)MathSciNetMATHCrossRef Li, W., Liu, W., Chen, T., Qu, X., Fang, Q., Ko, K.-I.: Competitive profit maximization in social networks. Theor. Comput. Sci. 694, 1–9 (2017)MathSciNetMATHCrossRef
3.
Zurück zum Zitat Ran, Y., Zhang, Z., Ko, K.-I., Liang, J.: An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4), 1505–1517 (2016)MathSciNetMATHCrossRef Ran, Y., Zhang, Z., Ko, K.-I., Liang, J.: An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4), 1505–1517 (2016)MathSciNetMATHCrossRef
6.
Zurück zum Zitat Fuxiang, Y., Ko, K.-I.: On parallel complexity of analytic functions. Theor. Comput. Sci. 489–490, 48–57 (2013)MathSciNetMATH Fuxiang, Y., Ko, K.-I.: On parallel complexity of analytic functions. Theor. Comput. Sci. 489–490, 48–57 (2013)MathSciNetMATH
7.
Zurück zum Zitat Bauer, A., Hertling, P., Ko, K.-I.: Computability and complexity in analysis. J. UCS 16(18), 2495 (2010)MathSciNet Bauer, A., Hertling, P., Ko, K.-I.: Computability and complexity in analysis. J. UCS 16(18), 2495 (2010)MathSciNet
8.
Zurück zum Zitat Cheng, Y., Ding-Zhu, D., Ko, K.-I., Lin, G.: On the parameterized complexity of pooling design. J. Comput. Biol. 16(11), 1529–1537 (2009)MathSciNetCrossRef Cheng, Y., Ding-Zhu, D., Ko, K.-I., Lin, G.: On the parameterized complexity of pooling design. J. Comput. Biol. 16(11), 1529–1537 (2009)MathSciNetCrossRef
9.
Zurück zum Zitat Ko, K.-I., Fuxiang, Y.: On the complexity of convex hulls of subsets of the two-dimensional plane. Electr. Notes Theor. Comput. Sci. 202, 121–135 (2008)MathSciNetMATHCrossRef Ko, K.-I., Fuxiang, Y.: On the complexity of convex hulls of subsets of the two-dimensional plane. Electr. Notes Theor. Comput. Sci. 202, 121–135 (2008)MathSciNetMATHCrossRef
10.
Zurück zum Zitat Cheng, Y., Ko, K.-I., Weili, W.: On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1), 120–125 (2008)MathSciNetMATHCrossRef Cheng, Y., Ko, K.-I., Weili, W.: On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1), 120–125 (2008)MathSciNetMATHCrossRef
11.
Zurück zum Zitat Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Electr. Notes Theor. Comput. Sci. 167, 425–447 (2007)MathSciNetMATHCrossRef Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Electr. Notes Theor. Comput. Sci. 167, 425–447 (2007)MathSciNetMATHCrossRef
12.
Zurück zum Zitat Ko, K.-I., Fuxiang, Y.: On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23(1), 2–24 (2007)MathSciNetMATHCrossRef Ko, K.-I., Fuxiang, Y.: On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23(1), 2–24 (2007)MathSciNetMATHCrossRef
13.
Zurück zum Zitat Ko, K.-I., Weihrauch, K., Zheng, X.: Editorial: Math. Log. Quart. 4–5/2007. Math. Log. Q. 53(4–5), 325 (2007)CrossRef Ko, K.-I., Weihrauch, K., Zheng, X.: Editorial: Math. Log. Quart. 4–5/2007. Math. Log. Q. 53(4–5), 325 (2007)CrossRef
14.
Zurück zum Zitat Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1–3), 148–161 (2007)MathSciNetMATHCrossRef Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1–3), 148–161 (2007)MathSciNetMATHCrossRef
15.
Zurück zum Zitat Brattka, V., Hertling, P., Ko, K.-I., Tsuiki, H.: Computability and complexity in analysis. J. Complex. 22(6), 728 (2006)CrossRef Brattka, V., Hertling, P., Ko, K.-I., Tsuiki, H.: Computability and complexity in analysis. J. Complex. 22(6), 728 (2006)CrossRef
16.
Zurück zum Zitat Fuxiang, Y., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complex. 22(6), 803–817 (2006)MathSciNetMATHCrossRef Fuxiang, Y., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complex. 22(6), 803–817 (2006)MathSciNetMATHCrossRef
17.
Zurück zum Zitat Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain II: piecewise straight-line paths. Electr. Notes Theor. Comput. Sci. 120, 45–57 (2005)MathSciNetCrossRef Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain II: piecewise straight-line paths. Electr. Notes Theor. Comput. Sci. 120, 45–57 (2005)MathSciNetCrossRef
18.
Zurück zum Zitat Chou, A.W., Ko, K.-I.: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1–3), 360–369 (2005)MathSciNetMATHCrossRef Chou, A.W., Ko, K.-I.: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1–3), 360–369 (2005)MathSciNetMATHCrossRef
19.
Zurück zum Zitat Brattka, V., Hertling, P., Ko, K.-I., Zhong, N.: Preface: MLQ - Math. Log. Quart. 4–5/2004. Math. Log. Q. 50(4–5), 327–328 (2004)CrossRef Brattka, V., Hertling, P., Ko, K.-I., Zhong, N.: Preface: MLQ - Math. Log. Quart. 4–5/2004. Math. Log. Q. 50(4–5), 327–328 (2004)CrossRef
20.
Zurück zum Zitat Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain I: shortest paths. Math. Log. Q. 50(6), 551–572 (2004)MathSciNetMATHCrossRef Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain I: shortest paths. Math. Log. Q. 50(6), 551–572 (2004)MathSciNetMATHCrossRef
21.
Zurück zum Zitat Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1–3), 325–330 (2004)MathSciNetMATHCrossRef Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1–3), 325–330 (2004)MathSciNetMATHCrossRef
22.
Zurück zum Zitat Ko, K.-I., Nerode, A., Weihrauch, K.: Foreword. Theor. Comput. Sci. 284(2), 197 (2002)CrossRef Ko, K.-I., Nerode, A., Weihrauch, K.: Foreword. Theor. Comput. Sci. 284(2), 197 (2002)CrossRef
23.
Zurück zum Zitat Ko, K.-I.: On the computability of fractal dimensions and hausdorff measure. Ann. Pure Appl. Logic 93(1–3), 195–216 (1998)MathSciNetMATHCrossRef Ko, K.-I.: On the computability of fractal dimensions and hausdorff measure. Ann. Pure Appl. Logic 93(1–3), 195–216 (1998)MathSciNetMATHCrossRef
27.
Zurück zum Zitat Ko, K.-I.: A polynomial-time computable curve whose interior has a nonrecursive measure. Theor. Comput. Sci. 145(1&2), 241–270 (1995)MathSciNetMATHCrossRef Ko, K.-I.: A polynomial-time computable curve whose interior has a nonrecursive measure. Theor. Comput. Sci. 145(1&2), 241–270 (1995)MathSciNetMATHCrossRef
30.
31.
Zurück zum Zitat Ko, K.-I., Tzeng, W.-G.: Three \(\Sigma ^p_2\)-complete problems in computational learning theory. Comput. Complex. 1, 269–310 (1991)MathSciNetMATHCrossRef Ko, K.-I., Tzeng, W.-G.: Three \(\Sigma ^p_2\)-complete problems in computational learning theory. Comput. Complex. 1, 269–310 (1991)MathSciNetMATHCrossRef
33.
35.
Zurück zum Zitat Ko, K.-I.: A note on separating the relativized polynomial time hierarchy by immune sets. ITA 24, 229–240 (1990)MathSciNetMATH Ko, K.-I.: A note on separating the relativized polynomial time hierarchy by immune sets. ITA 24, 229–240 (1990)MathSciNetMATH
36.
Zurück zum Zitat Ko, K.-I.: Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy. J. ACM 37(2), 415–438 (1990)MathSciNetMATHCrossRef Ko, K.-I.: Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy. J. ACM 37(2), 415–438 (1990)MathSciNetMATHCrossRef
37.
38.
39.
Zurück zum Zitat Du, D.-Z., Ko, K.-I.: On the complexity of an optimal routing tree problem. Acta Math. Appl. Sinica (Engl. Ser.) 5, 68–80 (1989)MathSciNetMATHCrossRef Du, D.-Z., Ko, K.-I.: On the complexity of an optimal routing tree problem. Acta Math. Appl. Sinica (Engl. Ser.) 5, 68–80 (1989)MathSciNetMATHCrossRef
40.
Zurück zum Zitat Du, D.-Z., Ko, K.-I.: Complexity of continuous problems on convex functions. Syst. Sci. Math. 2, 70–79 (1989)MATH Du, D.-Z., Ko, K.-I.: Complexity of continuous problems on convex functions. Syst. Sci. Math. 2, 70–79 (1989)MATH
43.
44.
Zurück zum Zitat Du, D., Ko, K.: Some completeness results on decision trees and group testing. SIAM J. Algebraic Discrete Methods 8, 762–777 (1987)MathSciNetMATHCrossRef Du, D., Ko, K.: Some completeness results on decision trees and group testing. SIAM J. Algebraic Discrete Methods 8, 762–777 (1987)MathSciNetMATHCrossRef
45.
47.
Zurück zum Zitat Ko, K.-I.: Corrigenda: on the continued fraction representation of computable real numbers. Theor. Comput. Sci. 54, 341–343 (1987)MathSciNetMATHCrossRef Ko, K.-I.: Corrigenda: on the continued fraction representation of computable real numbers. Theor. Comput. Sci. 54, 341–343 (1987)MathSciNetMATHCrossRef
48.
Zurück zum Zitat Ko, K.-I.: Approximation to measurable functions and its relation to probabilistic computation. Ann. Pure Appl. Logic 30(2), 173–200 (1986)MathSciNetMATHCrossRef Ko, K.-I.: Approximation to measurable functions and its relation to probabilistic computation. Ann. Pure Appl. Logic 30(2), 173–200 (1986)MathSciNetMATHCrossRef
49.
51.
Zurück zum Zitat Ko, K.-I., Long, T.J., Ding-Zhu, D.: On one-way functions and polynomial-time isomorphisms. Theor. Comput. Sci. 47(3), 263–276 (1986)MathSciNetMATHCrossRef Ko, K.-I., Long, T.J., Ding-Zhu, D.: On one-way functions and polynomial-time isomorphisms. Theor. Comput. Sci. 47(3), 263–276 (1986)MathSciNetMATHCrossRef
52.
54.
55.
Zurück zum Zitat Ko, K.-I.: Nonlevelable sets and immune sets in the accepting density hierarchy in NP. Math. Syst. Theory 18(3), 189–205 (1985)MathSciNetMATHCrossRef Ko, K.-I.: Nonlevelable sets and immune sets in the accepting density hierarchy in NP. Math. Syst. Theory 18(3), 189–205 (1985)MathSciNetMATHCrossRef
56.
59.
61.
62.
Zurück zum Zitat Ko, K.-I.: Some negative results on the computational complexity of total variation and differentiation. Inf. Control 53(1/2), 21–31 (1982)MathSciNetMATH Ko, K.-I.: Some negative results on the computational complexity of total variation and differentiation. Inf. Control 53(1/2), 21–31 (1982)MathSciNetMATH
63.
67.
Zurück zum Zitat Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 front matter - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009) Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 front matter - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009)
68.
Zurück zum Zitat Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 preface - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009) Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 preface - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009)
69.
Zurück zum Zitat Yu, F., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles for a two-dimensional domain. In: CCA, pp. 341–355 (2005) Yu, F., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles for a two-dimensional domain. In: CCA, pp. 341–355 (2005)
71.
Zurück zum Zitat Ko, K.-I.: Fractals and complexity. In: CCA (1996) Ko, K.-I.: Fractals and complexity. In: CCA (1996)
72.
Zurück zum Zitat Ko, K.-I., Weihrauch, K.: On the measure of two-dimensional regions with polynomial-time computables boundaries. In: Computational Complexity Conference, pp. 150–159 (1996) Ko, K.-I., Weihrauch, K.: On the measure of two-dimensional regions with polynomial-time computables boundaries. In: Computational Complexity Conference, pp. 150–159 (1996)
73.
Zurück zum Zitat Chou, A.W., Ko, K.-I.: Some complexity issues on the simply connected regions of the two-dimensional plane. In: STOC, pp. 1–10 (1993) Chou, A.W., Ko, K.-I.: Some complexity issues on the simply connected regions of the two-dimensional plane. In: STOC, pp. 1–10 (1993)
74.
Zurück zum Zitat Ko, K.-I.: A note on the instance complexity of pseudorandom sets. In: Computational Complexity Conference, pp. 327–337 (1992) Ko, K.-I.: A note on the instance complexity of pseudorandom sets. In: Computational Complexity Conference, pp. 327–337 (1992)
75.
Zurück zum Zitat Ko, K.-I.: Integral equations, systems of quadratic equations, and exponential-time completeness (extended abstract). In: STOC, pp. 10–20 (1991) Ko, K.-I.: Integral equations, systems of quadratic equations, and exponential-time completeness (extended abstract). In: STOC, pp. 10–20 (1991)
76.
Zurück zum Zitat Ko, K.-I.: On the complexity of learning minimum time-bounded Turing machines. In: COLT, pp. 82–96 (1990) Ko, K.-I.: On the complexity of learning minimum time-bounded Turing machines. In: COLT, pp. 82–96 (1990)
77.
Zurück zum Zitat Ko, K.-I., Marron, A., Tzeng, W.-G.: Learning string patterns and tree patterns from examples. In: ML, pp. 384–391 (1990) Ko, K.-I., Marron, A., Tzeng, W.-G.: Learning string patterns and tree patterns from examples. In: ML, pp. 384–391 (1990)
78.
Zurück zum Zitat Ko, K.-I.: Computational complexity of roots of real functions (extended abstract). In: FOCS, pp. 204–209 (1989) Ko, K.-I.: Computational complexity of roots of real functions (extended abstract). In: FOCS, pp. 204–209 (1989)
79.
Zurück zum Zitat Ko, K.-I.: Relativized polynomial time hierarchies having exactly K levels. In: Computational Complexity Conference (1988) Ko, K.-I.: Relativized polynomial time hierarchies having exactly K levels. In: Computational Complexity Conference (1988)
80.
Zurück zum Zitat Ko, K.-I.: Distinguishing bounded reducibilities by sparse sets. In: Computational Complexity Conference, pp. 181–191 (1988) Ko, K.-I.: Distinguishing bounded reducibilities by sparse sets. In: Computational Complexity Conference, pp. 181–191 (1988)
81.
Zurück zum Zitat Ko, K.-I: Relativized polynominal time hierarchies having exactly K levels. In: STOC, pp. 245–253 (1988) Ko, K.-I: Relativized polynominal time hierarchies having exactly K levels. In: STOC, pp. 245–253 (1988)
82.
Zurück zum Zitat Book, R.V., Ko, K.-I.: On sets reducible to sparse sets. In: Computational Complexity Conference (1987) Book, R.V., Ko, K.-I.: On sets reducible to sparse sets. In: Computational Complexity Conference (1987)
83.
Zurück zum Zitat Ko, K.-I.: On helping by robust oracle machines. In: Computational Complexity Conference (1987) Ko, K.-I.: On helping by robust oracle machines. In: Computational Complexity Conference (1987)
85.
Zurück zum Zitat Ko, K.-I, Long, T.J., Du, D.-Z.: A note on one-way functions and polynomial-time isomorphisms (extended abstract). In: STOC, pp. 295–303 (1986) Ko, K.-I, Long, T.J., Du, D.-Z.: A note on one-way functions and polynomial-time isomorphisms (extended abstract). In: STOC, pp. 295–303 (1986)
86.
Zurück zum Zitat Ko, K.: Applying techniques of discrete complexity theory to numerical computation. In: Book, R. (ed.) Studies in Complexity Theory, pp. 1–62. Research Notes in Theoretical Computer Science, Pitman (1986) Ko, K.: Applying techniques of discrete complexity theory to numerical computation. In: Book, R. (ed.) Studies in Complexity Theory, pp. 1–62. Research Notes in Theoretical Computer Science, Pitman (1986)
87.
Zurück zum Zitat Ko, K.: Constructing oracles by lower bound techniques for circuits. In: Du, D., Hu, G. (eds.) Combinatorics, Computing and Complexity, pp. 30–76. Kluwer Academic Publishers and Science Press, Boston (1989)CrossRef Ko, K.: Constructing oracles by lower bound techniques for circuits. In: Du, D., Hu, G. (eds.) Combinatorics, Computing and Complexity, pp. 30–76. Kluwer Academic Publishers and Science Press, Boston (1989)CrossRef
88.
Zurück zum Zitat Ko, K.: Polynomial-time computability in analysis. In: Ershov, Y.L., et al. (eds.) Handbook of Recursive Mathematics. Recursive Algebra, Analysis and Combinatorics, vol. 2, pp. 1271–1317 (1998) Ko, K.: Polynomial-time computability in analysis. In: Ershov, Y.L., et al. (eds.) Handbook of Recursive Mathematics. Recursive Algebra, Analysis and Combinatorics, vol. 2, pp. 1271–1317 (1998)
89.
Zurück zum Zitat Ko, K.: Computational complexity of fractals. In: Downey, R., et al. (eds.) Proceedings of the 7th and 8th Asian Logic Conferences, pp. 252–269. World Scientific, Singapore (2003) Ko, K.: Computational complexity of fractals. In: Downey, R., et al. (eds.) Proceedings of the 7th and 8th Asian Logic Conferences, pp. 252–269. World Scientific, Singapore (2003)
90.
Zurück zum Zitat Ko, K., Lin, C.-L.: On the complexity of min-max optimization problems and their approximation. In: Du, D.-Z., Pardalos, P.M. (eds.) Minimax and Applications, pp. 219–239. Kluwer (1995) Ko, K., Lin, C.-L.: On the complexity of min-max optimization problems and their approximation. In: Du, D.-Z., Pardalos, P.M. (eds.) Minimax and Applications, pp. 219–239. Kluwer (1995)
92.
Zurück zum Zitat Du, D.-Z., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Higher Education Press, Beijing (2011). (in Chinese) Du, D.-Z., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Higher Education Press, Beijing (2011). (in Chinese)
93.
Zurück zum Zitat Du, D.-Z., Ko, K., Wang, J.: Introduction to Computational Complexity. Higher Education Press, Beijing (2002). (in Chinese) Du, D.-Z., Ko, K., Wang, J.: Introduction to Computational Complexity. Higher Education Press, Beijing (2002). (in Chinese)
94.
Zurück zum Zitat Du, D.-Z., Ko, K.: Problem Solving in Automata, Languages and Complexity. Wiley, New York (2001)CrossRef Du, D.-Z., Ko, K.: Problem Solving in Automata, Languages and Complexity. Wiley, New York (2001)CrossRef
95.
96.
Zurück zum Zitat Du, D.-Z., Ko, K. (eds.): Advances in Algorithms, Languages, and Complexity. Kluwer, Dordrecht (1997)MATH Du, D.-Z., Ko, K. (eds.): Advances in Algorithms, Languages, and Complexity. Kluwer, Dordrecht (1997)MATH
97.
Metadaten
Titel
In Memoriam: Ker-I Ko (1950–2018)
verfasst von
Ding-Zhu Du
Jie Wang
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-41672-0_1