{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:26:58Z","timestamp":1725571618852},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_10","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"104-113","source":"Crossref","is-referenced-by-count":6,"title":["An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations"],"prefix":"10.1007","author":[{"given":"Bielecki","family":"Wlodzimierz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klimek","family":"Tomasz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palkowski","family":"Marek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Beletska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive clousure of infinite graphs and its applications, Languages and Compilers for Parallel Computing (1995)","key":"10_CR1","DOI":"10.1007\/BFb0014196"},{"unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega library interface guide, Technical Report CS-TR-3445, Dept. of Computer Science, University of Maryland, College Park (March 1995)","key":"10_CR2"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration Space Slicing and its Application to Communication Optimization. In: Proceedings of International Conference on Supercomputing (1997)","key":"10_CR3","DOI":"10.1145\/263580.263637"},{"unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infnite State Spaces. PhD thesis, Universite de Li\u03bcege (1998)","key":"10_CR4"},{"unstructured":"Nuutila, E.: Efficient Transitive Closure Computation in Large Digraphs, Mathematics and Computing in Engineering Series No. 74 PhD thesis Helsinki University of Technology. Helsinki (1995)","key":"10_CR5"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.endm.2009.03.002","volume":"33","author":"W. Bielecki","year":"2009","unstructured":"Bielecki, W., Klimek, T., Trifunovi, K.: Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation. Electronic Notes in Discrete Mathematics\u00a033, 7\u201314 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"unstructured":"Bielecki, W., Klimek, T., Pietrasik, M.: An experimental study on recognizing classes of dependence relations. Measurement Automation and Monitoring\u00a055(10) (2009)","key":"10_CR7"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-02026-1_9","volume-title":"COCOA 2009","author":"A. Beletska","year":"2009","unstructured":"Beletska, A., Barthou, D., Bielecki, W., Cohen, A.: Computing the Transitive Closure of a Union of Affine Integer Tuple Relations. In: COCOA 2009. LNCS, vol.\u00a05573, pp. 98\u2013109. Springer, Heidelberg (2009)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-69848-7_69","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"A. Beletska","year":"2008","unstructured":"Beletska, A., Bielecki, W., Siedlecki, K., San Pietro, P.: Finding synchronization-free slices of operations in arbitrarily nested loops. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part II. LNCS, vol.\u00a05073, pp. 871\u2013886. Springer, Heidelberg (2008)"},{"unstructured":"Bielecki, W., Beletska, A., Palkowski, M., San Pietro, P.: Extracting synchronization-free chains of dependent iterations in non-uniform loops. In: ACS 2007: Proceedings of International Conference on Advanced Computer Systems (2007)","key":"10_CR10"},{"doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. In: ACM-SIGMOD 1986 Conference on Management of Data, pp. 16\u201352 (1986)","key":"10_CR11","DOI":"10.1145\/16856.16859"},{"unstructured":"Ioannidis, Y.E.: On the computation of the transitive closure of relational operators. In: Proceedings of the 12th International VLDB Conference, pp. 403\u2013411 (1986)","key":"10_CR12"},{"unstructured":"NAS benchmarks suite, http:\/\/www.nas.nasa.gov","key":"10_CR13"},{"unstructured":"The Omega project, http:\/\/www.cs.umd.edu\/projects\/omega","key":"10_CR14"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T02:57:20Z","timestamp":1559876240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}