{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:38Z","timestamp":1725664298940},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:33Z","timestamp":1330278213000},"page":"232-241","source":"Crossref","is-referenced-by-count":1,"title":["A simple, efficient, and flexible implementation of flexible arrays"],"prefix":"10.1007","author":[{"given":"Victor J.","family":"Dielissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Kaldewaij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"unstructured":"Braun W. and Rem M., A logarithmic implementation of flexible arrays, Memorandum MR83\/4, University of Technology Eindhoven, 1983.","key":"13_CR1"},{"issue":"no.5","key":"13_CR2","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1093\/comjnl\/34.5.386","volume":"34","author":"D.J. Challab","year":"1991","unstructured":"Challab D.J., Implementation of flexible arrays using balanced trees, The Computer Journal, vol. 34, no. 5. 1991, pp 386\u2013396.","journal-title":"The Computer Journal"},{"key":"13_CR3","volume-title":"A discipline of programming","author":"E. W. Dijkstra","year":"1976","unstructured":"Dijkstra, E. W., A discipline of programming, Prentice Hall, Englewood Cliffs, 1976."},{"key":"13_CR4","first-page":"191","volume-title":"LCNS 669","author":"R.R. Hoogerwoord","year":"1993","unstructured":"Hoogerwoord, R.R., A logarithmic implementation of flexible arrays in Mathematics of Program Construction: second international conference, Oxford U.K., June 29\u2013July 3, 1992: proceedings\/R.S. Bird, C.C. Morgan, J.C.P. Woodcock, eds, LCNS 669, Springer-Verlag, Berlin Heidelberg 1993, pp 191\u2013207."},{"unstructured":"Kaldewaij A., Programming, The derivation of algorithms, Prentice Hall International Series in Computer Science, 1990, pp 67\u201369","key":"13_CR5"},{"key":"13_CR6","first-page":"3","volume-title":"Decomposable functions and leaf trees: a systematic approach","author":"A. Kaldewaij","year":"1994","unstructured":"Kaldewaij A. and Dielissen V.J., Decomposable functions and leaf trees: a systematic approach, in Programming, concepts, methods and calculi: proceedings of the IFIP TC2\/WG2.1\/WG2.2\/WG2.3 Working Conference on Programming Concepts, Methods and calculi (PROCOMET'94), San Miniato, Italy, 6\u201310 June 1994 \/ edited by Ernst-R\u00fcdiger Olderog, Elsevier, Amsterdam, 1994, pp 3\u201317."},{"key":"13_CR7","volume-title":"The art of computer programming 3: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E., The art of computer programming 3: Sorting and searching, Addison-Wesley, Reading, Mass. (1973)."},{"unstructured":"Lewis H.R. and Denenberg L., Data structures and their algorithms, Harper Collins Publishers, 1991.","key":"13_CR8"},{"key":"13_CR9","volume-title":"Algol Bulletin 28","author":"C.H. Lindsey","year":"1968","unstructured":"Lindsey, C.H., ALGOL-68 with fewer tears, Algol Bulletin 28 (1968), Science Reference Library, London UK."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","volume":"2","author":"M.H. Overmars","year":"1981","unstructured":"Overmars M.H., Dynamization of order decomposable set problems, J. Algorithms 2 (1981), pp 245\u2013260.","journal-title":"J. Algorithms"},{"key":"13_CR11","first-page":"561","volume-title":"Programming concepts and methods","author":"P. Wadler","year":"1990","unstructured":"Wadler P., Linear types can change the world! in M. Broy, C.B. Jones (eds.), Programming concepts and methods, North-Holland, Amsterdam (1990), pp 561\u2013581."},{"unstructured":"Wood D., Data structures, algorithms, and performance, Addison-Wesley (1993).","key":"13_CR12"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:52Z","timestamp":1619573512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}