Volume 410, Number 1, January 2009
: On the descriptional complexity of scattered context grammars.
Volume 410, Numbers 2-3, February 2009
Frank S. de Boer
: A shared-variable concurrency analysis of multi-threaded object-oriented programs.
Volume 410, Numbers 4-5, February 2009
, Hosna Jabbari
: Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges.
: What does it mean to say that a physical system implements a computation?
Philip D. Welch
: Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems.
Volume 410, Numbers 6-7, February 2009
: On the cost of uniform protocols whose memory consumption is adaptive to interval contention.
: Towards a real-time distributed computing model.
Volume 410, Numbers 8-10, March 2009
: The degree distribution of random k-trees.
: Treewidth and logical definability of graph products.
: A more effective linear kernelization for cluster editing.
: Short fail-stop signature scheme based on factorization and discrete logarithm assumptions.
, Changyuan Yu
: A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph.
: Dynamic TCP acknowledgment with sliding window.
: A quadratic algorithm for the 2-cyclic robotic scheduling problem.
: k-difference matching in amortized linear time for all the words in a text.
: Efficient computation of the iteration of functions.
: On the complexity of approximating the Hadwiger number.
: On the simplification of infinite morphic words.
Volume 410, Number 11, March 2009
: Elementary differences among jump classes.
, Shang-Hua Teng
: Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces.
Volume 410, Numbers 12-13, March 2009
Murdoch James Gabbay
: A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets.
Volume 410, Number 14, March 2009
, David Peleg
: Distributed algorithms for partitioning a swarm of autonomous mobile robots.
Volume 410, Number 15, April 2009
, Dana Randall
: Convergence rates of Markov chains for some self-assembly and non-saturated Ising models.
Volume 410, Number 16, April 2009
: Pictures worth a thousand tiles, a geometrical programming language for self-assembly.
: The 4-way deterministic tiling problem is undecidable.
Volume 410, Number 17, April 2009
Volume 410, Number 18, April 2009
Volume 410, Number 19, April 2009
Kevin L. Chang
: Multiple pass streaming algorithms for learning mixtures of distributions in Rd.
: Learning efficiency of very simple grammars from positive data.
Volume 410, Number 20, May 2009
Volume 410, Numbers 21-23, May 2009
, Jirí Techet
: An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations.
: Asymptotic subword complexity of fixed points of group substitutions.
: Truthful mechanisms for two-range-values variant of unrelated scheduling.
: Maximum scan statistics and channel assignment problems in homogeneous wireless networks.
: Deterministic bottom-up tree transducers and ground term rewrite systems.
: Finding a tree structure in a resolution proof is NP-complete.
Volume 410, Numbers 24-25, May 2009
Volume 410, Number 26, June 2009
: The impact of parametrization in memetic evolutionary algorithms.
Volume 410, Numbers 27-29, June 2009
, Kai Salomaa
: State complexity of basic operations on suffix-free regular languages.
Volume 410, Numbers 30-32, August 2009
Anna E. Frid
: Simple equations on binary factorial languages.
, Sheng Yu
: Hierarchy and equivalence of multi-letter quantum finite automata.
Volume 410, Numbers 33-34, August 2009
: A Control Flow Analysis for Beta-binders with and without static compartments.
Volume 410, Number 35, August 2009
Volume 410, Number 36, August 2009
Volume 410, Number 37, September 2009
Mikhail V. Volkov
: Synchronizing automata preserving a chain of partial orders.
Volume 410, Numbers 38-40, September 2009
: On the joint subword complexity of automatic sequences.
: Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words.
: On a generalization of Christoffel words: epichristoffel words.
: A powerful abelian square-free substitution over 4 letters.
: Existential MSO over two successors is strictly weaker than over linear orders.