Identifying Data Dependencies with a Sufficiently Large Distance Between Memory References in a Multimedia Vectorizing Compiler. [Citation Graph (, )][DBLP]
Restricted shortest paths in 2-circulant graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
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