Pattern matching in dynamic texts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Information and Computation
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |