array maintenance average complexity data structures models of computation
Institute of Information Theories and Applications FOI ITHEA
In this paper a constructive method of data structures solving an array maintenance problem is offered.
These data structures are defined in terms of a family of digraphs which have previously been defined,
representing solutions for this problem. We present as well a prototype of the method in Haskell.