{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:29:36Z","timestamp":1758270576002},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf02835833","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T02:28:20Z","timestamp":1202956100000},"page":"141-159","source":"Crossref","is-referenced-by-count":6,"title":["On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?"],"prefix":"10.1007","volume":"25","author":[{"given":"Sandy","family":"Irani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02835833_CR1","doi-asserted-by":"crossref","unstructured":"[ACS] Aggarwal, A., Chandra, A., Snir, M., Hierarchical Memory with Block Transfer,Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987, pp. 204\u2013216.","DOI":"10.1109\/SFCS.1987.31"},{"issue":"No. 4","key":"BF02835833_CR2","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/69558.69562","volume":"11","author":"Arvind","year":"1989","unstructured":"[ANP] Arvind, Nikhil, R. S., Pingali, K. K., I-structures: Data Structures for Parallel Computing,ACM Transactions on Programming Languages and Systems, Vol. 11, No. 4, October 1989, pp. 598\u2013632.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"No. 2","key":"BF02835833_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A. Borodin","year":"1982","unstructured":"[BC] Borodin, A., Cook, S., A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation,SIAM Journal on Computing, Vol. 11, No. 2, May 1982, pp. 287\u2013297.","journal-title":"SIAM Journal on Computing"},{"key":"BF02835833_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"[B] Brent, R. P., The Parallel Evaluation of General Arithmetic Expressions,Journal of the Association for Computing Machinery, Vol. 21, 1974, pp. 201\u2013208.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02835833_CR5","doi-asserted-by":"crossref","unstructured":"[DMMU] Dolev, D., Maier, D., Mairson, H., Ullman, J., Correcting Faults in a Write-Once Memory,Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, DC, May 1984, pp. 225\u2013229.","DOI":"10.1145\/800057.808685"},{"key":"BF02835833_CR6","doi-asserted-by":"crossref","unstructured":"[DSST] Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R., Making Data Structures Persistent,Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, May 1986, pp. 109\u2013121.","DOI":"10.1145\/12130.12142"},{"key":"BF02835833_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas v.","year":"1977","unstructured":"[EKZ] Emde Boas, P. v., Kass, R., Zijlstra, E., Design and Implementation of an Efficient Priority Queue,Mathematical Systems Theory, Vol. 10, 1977, pp. 99\u2013127.","journal-title":"Mathematical Systems Theory"},{"issue":"No. 3","key":"BF02835833_CR8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R. Lipton","year":"1980","unstructured":"[LT] Lipton, R., Tarjan, R., Applications of a Planar Separator Theorem,SIAM Journal on Computing, Vol. 9, No. 3, August 1980, pp. 615\u2013626.","journal-title":"SIAM Journal on Computing"},{"key":"BF02835833_CR9","doi-asserted-by":"crossref","unstructured":"[M] Mehlhorn, K., Pebbling Mountain Ranges and Its Application to DCFL-Recognition, 1979.","DOI":"10.1007\/3-540-10003-2_89"},{"key":"BF02835833_CR10","unstructured":"[PH] Paterson, M. S., Hewitt, C. E., Comparative Schematology,Proceedings of the MAC Conference on Concurrent Systems and Parallel Computation, 1970, pp. 119\u2013127."},{"key":"BF02835833_CR11","unstructured":"[P] Pippenger, N., Pebbling,Proceedings of the 5th IBM Symposium on Mathematical Foundations of Computer Science: Computational Complexity, May 19, 1980."},{"key":"BF02835833_CR12","doi-asserted-by":"crossref","unstructured":"[PMN] Ponder, C., McGerr, P., Ng, A., Are Applicative Languages Inefficient?SIGPLAN Notices, Vol. 23, No. 6.","DOI":"10.1145\/44546.44559"},{"issue":"1\u20133","key":"BF02835833_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)90344-8","volume":"55","author":"R. L. Rivest","year":"1982","unstructured":"[RS] Rivest, R. L., Shamir, A., How To Reuse a \u201cWrite-Once\u201d Memory,Information and Control, Vol. 55, Nos. 1\u20133, 1982, pp. 1\u201319.","journal-title":"Information and Control"},{"issue":"No. 7","key":"BF02835833_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"[ST] Sarnak, N., Tarjan, R. E., Planar Point Location Using Persistent Search Trees,Communications of the ACM, July 1986, Vol. 29, No. 7, pp. 669\u2013679.","journal-title":"Communications of the ACM"},{"key":"BF02835833_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"[Ta] Tarjan, R. E.,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983."},{"key":"BF02835833_CR16","unstructured":"[To] Touati, H., Personal communication."},{"key":"BF02835833_CR17","doi-asserted-by":"crossref","unstructured":"[Va] Valiant, L. G., Graph-Theoretic Arguments in Low-Level Complexity,Theoretical Computer Science, 1977.","DOI":"10.1007\/3-540-08353-7_135"},{"key":"BF02835833_CR18","doi-asserted-by":"crossref","unstructured":"[Vi1] Vitter, J. S., Computational Complexity of an Optical Disk Interface,Proceedings of the 11th Annual International Colloquium on Automata, Languages, and Programming (ICALP), Antwerp, July 1984, pp. 490\u2013502.","DOI":"10.1007\/3-540-13345-3_46"},{"issue":"No. 2","key":"BF02835833_CR19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/3857.3862","volume":"10","author":"J. S. Vitter","year":"1985","unstructured":"[Vi2] Vitter, J. S., An Efficient I\/O Interface for Optical Disks,ACM Transactions on Database Systems, Vol. 10, No. 2, June 1985, pp. 129\u2013162.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835833.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02835833\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T05:12:08Z","timestamp":1558242728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02835833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF02835833"],"URL":"https:\/\/doi.org\/10.1007\/bf02835833","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}