{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:47:15Z","timestamp":1648543635847},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00224-015-9613-9","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T03:16:48Z","timestamp":1425007008000},"page":"223-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bounds on Number of Steals in Rooted Trees"],"prefix":"10.1007","volume":"58","author":[{"given":"Charles E.","family":"Leiserson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"key":"9613_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, K., He, Y., Leiserson, C.E.: An empirical evaluation of work stealing with parallelism feedback. In 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006) (2006)","DOI":"10.1109\/ICDCS.2006.14"},{"key":"9613_CR2","doi-asserted-by":"crossref","unstructured":"Arora, N.S., Blumofe, R.D., Greg Plaxton, C.: Thread scheduling for multiprogrammed multiprocessors. In: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 119\u2013129 (1998)","DOI":"10.1145\/277651.277678"},{"issue":"5","key":"9613_CR3","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"9613_CR4","doi-asserted-by":"crossref","unstructured":"Warren Burton, F., Ronan Sleep, M.: Executing functional programs on a virtual tree of processors. In: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, 187\u2013194 (1981)","DOI":"10.1145\/800223.806778"},{"key":"9613_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3rd edition. The MIT Press (2009)"},{"key":"9613_CR6","doi-asserted-by":"crossref","unstructured":"Dinan, J., Larkins, D.B., Sadayappan, P., Krishnamoorthy, S., Nieplocha, J.: Scalable work stealing. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC) (2009)","DOI":"10.1145\/1654059.1654113"},{"key":"9613_CR7","doi-asserted-by":"crossref","unstructured":"Halstead Jr., R.H.: Implementation of Multilisp: Lisp on a multiprocessor. In: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, p. 9\u201317 (1984)","DOI":"10.1145\/800055.802017"},{"issue":"3","key":"9613_CR8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"RM Karp","year":"1993","unstructured":"Karp, R.M., Zhang, Y.: Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. ACM 40(3), 765\u2013789 (1993)","journal-title":"J. ACM"},{"key":"9613_CR9","unstructured":"Suksompong, W.: Bounds on multithreaded computations by work stealing. Master\u2019s Thesis, Massachusetts Institute of Technology (2014)"},{"key":"9613_CR10","doi-asserted-by":"crossref","unstructured":"Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks 1(2), 1972","DOI":"10.1002\/net.3230010206"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9613-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9613-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9613-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T09:41:06Z","timestamp":1566380466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9613-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9613"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9613-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,28]]}}}