| 499 | -- | 524 | Mitsunori Ogihara, Till Tantau. On the reducibility of sets inside NP to sets with low information content |
| 525 | -- | 546 | Dan Gusfield, Jens Stoye. Linear time algorithms for finding and representing all the tandem repeats in a string |
| 547 | -- | 561 | Reuven Bar-Yehuda, Zehavit Kehat. Approximating the dense set-cover problem |
| 562 | -- | 592 | Eric Bach, Susan Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous. One-dimensional quantum walks with absorbing boundaries |
| 593 | -- | 616 | Wolfgang Maass, Henry Markram. On the computational power of circuits of spiking neurons |
| 617 | -- | 655 | Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht. An expressive language for linear spatial database queries |
| 656 | -- | 674 | Stefan Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable |
| 675 | -- | 687 | Ning Chen, Xiaotie Deng, Xiaoming Sun. On complexity of single-minded auction |
| 688 | -- | 700 | He Huang, Jinde Cao, Yuzhong Qu. Global robust stability of delayed neural networks with a class of general activation functions |