The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved dynamic dictionary matching
Information and Computation
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Dynamic Algorithms for the Dyck Languages
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
SIAM Journal on Computing
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We consider the problem of maintaining a string of n brackets '('or')' under the operation reverse(i) that changes the ith bracket from '('to')' or vice versa, and returns 'yes' if and only if the resulting string is properly balanced. We show that this problem can be solved on the RAM in time O(logn/log log n) per operation using linear space and preprocessing. Moreover, we show that this is optimal in the sense that every data structure supporting reverse (no matter its space and preprocessing complexity) needs time Ω(log n/log log n) per operation in the cell probe model.