Dynamic nested brackets

DOI10.1016/j.ic.2004.04.006zbMath1105.68056OpenAlexW1968473867MaRDI QIDQ1882928

Theis Rauhe, Thore Husfeldt, Stephen Alstrup

Publication date: 1 October 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.04.006

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Work-sensitive dynamic complexity of formal languages

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Surpassing the information theoretic bound with fusion trees
• Optimal bounds for the predecessor problem and related problems
• Improved dynamic dictionary matching
• Lower bounds for union-split-find related problems on random access machines
• Dynamic word problems
• New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
• Dynamic algorithms for the Dyck languages

This page was built for publication: Dynamic nested brackets