{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:29:40Z","timestamp":1743049780625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240237"},{"type":"electronic","value":"9783319240244"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_23","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:00:10Z","timestamp":1441353610000},"page":"396-407","source":"Crossref","is-referenced-by-count":0,"title":["Simple Parallel Algorithms for Dynamic Range Products"],"prefix":"10.1007","author":[{"given":"Christos","family":"Zaroliagis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"23_CR1","unstructured":"Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries, Technical Report No. 71\/87, Tel-Aviv University (1987)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-59071-4_49","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaudhuri","year":"1995","unstructured":"Chaudhuri, S., Hagerup, T.: Prefix graphs and their applications. In: Mayr, Ernst W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 206\u2013218. Springer, Heidelberg (1995)"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/s004530010016","volume":"27","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part I: sequential algorithms. Algorithmica 27(3), 212\u2013226 (2000)","journal-title":"Algorithmica"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(98)00021-8","volume":"203","author":"S Chaudhuri","year":"1998","unstructured":"Chaudhuri, S., Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part II: optimal parallel algorithms. Theor. Comput. Sci. 203(2), 205\u2013223 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B Chazelle","year":"1987","unstructured":"Chazelle, B.: Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337\u2013361 (1987)","journal-title":"Algorithmica"},{"key":"23_CR6","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"23_CR7","volume-title":"An Introduction to Database Systems, Vol. I","author":"CJ Date","year":"1991","unstructured":"Date, C.J.: An Introduction to Database Systems, Vol. I, 5th edn. Addison-Wesley, Reading (1991)","edition":"5"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1999.2814","volume":"158","author":"T Hagerup","year":"2000","unstructured":"Hagerup, T.: Parallel preprocessing for path queries without concurrent reading. Inf. Comput. 158, 18\u201328 (2000)","journal-title":"Inf. Comput."},{"key":"23_CR9","volume-title":"An Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"issue":"6","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"23_CR11","volume-title":"Principles of Database and Knowledge-base Systems, Vol. II","author":"JD Ullman","year":"1989","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-base Systems, Vol. II. Computer Science Press, Rockville (1989)"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T17:47:13Z","timestamp":1559238433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}