| 1183 | -- | 1208 | Simon Ware, Robi Malik. Compositional Verification of the generalized Nonblocking Property using Abstraction and Canonical Automata |
| 1209 | -- | 1220 | Zhengbang Zha, Lei Hu. Constructing New APN Functions from known PN Functions |
| 1221 | -- | 1234 | Stephen A. Fenner, Yong Zhang. On the Complexity of the Hidden Subgroup Problem |
| 1235 | -- | 1242 | Yunchao Wei, Fuguang Chen. Generalized connectivity of (n, k)-Star graphs |
| 1243 | -- | 1254 | Abuzer Yakaryilmaz, A. C. Cem Say. Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines |
| 1255 | -- | 1280 | Hermann Gruber, Markus Holzer. Provably Shorter Regular Expressions from Finite Automata |
| 1281 | -- | 1298 | Sebastian Deorowicz, Agnieszka Danek. Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem |
| 1299 | -- | 1328 | Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee. Two for One: Tight Approximation of 2D Bin Packing |
| 1329 | -- | 1338 | Aysun Ozan Aytaç, Hanife Aksu. Some Results for the rupture Degree |
| 1339 | -- | 0 | Kenya Ueno. Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds |