171 | -- | 194 | Cláudia Linhares Sales, Frédéric Maffray. On dart-free perfectly contractile graphs |
195 | -- | 214 | Keqin Li. Analysis of randomized load distribution for reproduction trees in linear arrays and rings |
215 | -- | 231 | Jason J. Holdsworth. Graph traversal and graph transformation |
233 | -- | 248 | Matteo Cavaliere, Peter Leupold. Evolution and observation--a non-standard way to generate formal languages |
249 | -- | 270 | Rodney G. Downey, Evan J. Griffiths, Stephanie Reid. On Kurtz randomness |
271 | -- | 281 | Martin Klazar. On the least exponential growth admitting uncountably many closed permutation classes |
283 | -- | 290 | Gonzalo Navarro, Kimmo Fredriksson. Average complexity of exact and approximate multiple string matching |
291 | -- | 345 | Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit. Updatable timed automata |
347 | -- | 370 | Juan Luis Esteban, Nicola Galesi, Jochen Messner. On the complexity of resolution with bounded conjunctions |
371 | -- | 382 | Richard Nock, Frank Nielsen. On domain-partitioning induction criteria: worst-case bounds for the worst-case based |
383 | -- | 394 | Bala Ravikumar. Peg-solitaire, string rewriting systems and finite automata |
395 | -- | 404 | Dong Pyo Chi, DoYong Kwon. Sturmian words, beta-shifts, and transcendence |
405 | -- | 414 | Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari. Longest increasing subsequences in sliding windows |
415 | -- | 421 | Gerhard J. Woeginger. Seventeen lines and one-hundred-and-one points |