Fabian Kuhn, René Struik Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. [Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2001, pp:212-229 [Conf]

René Struik An improvement of the Van Wee bound for binary linear covering codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1280-0 [Journal]

René Struik On the structure of linear codes with covering radius two and three. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1406-1416 [Journal]

Search in 0.002secs, Finished in 0.003secs

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