| 367 | -- | 385 | Eric Allender, Andreas Krebs, Pierre McKenzie. Better Complexity Bounds for Cost Register Automata |
| 386 | -- | 393 | John M. Hitchcock, Adewale Sekoni. Nondeterminisic Sublinear Time Has Measure 0 in P |
| 394 | -- | 417 | Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. Computing Parameters of Sequence-Based Dynamic Graphs |
| 418 | -- | 449 | Roei Tell. Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees |
| 450 | -- | 465 | Dariusz Dereniowski, Adam Stanski. On Tradeoffs Between Width- and Fill-like Graph Parameters |
| 466 | -- | 487 | Susanne Albers, Dennis Kraft. Motivating Time-Inconsistent Agents: A Computational Approach |
| 488 | -- | 505 | Jan A. Bergstra, C. A. Middelburg. Process Algebra with Strategic Interleaving |
| 506 | -- | 542 | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski. Pattern Matching and Consensus Problems on Weighted Sequences and Profiles |
| 543 | -- | 566 | Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia. Capturing Points with a Rotating Polygon (and a 3D Extension) |
| 567 | -- | 586 | Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute. Algorithmic Randomness and Fourier Analysis |
| 587 | -- | 614 | Akanksha Agarwal, Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Complexity of Contraction to Generalization of Trees |
| 615 | -- | 633 | Peter Kostolányi. A Unifying Approach to Algebraic Systems Over Semirings |