Searching for "Dynamic word problems." – sorted by Relevance.
-
Dynamic Word Problems
- Dynamic Word Problems Gudmund Skovbjerg Frandsen Peter Bro Miltersen Sven Skyum BRICS y
- Cited by 15 (6 self) – Add To MetaCart
-
Dynamic Algorithms for the Dyck Languages
- of strings of properly balanced parentheses. We also study the Dynamic Word problem for the free group. We
- Cited by 8 (7 self) – Add To MetaCart
-
On dynamic bit-probe complexity
- , and several predecessor-type problems. We use this to obtain the same upper bound for dynamic word and prefix
- Cited by 1 (0 self) – Add To MetaCart
-
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
- language with two or more letters. This implies the same lower bound for the dynamic word problem
- Cited by 10 (4 self) – Add To MetaCart
-
Searching Constant Width Mazes Captures the AC° Hierarchy
- are not encountered too often, so this may be of independent interest. We then use results on dynamic word problems
- Cited by 20 (4 self) – Add To MetaCart
-
Tight bounds for the partial-sums problem
- -sum queries; a dynamic-word problem asks only for the sumof all elements in the array. Depending
- Cited by 12 (4 self) – Add To MetaCart

