Parent queries over dynamic balanced parenthesis strings

DOI10.1142/S0129054114500026MaRDI QIDQ5168423zbMATH OpenFDO

Authors George Lagogiannis

Publication date 4 July 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054114500026

zbMATH Keywords

balanced parenthesis stringparent-queriesunion-split-find

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Dynamic nested brackets
• A simple optimal representation for balanced parentheses
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 177536
• Almost fully-parallel parentheses matching

Cites work

• A data structure for dynamic trees
• Dynamic ordered sets with exponential search trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Improved dynamic dictionary matching
• Succinct representation of balanced parentheses and static trees

This page was built for publication: Parent queries over dynamic balanced parenthesis strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168423)