Abstract is missing.
- A Journey to Computably Enumerable Structures (Tutorial Lectures)Bakh Khoussainov. 1-19 [doi]
- Polynomial-Time Presentations of Algebraic Number FieldsPavel Alaev, Victor L. Selivanov. 20-29 [doi]
- Multiple Permitting and Array NoncomputabilityKlaus Ambos-Spies. 30-39 [doi]
- Degrees of Categoricity for Prime and Homogeneous ModelsNikolay Bazhenov, Margarita Marchuk. 40-49 [doi]
- Universality in Freezing Cellular AutomataFlorent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier. 50-59 [doi]
- A Deontic Logic Reasoning InfrastructureChristoph Benzmüller, Xavier Parent, Leendert W. N. van der Torre. 60-69 [doi]
- Optimized Program Extraction for Induction and CoinductionUlrich Berger 0001, Olga Petrovska. 70-80 [doi]
- Computing Tree Width: From Theory to Practice and BackSebastian Berndt. 81-88 [doi]
- Using Structural Properties for Integer ProgramsSebastian Berndt, Kim-Manuel Klein. 89-96 [doi]
- From Eventually Different Functions to Pandemic NumberingsAchilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies. 97-106 [doi]
- Divide and Conquer Computation of the Multi-string BWT and LCP ArrayPaola Bonizzoni, Gianluca Della Vedova, Serena Nicosia, Yuri Pirola, Marco Previtali, Raffaella Rizzi. 107-117 [doi]
- Some Observations on Infinitary ComplexityMerlin Carl. 118-125 [doi]
- Taming Koepke's ZooMerlin Carl, Sabrina Ouazzani, Philip D. Welch. 126-135 [doi]
- Online Computability and Differentiation in the Cantor SpaceDouglas Cenzer, Diego A. Rojas. 136-145 [doi]
- Turing's Vision and Deep LearningMartin Davis. 146-155 [doi]
- Computing and Scheduling with Explorable UncertaintyThomas Erlebach. 156-160 [doi]
- Diminishable Parameterized Problems and Strict Polynomial KernelizationHenning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier. 161-171 [doi]
- New Nonterminal Complexity Results for Semi-conditional GrammarsHenning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele. 172-182 [doi]
- Kernelization Lower Bounds for Finding Constant-Size SubgraphsTill Fluschnik, George B. Mertzios, André Nichterlein. 183-193 [doi]
- On General Sum Approximations of Irrational NumbersIvan Georgiev, Lars Kristiansen, Frank Stephan 0001. 194-203 [doi]
- Computability of Ordinary Differential EquationsDaniel S. Graça, Ning Zhong 0002. 204-213 [doi]
- Topological Analysis of RepresentationsMathieu Hoyrup. 214-223 [doi]
- A Unified Framework for Designing EPTAS's for Load Balancing on Parallel MachinesIshai Kones, Asaf Levin. 224-233 [doi]
- Weak Reduction Principle and Computable Metric SpacesMargarita V. Korovina, Oleg V. Kudinov. 234-243 [doi]
- Decidable and Undecidable Fragments of First-Order Concatenation TheoryLars Kristiansen, Juvenal Murwanashyaka. 244-253 [doi]
- Algorithm Analysis Through Proof ComplexityMassimo Lauria. 254-263 [doi]
- Computing with SAT Oracles: Past, Present and FutureJoão Marques-Silva. 264-276 [doi]
- pTimothy H. McNicholl, Don M. Stull. 277-286 [doi]
- Algorithmic Statistics and Prediction for Polynomial Time-Bounded AlgorithmsAlexey Milovanov. 287-296 [doi]
- A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximalMartin Monath. 297-306 [doi]
- The Complexity of Tukey Types and Cofinal TypesMarie Nicholson. 307-317 [doi]
- Functionals of Type 3 as Realisers of Classical Theorems in AnalysisDag Normann. 318-327 [doi]
- Enumeration Degrees and TopologyArno Pauly. 328-337 [doi]
- A Taxonomy of Deviant EncodingsPaula Quinon. 338-348 [doi]
- Elementary Bi-embeddability Spectra of StructuresDino Rossegger. 349-358 [doi]
- A Generic m-ReducibilityAlexander N. Rybalov. 359-364 [doi]
- Some Nonstandard Equivalences in Reverse MathematicsSam Sanders. 365-375 [doi]
- Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract)Svetlana V. Selivanova, Victor L. Selivanov. 376-385 [doi]
- What Is the Concept of Computation?Wilfried Sieg. 386-396 [doi]
- Witness Hiding Without Extractors or SimulatorsAndré Souto, Luís Antunes 0002, Paulo Mateus, Andreia Teixeira. 397-409 [doi]
- Algorithms and Geometric ConstructionsVladimir Uspenskiy, Alexander Shen. 410-420 [doi]
- Computing with Multisets: A Survey on Reaction Automata TheoryTakashi Yokomori, Fumiya Okubo. 421-431 [doi]