|
Pages:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
|
[Search Papers]
|
| 1. | H. Ahrabian and A. Nowzari-Dalini,
Gray Code Algorithm for Listing k-ary Trees
13(2004), 243-251 [abstract]
|
| |
| 2. | H. Ahrabian and A. Nowzari-dalini,
Parallel Generation of Binary Trees in A-Order
Parallel Computing 31(2005), 948-955 [abstract]
|
| |
| 3. | H. Ahrabian and A. Nowzari-dalini,
Parallel Generation of t-Ary Trees in A-order
The Computer Journal 50(2007), 581-588 [abstract]
|
| |
| 4. | G. Jaberipur and B. Parhami,
Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic
IET circuits, devices & systems 1(2007), 102-110 [abstract]
|
| |
| 5. | G. Jaberipur and A. Kaivani,
Binary-coded decimal digit multipliers
IET Computers & Digital Techniques 1(2007), 377-381 [abstract]
|
| |
| 6. | A. Khonsari, H. Sarbazi-Azad and M. Ould-Khaoua,
A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes
Parallel Processing Letter 15(2005), 153-168 [abstract]
|
| |
| 7. | A. Khonsari and M. Ould_Khaoua,
A performance model of compressionless routing in k-ary n-cube networks
Performance Evaluation 63(2006), 423-440 [abstract]
|
| |
| 8. | F. Safaaei, A. Khonsari, M. Fathy and M. Ould-Khaoua,
An Analytical Model of Pipelined Circuit Switching in Hypercubes in the Presence of Hot Spot Traffic
PEN-PCGCS & ICPP
[abstract]
|
| |
| 9. | R. Khosravi and M. Ghodsi,
The Fastest Way to View a Query Point in Simple Polygons
[abstract]
|
| |
| 10. | A. E. Kiasari, H. Sarbazi-Azad and S. Hesabi,
Caspian: A tunable performance model for multi-core systems
Euro-Par 2008
[abstract]
|
| |
back to top |
Pages :
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
