• Jin R, Wu W, Thai M and Du D. (2021). Black-Box and Data-Driven Computation. Black Box Optimization, Machine Learning, and No-Free Lunch Theorems. 10.1007/978-3-030-66515-9_6. (163-168).

    https://link.springer.com/10.1007/978-3-030-66515-9_6

  • Du D and Wang J. (2020). In Memoriam: Ker-I Ko (1950–2018). Complexity and Approximation. 10.1007/978-3-030-41672-0_1. (1-7).

    http://link.springer.com/10.1007/978-3-030-41672-0_1

  • Hartmanis J, Chang R, Ranjan D and Rohatgi P. (1990). Structural complexity theory: Recent surprises. SWAT 90. 10.1007/3-540-52846-6_73. (1-12).

    http://link.springer.com/10.1007/3-540-52846-6_73

  • Hemachandra L. Structure of complexity classes: Separations, collapses, and completeness. Mathematical Foundations of Computer Science 1988. 10.1007/BFb0017131. (59-72).

    http://www.springerlink.com/index/10.1007/BFb0017131