Aoe, Jun-Ichi A practical method for compressing sparse matrices with variant entries. (English) Zbl 0701.68020 Int. J. Comput. Math. 36, No. 3-4, 163-173 (1990). Summary: A row displacement method compresses efficiently a sparse matrix into a one-dimensional array. The access time with this method is 0(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 effectivity is confirmed by theoretical and empirical observations. Cited in 1 Document MSC: 68P05 Data structures 68P20 Information storage and retrieval of data 68W10 Parallel algorithms in computer science Keywords:large sparse matrix; dynamic data structure; storing and searching; table compression; table look up PDFBibTeX XMLCite \textit{J.-I. Aoe}, Int. J. Comput. Math. 36, No. 3--4, 163--173 (1990; Zbl 0701.68020) Full Text: DOI References: [1] DOI: 10.1145/360825.360855 · Zbl 0301.68048 · doi:10.1145/360825.360855 [2] Aho A.V., Data Structures and Algorithms (1983) · Zbl 0487.68005 [3] Aho A.V., Compilers–Principles, Techniques, and Tools (1986) [4] Aoe J., IEJCE Trans 65 pp 989– (1982) [5] DOI: 10.1080/00207168208803329 · Zbl 0489.68091 · doi:10.1080/00207168208803329 [6] DOI: 10.1109/TSE.1983.236167 · Zbl 05341230 · doi:10.1109/TSE.1983.236167 [7] DOI: 10.1109/TSE.1984.5010205 · Zbl 0524.68056 · doi:10.1109/TSE.1984.5010205 [8] Aoe J., IPS Trans 26 pp 211– (1985) [9] Knuth, D.E. 1973.The Art of Computer Programming, Vol. 1, 295–304. Reading, Mass: Addison-Wesley. Fundamental Algorithm, ibid., 3, Sorting and Searching, 481-505 [10] Okoma S., Introduction of COBOL (1975) [11] Suji T., Detailed World Atlas (1986) [12] DOI: 10.1093/comjnl/19.4.353 · Zbl 0341.65025 · doi:10.1093/comjnl/19.4.353 [13] Tarjan, R.E. 1976.Graph Theory and Gaussian Elimination, in: Sparse Matrix Computations, Edited by: Bunch, J.R. and Rose, D.E. 3–22. New York: Academic Press. [14] DOI: 10.1145/359168.359175 · Zbl 0414.68038 · doi:10.1145/359168.359175 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.