Optimal parallel algorithms for dynamic expression evaluation and context-free recognition

A bibliography on parallel parsing

ACM SIGPLAN Notices

Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract)

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing

A time-optimal solution for the path cover problem on cographs

Theoretical Computer Science

The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages