Y. Kadoya, M. Fuketa, El-Sayed Atlam, K. Morita, T. Sumitomo & J. Aoe. (2004) A compression algorithm using integrated record information for translation dictionaries. Information Sciences 165:3-4, pages 171-186.
Crossref

J. Aoe, K. Morimoto, M. Shishibori & Ki-Hong Park. (1996) A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering 8:3, pages 476-491.
Crossref

T. Arita, M. Koyama, M. Shishibori & J.-I. Aoe. (1996) Improvement of a row displacement algorithm for sparse table compression. Improvement of a row displacement algorithm for sparse table compression.

T.K. Coburn. (1994) An introduction to the S SPIN hash function: making more out of the multidimensional array. An introduction to the S SPIN hash function: making more out of the multidimensional array.

Jun-Ichi Aoe. (1992) A practical method for implementing string pattern matching machines. Information Sciences 64:1-2, pages 95-114.
Crossref

Jun‐Ichi Aoe, Katsushi Morimoto & Takashi Sato. (2006) An efficient implementation of trie structures. Software: Practice and Experience 22:9, pages 695-721.
Crossref

J.-I. Aoe. (1989) An efficient implementation of static string pattern matching machines. IEEE Transactions on Software Engineering 15:8, pages 1010-1016.
Crossref

Jun-Ichi Aoe. (1989) A fast digital search algorithm using a double-array structure. Systems and Computers in Japan 20:7, pages 92-103.
Crossref

J.-I. Aoe, S. Yasutome & T. Sato. (1988) An efficient digital search algorithm by using a double-array structure. An efficient digital search algorithm by using a double-array structure.

B. L. Marks. (2006) Taming the PL/I syntax. Software: Practice and Experience 14:8, pages 775-789.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Share icon
Back to Top

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references

A practical method for reducing sparse matrices with invariant entries

Articles from other publishers (10)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature