“Papers of School of Computer Science”
Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies,
Computers & Electrical Engineering 30(2004), 167-182 [abstract]
92. H. Sarbazi-Azad, M. Ould-khaoua, L. Mackenzie and S.G. Akl,
On some topological properties of k-ary n-cubes,
Journal of Interconnection Networks 15(2004), 79-91 [abstract]
93. H. Sarbazi-Azad, M. Ould-Khaoua and L. M. Mackenzie,
Towards a more realistic comparative analysis of multicomputer networks,
Computation and Concurrency: Practice and Experience 16(2004), 1271-1289 [abstract]
94. H. Beigy and M. R. Meybodi,
A Mathematical Framework For Cellular Learning Automata,
Advances in Complex Systems. 7(2004), 295-319 [abstract]
95. H. Beigy and M. R. Meybodi,
A new fractional channel policy,
Journal of High Speed Networks 13(2004), 25-36 [abstract]
96. H. Hatami and R. Tusserkani,
On the complexity of the circular chromatic number,
Journal of Graph Theory 47(2004), [abstract]
97. A. Bagherl and M. Razzazi,
Drawing free trees inside simple polygons using polygon skeleton,
Computing and Informatics 23(2004), 239-254 [abstract]
98. A. Bagheri and M. Razzazi,
How to draw free trees inside bounded rectilinear polygons,
International Journal of Computer Mathematics 81(2004), 1329 -1339 [abstract]
99. R. Khosravi and M. Ghodsi,
Shortest paths in simple polygons with polygon-meet constraints,
Information Processing Letters 91(2004), 171-176 [abstract]
100. H. Ahrabian and A. Nowzari-Dalini,
Gray Code Algorithm for Listing k-ary Trees,
13(2004), 243-251 [abstract]
back to top
