Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tomaz Dobravec
2010 – today
- 2011
[j4]Patricio Bulic, Tomaz Dobravec: An approximate method for filtering out data dependencies with a sufficiently large distance between memory references. The Journal of Supercomputing 56(2): 226-244 (2011)
2000 – 2009
- 2009
[j3]Tomaz Dobravec, Borut Robic: Restricted shortest paths in 2-circulant graphs. Computer Communications 32(4): 685-690 (2009)- 2008
[c1]Patricio Bulic, Tomaz Dobravec: Identifying Data Dependencies with a Sufficiently Large Distance Between Memory References in a Multimedia Vectorizing Compiler. PDPTA 2008: 393-397- 2006
[j2]Tomaz Dobravec, Janez Zerovnik, Borut Robic: An optimal message routing algorithm for circulant networks. Journal of Systems Architecture 52(5): 298-306 (2006)- 2003
[j1]Tomaz Dobravec, Borut Robic, Janez Zerovnik: Permutation routing in double-loop networks: design and empirical evaluation. Journal of Systems Architecture 48(13-15): 387-402 (2003)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:51 CET by the dblp team



