A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM
A note on multiplying boolean matrices II
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
A note on the transitive closure of a boolean matrix
ACM SIGACT News
IEEE Transactions on Computers
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Fuzzy Sets and Systems
Performance of C++ bit-vector implementations
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
| Hi-index | 48.27 |