Database Paper Browser

Back to papers

Fast Algorithms for Parsing Sequences of Parentheses with Few Errors

Summary: First algorithm to repair unbalanced-parentheses sequences in O(n) + d^{O(1)} time, i.e., linear in input size when minimum edit distance d is small, improving on cubic-time DP. Enables fast repair of semi-structured docs (XML/JSON) with few errors. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1699
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,830 | 17.71%
DOI
10.1145/2902251.2902304

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
3,845 On Repairing Structural Problems In Semi-structured Data 2013 VLDB 6.7073366e-05
Previous Page 1 / 1 Next

Semantically Similar Papers