Faster Regular Expression Matching-Reference-Cited by-同舟云学术

Faster Regular Expression Matching

Published:2009 Issue: Volume: Page:171-182
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Bille Philip,Thorup Mikkel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02927-1_16

Reference24 articles.

1. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)

2. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk. 194, 487–488 (1970)

3. Lecture Notes in Computer Science;P. Bille,2006

4. Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoret. Comput. Sci. 409, 486–496 (2008)

5. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proc. 39th STOC, pp. 590–598 (2007)

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster Algorithms for Text-to-Pattern Hamming Distances;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Co-lexicographically Ordering Automata and Regular Languages - Part I;Journal of the ACM;2023-08-12

3. REmatch: A Novel Regex Engine for Finding All Matches;Proceedings of the VLDB Endowment;2023-07

4. From regular expression matching to parsing;Acta Informatica;2022-03-30

5. On the size of partial derivatives and the word membership problem;Acta Informatica;2021-07-19