Journal: Theoretical Computer Science

Volume 321, Issue 2-3

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

Volume 321, Issue 1

1 -- 3. Preface
5 -- 12Michael A. Bender, Martin Farach-Colton. The Level Ancestor Problem simplified
13 -- 24Claudson F. Bornstein, Santosh Vempala. Flow metrics
25 -- 40Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint. Space-efficient planar convex hull algorithms
41 -- 57Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber. Searching in random partially ordered sets
59 -- 72Theodoulos Garefalakis. The generalized Weil pairing and the discrete logarithm problem on elliptic curves
73 -- 94Alejandro Hevia, Marcos A. Kiwi. Electronic jury voting protocols
95 -- 101S. Muthukrishnan, Süleyman Cenk Sahinalp. An efficient algorithm for sequence comparison with block reversals
103 -- 123Hadas Shachnai, Tami Tamir. Tight bounds for online class-constrained packing
125 -- 148Brett Stevens, Eric Mendelsohn. Packing arrays
149 -- 170Mario Szegedy, Xiaomin Chen. Computing Boolean functions from multiple faulty copies of input bits