{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:00Z","timestamp":1725664200113},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576594"},{"type":"electronic","value":"9783540483083"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57659-2_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:13:59Z","timestamp":1330262039000},"page":"21-36","source":"Crossref","is-referenced-by-count":3,"title":["Arbitrary order operations on trees"],"prefix":"10.1007","author":[{"given":"Jon A.","family":"Solworth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bryan B.","family":"Reagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"8","key":"2_CR1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1986.1663305","volume":"19","author":"S. Ahuja","year":"1986","unstructured":"S. Ahuja, N. Carriero, and David Gelertner. Linda and friends. Computer, 19(8):26\u201334, August, 1986.","journal-title":"Computer"},{"key":"2_CR2","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, Mass., 1975."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"David R. Chase, Mark Wegman, and F. K. Zadek. Analysis of pointers and structures. In Programming Language Design and Implementation, pages 296\u2013310. ACM, June 1990.","DOI":"10.1145\/93542.93585"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/69624.357206","volume":"5","author":"A. Gottlieb","year":"1983","unstructured":"Allan Gottlieb, B. D. Lubachevsky, and Larry Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processes. ACM Transactions of Programming Languages, 5(2):164\u2013189, April, 1983.","journal-title":"ACM Transactions of Programming Languages"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"R. H. Halstead","year":"1985","unstructured":"Robert H. Halstead. Multilisp: a language for concurrent symbolic computation. TOPLAS, 7(4):501\u2013538, October 1985.","journal-title":"TOPLAS"},{"key":"2_CR6","unstructured":"W. Ludwell Harrison. Generalized iteration space and the parallelization of symbolic languages. In Ian Foster and Evan Tick, editors, Workshop on Computation of Symbolic Languages for Parallel Computers. Argonne National Labs, October 1992."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Laurie J. Hendren, Joseph Hummel, and Alexandru Nicolau. Abstraction for recursive pointer data structures: Improving the analysis and transformation of imperative languages. In Programming Language Design and Implementation, pages 249\u2013260. ACM, June 1992.","DOI":"10.1145\/143095.143138"},{"key":"2_CR8","unstructured":"Morris J. Katz. Paratran: A transparent, transaction based runtime mechanism for the parallel execution of scheme. Master's thesis, MIT, June 1986. Masters Thesis."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN'88 Conference on Programming Language Design and Implementation, June 1988.","DOI":"10.1145\/53990.53993"},{"issue":"4","key":"2_CR10","first-page":"471","volume":"C-36","author":"T. J. LeBlanc","year":"1987","unstructured":"Thomas J. LeBlanc and John M. Mellor-Crummey. Debugging parallel programs with instant replay. TOC, C-36(4):471\u2013482, April 1987.","journal-title":"TOC"},{"key":"2_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with sets: an introduction to SETL","author":"J. T. Schwartz","year":"1986","unstructured":"Jacob T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets: an introduction to SETL. Springer-Verlag, New York, New York, 1986. setl book."},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/12.88484","volume":"40","author":"J. H. Saltz","year":"1991","unstructured":"Joel H. Saltz, Ravi Mirchandaney, and Kay Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. on Computer, 40(5):603\u2013612, May 1991.","journal-title":"IEEE Trans. on Computer"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF00129783","volume":"2","author":"J. A. Solworth","year":"1988","unstructured":"Jon A. Solworth. Programming language constructs for highly parallel operations on lists. The Journal of Supercomputing, 2:331\u2013347, 1988.","journal-title":"The Journal of Supercomputing"},{"key":"2_CR14","unstructured":"Jon A. Solworth. The PARSEQ project: An interim report. In Languages and Compilers for Parallel Computing, pages 490\u2013510. Pittman\/MIT, 1990."},{"key":"2_CR15","unstructured":"Jon A. Solworth. On the performance of parallel lists. In Advances in Languages and Compilers for Parallel Computing, pages 152\u2013171. Pittman\/MIT, 1991."},{"key":"2_CR16","unstructured":"Jon A. Solworth. Arbitrary order iterations over pointer-based data structures. In 5th Workshop on Programming Languages and Compilers, August 1992. to appear."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. JACM, pages 652\u2013686, July 1985.","DOI":"10.1145\/3828.3835"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Michael Wolfe. Doany: Not just another parallel loop. In 5th Workshop on Programming Languages and Compilers, August 1992. to appear.","DOI":"10.1007\/3-540-57502-2_62"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57659-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:34Z","timestamp":1605647614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57659-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540576594","9783540483083"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57659-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}