A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
The abstract data type one-sided flexible array, also called randomaccess list, supports look-up and update of elements and can grow and shrink at one end. We describe a purely functional implementation based on weight-balanced multiway trees that is both simple and versatile. A novel feature of the representation is that the running time of the operations can be tailored to one's needs-even dynamically at array-creation time. In particular, one can trade the running time of look-up operationsdoi:10.1145/583852.581480 fatcat:wtuhjb7aqfgenhagcnfywrxmde