ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Proofs and pedagogy; science and systems: The grammar tool box
Science of Computer Programming
Fast multiplication of matrices over a finitely generated semiring
Information Processing Letters
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
Faster Scannerless GLR Parsing
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Information and Computation
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Edit distance with duplications and contractions revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Time reduction of stochastic parsing with stochastic context-free grammars
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Recent developments in the theory of data structures
Computer Languages
Parallel string acceptance using lattice graphs
Pattern Recognition Letters
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
Complexity of the path avoiding forbidden pairs problem revisited
Discrete Applied Mathematics
Efficient divide-and-conquer parsing of practical context-free languages
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.00 |
An algorithm for general context-free recognition is given that requires less than n^2 time asymptotically for input strings of length n.