default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBorut Robic
- > Home > Persons > Borut Robic
Publications
- 2007
[j20]Jurij Silc, Theo Ungerer, Borut Robic:
Dynamic branch prediction and control speculation. Int. J. High Perform. Syst. Archit. 1(1): 2-13 (2007)- 2005
- [r1]Jurij Silc, Peter Korosec, Borut Robic:
Ant Colonies and the Mesh-Partitioning Problem. Handbook of Bioinspired Algorithms and Applications 2005 - 2004
- [j16]Peter Korosec
, Jurij Silc, Borut Robic:
Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Comput. 30(5-6): 785-801 (2004) - [j15]Peter Korosec, Jurij Silc, Borut Robic:
"Solving the mesh-partitioning problem with an ant-colony algorithm" [Parallel Computing 30 (2004) 785-801]. Parallel Comput. 30(8): 919-921 (2004) - [c12]Peter Korosec, Jurij Silc, Borut Robic:
Mesh-Partitioning with the Multiple Ant-Colony Algorithm. ANTS Workshop 2004: 430-432 - 2003
- [j14]Theo Ungerer, Borut Robic, Jurij Silc:
A survey of processors with explicit multithreading. ACM Comput. Surv. 35(1): 29-63 (2003) - [c11]Peter Korosec, Jurij Silc, Borut Robic:
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm. IPDPS 2003: 146 - [c10]Jurij Silc, Peter Korosec, Borut Robic:
Combining Vector Quantization and Ant-Colony Algorithm for Mesh-Partitioning. PPAM 2003: 113-118 - 2002
- [j11]Theo Ungerer, Borut Robic, Jurij Silc:
Multithreaded Processors. Comput. J. 45(3): 320-348 (2002) - [j10]Peter Korosec, Jurij Silc, Borut Robic:
An Experimental Study of an Ant-colony Algorithm for the Mesh-partitioning Problem. Parallel Distributed Comput. Pract. 5(3) (2002) - 2000
- [j8]Jurij Silc, Theo Ungerer, Borut Robic:
A survey of new research directions in microprocessors. Microprocess. Microsystems 24(4): 175-190 (2000) - [c8]Jurij Silc, Borut Robic:
Did Processor Architecture Make the Best of Dataflow? PDPTA 2000 - 1999
- [b1]Jurij Silc, Borut Robic, Theo Ungerer:
Processor architecture - from dataflow to superscalar and beyond. Springer 1999, ISBN 978-3-540-64798-0, pp. I-XXII, 1-389 - [j7]Jurij Silc, Borut Robic:
Asynchronous Microprocessors. Informatica (Slovenia) 23(2) (1999) - 1998
- [j6]Jurij Silc, Borut Robic, Theo Ungerer:
Asynchrony in Parallel Computing: From Dataflow to Multithreading. Parallel Distributed Comput. Pract. 1(1) (1998) - 1997
- [c5]Borut Robic, Jurij Silc, Roman Trobec:
Reliability and Throughput Improvement in Massively Parallel Systems. PARCO 1997: 681-684 - 1995
- [j4]Borut Robic, Jurij Silc:
Algorithm Mapping with Parallel Simulated Annealing. Comput. Artif. Intell. 14(4): 339-351 (1995) - [c4]Jurij Silc, Borut Robic:
Efficient Run-Time Program Allocation on a Parallel Coprocessor. Euro-Par 1995: 715-718 - [c3]Jurij Silc, Borut Robic:
Dynamic Program Allocation on the Mesh-Connected Parallel Architecture. PARCO 1995: 701-704 - 1994
- [c2]Borut Robic, Jurij Silc:
Using Parallel Simulated Annealing in the Mapping Problem. PARLE 1994: 797-800 - 1993
- [j3]Jurij Silc, Borut Robic, Joze Buh:
ALPHA AXP Overview. Informatica (Slovenia) 17(1) (1993) - [c1]Borut Robic, Jurij Silc:
High-Performance Computing on a Honeycomb Architecture. ACPC 1993: 1-13 - 1992
- [j2]Borut Robic, Peter Kolbezen, Jurij Silc:
Area optimization of dataflow-graph mappings. Parallel Comput. 18(3): 297-311 (1992) - 1989
- [j1]Jurij Silc, Borut Robic:
Synchronous dataflow-based architecture. Microprocessing and Microprogramming 27(1-5): 315-322 (1989)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
