A practical method for compressing sparse matrices with variant entries

DOI10.1080/00207169008803920zbMath0701.68020OpenAlexW1994452210MaRDI QIDQ3479513

No author found.

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803920

zbMATH Keywords

dynamic data structurelarge sparse matrixtable compressionstoring and searchingtable look up

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

A fast and compact technique of implementing transition tables for finite state automata

Cites Work

• Unnamed Item
• A Method for Improving String Pattern Matching Machines
• Storing a sparse table
• A practical method for reducing sparse matrices with invariant entries
• Efficient string matching
• A direct method for the solution of large sparse systems of linear equations

This page was built for publication: A practical method for compressing sparse matrices with variant entries