Context-free recognition via shortest paths computation: a version of Valiant's algorithm

Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM (JACM)

Language constrained graph problems: a microcosm of engineering research and development

CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications

Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm

IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I

Parsing by matrix multiplication generalized to Boolean grammars

Theoretical Computer Science