REmatch: a novel regex engine for finding all matches
Summary: REmatch: a regex engine implementing theoretically optimal enumeration for regexes with capture variables under all-match semantics. Introduces a new algorithm and practical optimizations to avoid naive-implementation costs, matching or beating popular engines while returning every capture match. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,505 | SuSe: Summary Selection for Regular Expression Subsequence Aggregation over Streams | 2025 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,056 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.0001441128 |
| 1,938 | Split-Correctness in Information Extraction | 2019 | PODS | 0.00010028895 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 7,398 | Improving Regular-Expression Matching on Strings Using Negative Factors | 2013 | SIGMOD | 4.7417594e-05 |
| 8,754 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 4.456315e-05 |
Previous
Page 1 / 1
Next