{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:41Z","timestamp":1725551621041},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_7","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T09:44:25Z","timestamp":1132652665000},"page":"79-94","source":"Crossref","is-referenced-by-count":0,"title":["Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees"],"prefix":"10.1007","author":[{"given":"Yao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Desh","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: FOCS, pp. 534\u2013544 (1998)","DOI":"10.1109\/SFCS.1998.743504"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M.: What is a Pointer Machine? SIGACT News\u00a026(2) (June 1995)","DOI":"10.1145\/202840.202846"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Amran, A.M., Galil, Z.: On Pointers versus Addresses. JACM\u00a039(3) (1992)","DOI":"10.1145\/146637.146666"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1137\/0215072","volume":"15","author":"N. Blum","year":"1986","unstructured":"Blum, N.: On the single-operation worst-case time complexity of the disjoint set union problem. SIAM Journal on Computing\u00a015(4), 1021\u20131024 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-45471-3_44","volume-title":"Algorithm Theory - SWAT 2002","author":"A. Pal\u00f9 Dal","year":"2002","unstructured":"Dal Pal\u00f9, A., Pontelli, E., Ranjan, D.: An Optimal Algorithm for Finding NCA on Pure Pointer Machines. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, p. 428. Springer, Heidelberg (2002)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A Linear-time Algorithm for a Special Case of Disjoint Set Union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, G., et al.: Parallel Execution of Prolog Programs. ACM TOPLAS\u00a023(4) (2001)","DOI":"10.1145\/504083.504085"},{"key":"7_CR8","first-page":"831","volume-title":"Int. Conf. on Fifth Generation Computer Systems","author":"B. Hausman","year":"1988","unstructured":"Hausman, B., et al.: Cut and Side-Effects in Or-Parallel Prolog. In: Int. Conf. on Fifth Generation Computer Systems, pp. 831\u2013840. Springer, Heidelberg (1988)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1996.0008","volume":"52","author":"H. LaPoutr\u00e9","year":"1996","unstructured":"LaPoutr\u00e9, H.: Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines. Journal of Computer and System Sciences\u00a052, 87\u201399 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Naher, S., Alt, H.: A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal of Computing\u00a017(6) (1988)","DOI":"10.1137\/0217070"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Pontelli, E., et al.: An Optimal Data Structure to Handle Dynamic Environments in Non-Deterministic Computations. Computer Languages\u00a028(2) (2002)","DOI":"10.1016\/S0096-0551(02)00004-8"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s004530010036","volume":"28","author":"D. Ranjan","year":"2000","unstructured":"Ranjan, D., et al.: The Temporal Precedence Problem. Algorithmica\u00a028, 288\u2013306 (2000)","journal-title":"Algorithmica"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Ranjan, D., et al.: Data Structures for Order-sensitive Predicates in Parallel Non-deterministic Systems. ACTA Informatica\u00a037(1) (2000)","DOI":"10.1007\/PL00013301"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Storage Modification Machines. SIAM Journal of Computing\u00a09(3) (1980)","DOI":"10.1137\/0209036"},{"key":"7_CR15","volume-title":"Int. Conf. and Symp. on Logic Programming","author":"K. Shen","year":"1992","unstructured":"Shen, K.: Exploiting Dependent And-parallelism in Prolog: The Dynamic Dependent And-parallel Scheme. In: Int. Conf. and Symp. on Logic Programming. MIT Press, Cambridge (1992)"},{"issue":"18","key":"7_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"2","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. Journal of Computer and System Sciences\u00a02(18), 110\u2013127 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory\u00a010 (1977)","DOI":"10.1007\/BF01683268"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-24599-5_25","volume-title":"Logic Programming","author":"Y. Wu","year":"2003","unstructured":"Wu, Y., Pontelli, E., Ranjan, D.: On the Complexity of Dependent And-parallelism in Logic Programming. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 361\u2013376. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:32Z","timestamp":1605643352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11591191_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}