A practical method for reducing sparse matrices with invariant entries

DOI10.1080/00207168208803329zbMath0489.68091OpenAlexW2041562483MaRDI QIDQ3951588

Ryosaku Shimada, Junichi Aoe, Yoneo Yamamoto

Publication date: 1982

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

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

zbMATH Keywords

reduction methodstorage requirementretrieval timelexical analysis tableparsing table

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (3)

An Efficient Trie Construction for Natural Language Dictionaries ⋮ A practical method for compressing sparse matrices with variant entries ⋮ A practical method for implementing string pattern matching machines

Uses Software

• YACC

Cites Work

• The programming language Pascal
• Unnamed Item
• Unnamed Item

This page was built for publication: A practical method for reducing sparse matrices with invariant entries