Abstract is missing.
- In Memoriam: Ker-I Ko (1950-2018)Ding-Zhu Du, Jie Wang. 1-7 [doi]
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov ComplexityEric Allender. 8-18 [doi]
- The Power of Self-Reducibility: Selectivity, Information, and ApproximationLane A. Hemaspaandra. 19-47 [doi]
- Who Asked Us? How the Theory of Computing Answers Questions about AnalysisJack H. Lutz, Neil Lutz. 48-56 [doi]
- Promise Problems on Probability DistributionsJan-Hendrik Lorenz, Uwe Schöning. 57-66 [doi]
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense SubsetsShuichi Hirahara, Osamu Watanabe 0001. 67-79 [doi]
- Computability of the Solutions to Navier-Stokes Equations via Effective ApproximationShu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001. 80-112 [doi]
- AutoOverview: A Framework for Generating Structured Overviews over Many DocumentsJie Wang. 113-150 [doi]
- Better Upper Bounds for Searching on a Line with Byzantine RobotsXiaoming Sun, Yuan Sun, Jialin Zhang. 151-171 [doi]
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular FunctionsQingqin Nong, Suning Gong, Qizhi Fang, Ding-Zhu Du. 172-186 [doi]
- Sequential Location Game on Continuous Directional Star NetworksXujin Chen, Xiaodong Hu, Mengqi Zhang. 187-204 [doi]
- Core Decomposition, Maintenance and ApplicationsFeiteng Zhang, Bin Liu 0009, Qizhi Fang. 205-218 [doi]
- Active and Busy Time Scheduling Problem: A SurveyVincent Chau, Minming Li. 219-229 [doi]
- A Note on the Position Value for Hypergraph Communication SituationsErfang Shan, Jilei Shi, Wenrong Lv. 230-237 [doi]
- An Efficient Approximation Algorithm for the Steiner Tree ProblemChi-Yeh Chen, Sun-Yuan Hsieh. 238-251 [doi]
- A Review for Submodular Optimization on Machine Scheduling ProblemsSiwen Liu. 252-267 [doi]
- Edge Computing Integrated with Blockchain TechnologiesChuanwen Luo, Liya Xu, Deying Li 0001, Weili Wu. 268-288 [doi]