The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Dynamic nested brackets

På svenska

Author

Summary, in English

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(log n/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 Omega(Iog n/log log n) per operation in the cell probe model. (C) 2004 Elsevier Inc. All rights reserved.

Department/s

  • Computer Science

Publishing year

2004

Language

English

Pages

75-83

Publication/Series

Information and Computation

Volume

193

Issue

2

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science

Status

Published

ISBN/ISSN/Other

  • ISSN: 1090-2651