{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:39Z","timestamp":1725561279841},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_25","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"361-376","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Dependent And-Parallelism in Logic Programming"],"prefix":"10.1007","author":[{"given":"Y.","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., et al.: Marked Ancestor Problems. In: FOCS, pp. 534\u2013544 (1998)","DOI":"10.1109\/SFCS.1998.743504"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Galil, Z.: On Pointers versus Addresses. JACM\u00a039(3) (1992)","DOI":"10.1145\/146637.146666"},{"issue":"4","key":"25_CR3","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":"25_CR4","volume-title":"SODA","author":"R. Cole","year":"1999","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA Queries on Trees. In: SODA. ACM, New York (1999)"},{"key":"25_CR5","unstructured":"Dal Pal\u00f9, A., et al.: An Optimal Algorithm for NCA on PPMs. In: SWAT (2002)"},{"key":"25_CR6","first-page":"157","volume-title":"IJCAI","author":"N. Drakos","year":"1989","unstructured":"Drakos, N.: Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking. In: IJCAI, pp. 157\u2013162. Morgan Kaufmann, San Francisco (1989)"},{"key":"25_CR7","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":"25_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, G., et al.: Parallel Execution of Prolog Programs. TOPLAS\u00a023(4) (2001)","DOI":"10.1145\/504083.504085"},{"key":"25_CR9","volume-title":"ICLP","author":"E. Pontelli","year":"1997","unstructured":"Pontelli, E., et al.: Implementation Mechanisms for DAP. In: ICLP. MIT Press, Cambridge (1997)"},{"key":"25_CR10","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":"25_CR11","first-page":"123","volume-title":"FSTTCS","author":"E. Pontelli","year":"1997","unstructured":"Pontelli, E., Ranjan, D., Gupta, G.: On the Complexity of Parallel Implementation of Logic Programs. In: FSTTCS, pp. 123\u2013137. Springer, Heidelberg (1997)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Ranjan, D., et al.: The Temporal Precedence Problem. Algorithmica\u00a028 (2000)","DOI":"10.1007\/s004530010036"},{"key":"25_CR13","volume-title":"JICSLP","author":"K. Shen","year":"1992","unstructured":"Shen, K.: Exploiting Dependent And-parallelism in Prolog. In: JICSLP. MIT, Cambridge (1992)"},{"issue":"18","key":"25_CR14","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":"25_CR15","volume-title":"PARLE","author":"H. Tebra","year":"1987","unstructured":"Tebra, H.: Optimistic And-Parallelism in Prolog. In: PARLE. Springer, Heidelberg (1987)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00289142","volume":"21","author":"A. Tsakalidis","year":"1984","unstructured":"Tsakalidis, A.: Maintaining Order in a Generalized Linked List. ACTA Informatica\u00a021, 101\u2013112 (1984)","journal-title":"ACTA Informatica"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P., et al.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory\u00a010 (1977)","DOI":"10.1007\/BF01683268"},{"key":"25_CR18","volume-title":"Euro-Par","author":"K. Villaverde","year":"2003","unstructured":"Villaverde, K., et al.: A Methodology for Order-sensitive Execution of Nondeterministic Languages on Beowulf Platforms. In: Euro-Par. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:54:59Z","timestamp":1559346899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}