Frank Drewes NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:45, n:2, pp:89-94 [Journal]
Tracy Kimbrel, Rakesh K. Sinha A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:45, n:2, pp:107-110 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP