{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:24Z","timestamp":1725455784037},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023850","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:17:40Z","timestamp":1132363060000},"page":"488-497","source":"Crossref","is-referenced-by-count":1,"title":["Data structures and terminating Petri nets"],"prefix":"10.1007","author":[{"given":"Daniel D.","family":"Sleator","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974."},{"key":"39_CR2","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V., Linear Programming, W. H. Freeman, New York. 1983."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Driscoll, J. R., N. Sarnak, D. D. Sleator, and R. E. Tarjan, \u201cMaking data structures persistent,\u201d Proceedings of the Eighteenth Annual Symp. on the Theory of Computing 1986, 109\u2013121","DOI":"10.1145\/12130.12142"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Driscoll, J. R., N. Sarnak, D. D. Sleator, and R. E. Tarjan, \u201cMaking data structures persistent,\u201d Journal of Computer and System Sciences., Vol. 38, No. 1, February 1989.","DOI":"10.1016\/0022-0000(89)90034-2"},{"issue":"3","key":"39_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., R. E. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms,\u201d Journal of the ACM, 34(3), 1987, 209\u2013221.","journal-title":"Journal of the ACM"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"Karlin, A. R., M. S. Manasse, L. Rudolph, D. D. Sleator, \u201cCompetitive snoopy caching,\u201d Algorithmica, (1988)3, 79\u2013119.","journal-title":"Algorithmica"},{"issue":"2","key":"39_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1137\/0205020","volume":"5","author":"Y. E. Lien","year":"1976","unstructured":"Lien, Y. E., \u201cTermination properties of generalized petri nets,\u201d SIAM J. Computing, 5(2), June 1976, 251\u2013265.","journal-title":"SIAM J. Computing"},{"key":"39_CR8","volume-title":"Dept. of Comp. Sci. Rep. 62","author":"R. Lipton","year":"1976","unstructured":"Lipton, R., \u201cThe reachability problem is exponential-space-hard,\u201d Dept. of Comp. Sci. Rep. 62, Yale Univ., New Haven, CT, 1976."},{"issue":"3","key":"39_CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. W. Mayr","year":"1984","unstructured":"Mayr, E. W., \u201cAn algorithm for the general Petri net reachability problem,\u201d SIAM J. Computing, 13(3), August 1984, 441\u2013460.","journal-title":"SIAM J. Computing"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Memmi, G., G. Roucairol, \u201cLinear algebra in net theory,\u201d Lecture Notes in Computer Science No. 88, Springer-Verlag, 1980, 213\u2013223.","DOI":"10.1007\/3-540-10001-6_24"},{"key":"39_CR11","volume-title":"Beauty is Our Business, A Birthday Salute to Edsger W. Dijkstra","author":"C. G. Nelson","year":"1990","unstructured":"Nelson, C. G., \u201cSystematic snoopy caching,\u201d In Beauty is Our Business, A Birthday Salute to Edsger W. Dijkstra (eds. W. Feijen, N. van Gasteren, D. Gries, J. Misra), Springer-Verlag, New York, 1990."},{"key":"39_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N. and R. E. Tarjan, \u201cPlanar point location using persistent search search trees,\u201d Comm. ACM, 29(1986), 669\u2013679.","journal-title":"Comm. ACM"},{"issue":"3","key":"39_CR13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D. and R. E. Tarjan, \u201cSelf-adjusting binary search trees,\u201d Journal of the ACM, 32(3), 1985, 652\u2013686.","journal-title":"Journal of the ACM"},{"issue":"2","key":"39_CR14","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D. and R. E. Tarjan, \u201cAmortized efficiency of list update and paging rules,\u201d Comm. ACM, 28(2), February 1985, 202\u2013208.","journal-title":"Comm. ACM"},{"key":"39_CR15","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan, R. E., \u201cAmortized computational complexity,\u201d SIAM J. Algebraic and Discrete Methods, 6(1985), 306\u2013318.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Tarjan, R. E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T22:17:38Z","timestamp":1572905858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552847"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0023850","relation":{},"subject":[]}}