{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:52:31Z","timestamp":1773330751605,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319388502","type":"print"},{"value":"9783319388519","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_12","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T15:33:54Z","timestamp":1464708834000},"page":"167-183","source":"Crossref","is-referenced-by-count":5,"title":["Worst-Case-Efficient Dynamic Arrays in Practice"],"prefix":"10.1007","author":[{"given":"Jyrki","family":"Katajainen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"12_CR1","unstructured":"Austern, M.: Defining iterators and const iterators. C\/C++ User\u2019s J. 19(1), 74\u201379 (2001)"},{"key":"12_CR2","volume-title":"Programming Pearls","author":"J Bentley","year":"2000","unstructured":"Bentley, J.: Programming Pearls, 2nd edn. Addison Wesley Longman Inc., Reading (2000)","edition":"2"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-48447-7_4","volume-title":"Algorithms and Data Structures","author":"A Brodnik","year":"1999","unstructured":"Brodnik, A., Carlsson, S., Demaine, E.D., Munro, J.I., Sedgewick, R.D.: Resizable arrays in optimal time and space. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 37\u201348. Springer, Heidelberg (1999)"},{"key":"12_CR4","unstructured":"The C++ Standards Committee: Standard for Programming Language C++. Working Draft N4296, ISO\/IEC (2014)"},{"key":"12_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"12_CR6","unstructured":"The CPH STL: Department of Computer Science, University of Copenhagen (2000\u20132016). http:\/\/cphstl.dk\/"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-48447-7_21","volume-title":"Algorithms and Data Structures","author":"MT Goodrich","year":"1999","unstructured":"Goodrich, M.T., Kloss II, J.G.: Tiered vectors: efficient dynamic arrays for rank-based sequences. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 205\u2013216. Springer, Heidelberg (1999)"},{"key":"12_CR8","unstructured":"Katajainen, J., Maniotis, A.M.: Conceptual frameworks for constructing iterators for compound data structures\u2013electronic appendix I: component-iterator and rank-iterator classes. CPH STL Report 2012\u20133, Department of Computer Science, University of Copenhagen, Copenhagen (2012)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-44688-5_4","volume-title":"Algorithm Engineering","author":"J Katajainen","year":"2001","unstructured":"Katajainen, J., Mortensen, B.B.: Experiences with the design and implementation of space-efficient deques. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 39\u201350. Springer, Heidelberg (2001)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Katajainen, J., Mortensen, B.B.: Experiences with the design and implementation of space-efficient deques. CPH STL Report 2001\u20137, Department of Computer Science, University of Copenhagen, Copenhagen (2001)","DOI":"10.1007\/3-540-44688-5_4"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Katajainen, J., Simonsen, B.: Adaptable component frameworks: using vector from the C++ standard library as an example. In: Jansson, P., Schupp, S. (eds.) 2009 ACM SIGPLAN Workshop on Generic Programming, pp. 13\u201324. ACM, New York (2009)","DOI":"10.1145\/1596614.1596618"},{"key":"12_CR12","unstructured":"Katajainen, J., Simonsen, B.: Vector framework: electronic appendix. CPH STL Report 2009\u20134, Department of Computer Science, University of Copenhagen, Copenhagen (2009)"},{"key":"12_CR13","volume-title":"The C Programming Language","author":"BW Kernighan","year":"1988","unstructured":"Kernighan, B.W., Ritchie, D.M.: The C Programming Language, 2nd edn. Prentice Hall PTR, Englewood Cliffs (1988)","edition":"2"},{"key":"12_CR14","unstructured":"Kristensen, M.D.: Vector implementation for the CPH STL. CPH STL Report 2004\u20132, Department of Computer Science, University of Copenhagen, Copenhagen (2004)"},{"key":"12_CR15","unstructured":"Mortensen, B.B.: The deque class in the Copenhagen STL: first attempt. CPH STL Report 2001\u20134, Department of Computer Science, University of Copenhagen, Copenhagen (2001)"},{"issue":"8","key":"12_CR16","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","volume":"27","author":"DR Musser","year":"1997","unstructured":"Musser, D.R.: Introspective sorting and selection algorithms. Software Pract. Exper. 27(8), 983\u2013993 (1997)","journal-title":"Software Pract. Exper."},{"key":"12_CR17","unstructured":"Neidhardt, M., Simonsen, B.: Extending the CPH STL with LEDA APIs. CPH STL Report 2009\u20138, Department of Computer Science, University of Copenhagen, Copenhagen (2009)"},{"key":"12_CR18","volume-title":"The C++ Standard Template Library","author":"PJ Plauger","year":"2001","unstructured":"Plauger, P.J., Stepanov, A.A., Lee, M., Musser, D.R.: The C++ Standard Template Library. Prentice Hall PTR, Upper Saddle River (2001)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-44634-6_39","volume-title":"Algorithms and Data Structures","author":"R Raman","year":"2001","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 426\u2013437. Springer, Heidelberg (2001)"},{"key":"12_CR20","unstructured":"Sitarski, E.: Algorithm alley: HATs: hashed array trees: fast variable-length arrays. Dr. Dobb\u2019s J. 21(11) (1996). http:\/\/www.drdobbs.com\/database\/algorithm-alley\/184409965"},{"key":"12_CR21","volume-title":"From Mathematics to Generic Programming","author":"AA Stepanov","year":"2015","unstructured":"Stepanov, A.A., Rose, D.E.: From Mathematics to Generic Programming. Pearson Education Inc., Upper Saddle River (2015)"},{"key":"12_CR22","volume-title":"The C++ Programming Language","author":"B Stroustrup","year":"2013","unstructured":"Stroustrup, B.: The C++ Programming Language, 4th edn. Pearson Education Inc., Upper Saddle River (2013)","edition":"4"},{"key":"12_CR23","volume-title":"C++ Templates: The Complete Guide","author":"D Vandervoorde","year":"2003","unstructured":"Vandervoorde, D., Josuttis, N.M.: C++ Templates: The Complete Guide. Pearson Education Inc., Boston (2003)"},{"issue":"6","key":"12_CR24","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: heapsort. Commun. ACM 7(6), 347\u2013348 (1964)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T10:42:58Z","timestamp":1600684978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}