{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:50:09Z","timestamp":1648777809057},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,1]]},"abstract":" We maintain a balanced parenthesis string under insertions and deletions of parenthesis-pairs in such a way that we can efficiently answer parent queries, i.e., given a parenthesis-pair, we want to find the pair that immediately encloses it. Each parenthesis symbol is attached on a node, and we have n such nodes drawn on a straight line. We achieve O(logn\/loglogn) worst-case time per operation on a Pointer Machine, matching the known lower bound on the problem. By transferring our solution to a RAM, we are able to achieve [Formula: see text] worst case time per update, assuming that we know in advance that the parenthesis-pair to be inserted does not destroy the balance of the parenthesis string. <\/jats:p>","DOI":"10.1142\/s0129054114500026","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T22:35:13Z","timestamp":1398724513000},"page":"25-57","source":"Crossref","is-referenced-by-count":0,"title":["PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS"],"prefix":"10.1142","volume":"25","author":[{"given":"GEORGE","family":"LAGOGIANNIS","sequence":"first","affiliation":[{"name":"Department of Science, Agricultural University of Athens, Iera Odos 75, Athens, 11855, Greece"}]}],"member":"219","published-online":{"date-parts":[[2014,4,28]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1090"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236460"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"issue":"4","key":"p_5","first-page":"323","volume":"3","author":"Husfeldt T.","year":"1996","journal-title":"Nordic Journal of Computing"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114500026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:46:04Z","timestamp":1565102764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114500026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":6,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,4,28]]},"published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.1142\/S0129054114500026"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114500026","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}