“Papers of School of Computer Science”
A performance model of disha routing in K-ary N-cube networks,
Parallel Processing Letters 17(2007), 213-228 [abstract]
42. H. Hojjat, H. Nakhost and M. Sirjani,
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol,
Journal of Universal Computer Science 13(2007), 2076-2104 [abstract]
43. M. Ghodsi, H. Mahini, K. Mirjalali, S. Oveis Gharan, A. S. Sayedi and M. Zadimoghaddam,
Spanning trees with minimum weighted degrees,
Information Processing Letters (2007), 113-116 [abstract]
44. A. Ghasemi and K. Faez,
Jointly rate and power control in contention based MultiHop Wireless Networks,
Computer Communications 30(2007), 2021-2031 [abstract]
45. R. Khosravi and M. Ghodsi,
Query-point visibility constrained shortest paths in simple polygons,
Theoretical Computer Science 389(2007), 1-11 [abstract]
46. R. Zarei, S. Arab and M. Sadeghi,
A method for protein accessibility prediction based on residue types and conformational states,
Computational Biology and Chemistry 31(2007), 384-388 [abstract]
47. S. Arab, F. Didehvar, C. Eslahchi and M. Sadeghi,
Helix segment assignment in proteins using fuzzy logic,
5(2007), 93-99 [abstract]
48. G. Jaberipur and A. Kaivani,
Binary-coded decimal digit multipliers,
IET Computers & Digital Techniques 1(2007), 377-381 [abstract]
49. 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]
50. H. Ahrabian and A. Nowzari-dalini,
Parallel Generation of t-Ary Trees in A-order,
The Computer Journal 50(2007), 581-588 [abstract]
back to top
