@book{2cebd3a0373a495da9fc7d2cb4c7dc4c,
title = "Dynamic Nested Brackets",
abstract = "We consider the problem of maintaining a string of brackets like (()(()))of length n under a single operation reverse(i). The operation reverse(i) changes the the letter from '(' to) ` ' or vice versa, and returns `yes' if and only if the updated string is balanced. We give lower and upper bounds showing that the complexity of reverse(i) is (-)(log n/loglog n).",
keywords = "Balanced brackets, String manipulation, Data structures, Complexity analysis, Reversible operations",
author = "Stephen Alstrup and Theis Rauhe and Thore Husfeldt",
year = "2001",
month = nov,
language = "English",
series = "IT University Technical Report Series",
number = "TR-2001-9",
publisher = "IT-Universitetet i K{\o}benhavn",
address = "Denmark",
edition = "TR-2001-9",
}