Improvement of a row displacement algorithm for sparse table compression

A row displacement method compresses efficiently a sparse matrix into a one-dimensional array. The access time with this method is O(1), but the application was restricted to the static matrices. In order to extend the use of the row displacement method to the dynamic matrices, the algorithms for insertion and deletion are proposed and the efficiency is confirmed by theoretical and empirical observations