Author:
Atkinson Michael D.,Santoro N.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. Improved time and space bounds for Boolean matrix multiplication;Adleman;Acta Informatica,1978
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. On economical construction of the transitive closure of a directed graph;Arlazarov;Dokl. Akad. Nauk SSSR,1970
4. Four O(N2) multiplication methods for sparse and dense Boolean matrices;Santoro,1981
5. An improved algorithm for Boolean matrix multiplication;Santoro;Computing,1986
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient multi-hop connectivity analysis in urban vehicular networks;Vehicular Communications;2014-04
2. Regularity Lemmas and Combinatorial Algorithms;2009 50th Annual IEEE Symposium on Foundations of Computer Science;2009-10
3. The Closest Pair Problem under the Hamming Metric;Lecture Notes in Computer Science;2009
4. Fast multiplication of matrices over a finitely generated semiring;Information Processing Letters;2008-08
5. latency 2 I/O-bandwidth 2D-array matrix multiplication algorithm;COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering;2002