{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:58Z","timestamp":1725536818555},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_3","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"24-33","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Process Creation"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65371-1","volume-title":"Branching Processes","author":"K.B. Athreya","year":"1972","unstructured":"Athreya, K.B., Ney, P.E.: Branching Processes. Springer, Heidelberg (1972)"},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"R.D. Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. Journal of the ACM\u00a046(5), 720\u2013748 (1999)","journal-title":"Journal of the ACM"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S., Luttenberger, M.: Space-efficient scheduling of stochastically generated tasks. Technical report, Technische Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik (April 2009)","DOI":"10.1007\/978-3-642-14162-1_45"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1017\/S0021900200026711","volume":"6","author":"M. Dwass","year":"1969","unstructured":"Dwass, M.: The total progeny in a branching process and a related random walk. Journal of Applied Probability\u00a06, 682\u2013686 (1969)","journal-title":"Journal of Applied Probability"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Convergence thresholds of Newton\u2019s method for monotone polynomial equations. In: STACS 2008, pp. 289\u2013300 (2008)","DOI":"10.1145\/1250790.1250822"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K. Etessami","year":"2009","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM\u00a056(1), 1\u201366 (2009)","journal-title":"Journal of the ACM"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"3_CR8","volume-title":"Urn Models and Their Application","author":"N.L. Johnson","year":"1977","unstructured":"Johnson, N.L., Kotz, S.: Urn Models and Their Application. John Wiley & Sons, Chichester (1977)"},{"key":"3_CR9","first-page":"217","volume-title":"STOC 2007","author":"S. Kiefer","year":"2007","unstructured":"Kiefer, S., Luttenberger, M., Esparza, J.: On the convergence of Newton\u2019s method for monotone systems of polynomial equations. In: STOC 2007, pp. 217\u2013226. ACM, New York (2007)"},{"key":"3_CR10","first-page":"209","volume":"3","author":"T. Lindvall","year":"1976","unstructured":"Lindvall, T.: On the maximum of a branching process. Scandinavian Journal of Statistics\u00a03, 209\u2013214 (1976)","journal-title":"Scandinavian Journal of Statistics"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781420059847","volume-title":"P\u00f3lya Urn Models","author":"H. Mahmoud","year":"2008","unstructured":"Mahmoud, H.: P\u00f3lya Urn Models. CRC Press, Boca Raton (2008)"},{"issue":"3","key":"3_CR12","first-page":"131","volume":"4","author":"O. Nerman","year":"1977","unstructured":"Nerman, O.: On the maximal generation size of a non-critical galton-watson process. Scandinavian Journal of Statistics\u00a04(3), 131\u2013135 (1977)","journal-title":"Scandinavian Journal of Statistics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T07:23:25Z","timestamp":1685085805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}