| A core calculus for Scala type checking | p. 1 |
| Tree exploration with an oracle | p. 24 |
| Distributed data structures : a survey on informative labeling schemes | p. 38 |
| From deduction graphs to proof nets : boxes and sharing in the graphical presentation of deductions | p. 39 |
| The structure of tractable constraint satisfaction problems | p. 58 |
| On the representation of Kleene algebras with tests | p. 73 |
| From three ideas in TCS to three applications in bioinformatics | p. 84 |
| Decompositions, partitions, and coverings with convex polygons and pseudo-triangles | p. 86 |
| Approximate shortest path queries on weighted polyhedral surfaces | p. 98 |
| A unified construction of the Glushkov, follow, and antimirov automata | p. 110 |
| Algebraic characterizations of unitary linear quantum cellular automata | p. 122 |
| A polynomial time nilpotence test for Galois groups and related results | p. 134 |
| The multiparty communication complexity of exact-T : improved bounds and new problems | p. 146 |
| Crochemore factorization of Sturmian and other infinite words | p. 157 |
| Equations on partial words | p. 167 |
| Concrete multiplicative complexity of symmetric functions | p. 179 |
| On the complexity of limit sets of cellular automata associated with probability measures | p. 190 |
| Coloring random 3-colorable graphs with non-uniform edge probabilities | p. 202 |
| The Kleene equality for graphs | p. 214 |
| On the repetition threshold for large alphabets | p. 226 |
| Improved parameterized upper bounds for vertex cover | p. 238 |
| On comparing sums of square roots of small integers | p. 250 |
| A combinatorial approach to collapsing words | p. 256 |
| Optical linear arrangement of interval graphs | p. 267 |
| The Lempel-Ziv complexity of fixed points of morphisms | p. 280 |
| Partially commutative inverse monoids | p. 292 |
| Learning Bayesian networks does not have to be NP-hard | p. 305 |
| Lower bounds for the transition complexity of NFAs | p. 315 |
| Smart robot teams exploring sparse threes | p. 327 |
| K-sets of convex inclusion chains of planar point sets | p. 339 |
| Toward the eigenvalue power law | p. 351 |
| Multicast transmissions in non-cooperative networks with a limited number of selfish moves | p. 363 |
| Very sparse leaf languages | p. 375 |
| On the correlation between parity and modular polynomials | p. 387 |
| Optimally fast data gathering in sensor networks | p. 399 |
| Magic numbers in the state hierarchy of finite automata | p. 412 |
| Online single machine batch scheduling | p. 424 |
| Machines that can output empty words | p. 436 |
| Completeness of global evaluation logic | p. 447 |
| NOF-multiparty information complexity bounds for pointer jumping | p. 459 |
| Dimension characterizations of complexity classes | p. 471 |
| Approximation algorithms and hardness results for labeled connectivity problems | p. 480 |
| An expressive temporal logic for real time | p. 492 |
| On matroid representability and minor problems | p. 505 |
| Non-cooperative tree creation | p. 517 |
| Guarantees for the success frequency of an algorithm for finding Dodgson-election winners | p. 528 |
| Reductions for monotone boolean circuits | p. 540 |
| Generalised integer programming based on logically defined relations | p. 549 |
| Probabilistic length-reducing automata | p. 561 |
| Sorting long sequences in a single hop radio network | p. 573 |
| Systems of equations over finite semigroups and the #CSP dichotomy conjuecture | p. 584 |
| Valiant's model : from exponential sums to exponential products | p. 596 |
| A reachability algorithm for general petri nets based on transition invariants | p. 608 |
| Approximability of bounded occurrence max ones | p. 622 |
| Fast iterative arrays with restricted inter-cell communication : constructions and decidability | p. 634 |
| Faster algorithm for bisimulation equivalence of normed context-free processes | p. 646 |
| Quantum weakly nondeterministic complexity | p. 658 |
| Minimal chordal sense of direction and circulant graphs | p. 670 |
| Querying and embedding compressed texts | p. 681 |
| Lempel-Ziv dimension for Lempel-Ziv compression | p. 693 |
| Characterizing valiant's algebraic complexity classes | p. 704 |
| The price of defense | p. 717 |
| The data complexity of MDatalog in basic modal logics | p. 729 |
| The complexity of counting functions with easy decision version | p. 741 |
| On non-interactive zero-knowledge proofs of knowledge in the shared random string model | p. 753 |
| Constrained minimum enclosing circle with center on a query line segment | p. 765 |
| Hierarchical unambiguity | p. 777 |
| An efficient algorithm finds noticeable trends of examples concerning the cerny conjecture | p. 789 |
| On genome evolution with innovation | p. 801 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
