{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:56Z","timestamp":1725663776414},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_274","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:06:19Z","timestamp":1330239979000},"page":"494-505","source":"Crossref","is-referenced-by-count":3,"title":["The exhaustion of shared memory: Stochastic results"],"prefix":"10.1007","author":[{"given":"Robert S.","family":"Maier","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Schott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0255(77)90037-8","volume":"12","author":"C. A. Ellis","year":"1977","unstructured":"C. A. Ellis. Probabilistic models of computer deadlock. Inform. Sci.\n12 (1977), 43\u201360.","journal-title":"Inform. Sci."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"P. Flajolet. The evolution of two stacks in bounded space and random walks in a triangle. In Proc. MFCS '86, LNCS #233, pp. 325\u2013340. Springer-Verlag, 1986.","DOI":"10.1007\/BFb0016257"},{"key":"46_CR3","unstructured":"A. N. Habermann. System Deadlocks. In Current Trends in Programming Methodology, edited by K. M. Chandy and R. T. Yeh, volume 3. Prentice-Hall, 1978."},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0220050","volume":"20","author":"C. M. Kenyon-Mathieu","year":"1991","unstructured":"C. M. Kenyon-Mathieu and J. S. Vitter. The maximum size of dynamic data structures. SIAM J. Computing\n20 (1991), 807\u2013823.","journal-title":"SIAM J. Computing"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1137\/0145062","volume":"46","author":"C. Knessl","year":"1985","unstructured":"C. Knessl, B. J. Matkowsky, Z. Schuss, and C. Tier. An asymptotic theory of large deviations for Markov jump processes. SIAM J. Appl. Math.\n46 (1985), 1006\u20131028.","journal-title":"SIAM J. Appl. Math."},{"key":"46_CR6","unstructured":"D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1981."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"G. Louchard, C. Kenyon, and R. Schott. Data structures maxima. In Proc. FCT '91, LNCS #529, pp. 339\u2013349. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54458-5_78"},{"key":"46_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/rsa.3240020203","volume":"2","author":"G. Louchard","year":"1991","unstructured":"G. Louchard and R. Schott. Probabilistic analysis of some distributed algorithms. Random Structures and Algorithms\n2 (1991), 151\u2013186.","journal-title":"Random Structures and Algorithms"},{"key":"46_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/rsa.3240020404","volume":"2","author":"R. S. Maier","year":"1991","unstructured":"R. S. Maier. Colliding stacks: a large deviations analysis. Random Structures and Algorithms\n2 (1991), 379\u2013420.","journal-title":"Random Structures and Algorithms"},{"key":"46_CR10","volume-title":"Nonnegative Matrices","author":"H. Minc","year":"1988","unstructured":"H. Minc. Nonnegative Matrices. Wiley, New York, 1988."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/0150036","volume":"50","author":"T. Naeh","year":"1990","unstructured":"T. Naeh, M. M. Klosek, B. J. Matkowsky, and Z. Schuss. A direct approach to the exit problem. SIAM J. Appl. Math.\n50 (1990), 595\u2013627.","journal-title":"SIAM J. Appl. Math."},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1145\/321607.321617","volume":"17","author":"P. W. Purdom Jr.","year":"1970","unstructured":"P. W. Purdom, Jr. and S. M. Stigler. Statistical properties of the buddy system. J. ACM\n17 (1970), 683\u2013697.","journal-title":"J. ACM"},{"key":"46_CR13","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0210029","volume":"10","author":"A. C. Yao","year":"1981","unstructured":"A. C. Yao. An analysis of a memory allocation scheme for implementing stacks. SIAM J. Computing\n10 (1981), 398\u2013403.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_274.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:58:43Z","timestamp":1619557123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_274","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}