Connection-trap-free database schemes
Contraction algebras and unification of (infinite) terms
Parallel restructuring and evaluation of expressions
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
Perfect matching for regular graphs is AC0-hard for the general matching problem
Processor-time tradeoffs in PRAM simulations
Self-similarity of linear cellular automata
Undecidability of safety for the schematic protection model with cyclic creates
Some remarks on a theorem of Sakarovitch