IPM - School of Mathematics
Papers of School of Mathematics
|
|
|
|
| [Search Papers] [Print this List] | |
| 41. | M. Sal Moslehian, On (Co)homology of triangular Banach algebras, 67 Banach Center Publ. 271-276 (2005) [abstract] |
| 42. | H. H. Najaf-abadi, H. Sarbazi-azad and P. Rajabzadeh, Performance modeling of fully adaptive wormhole routing in 2-D mesh-connected multiprocessors, Modeling, analysis, and simulation of computer and telecom. systems De-Groot and Harrison, eds. IEEE Computing society press (2004) [abstract] |
| 43. | Moj. Moniri and J. S. Eivazloo, Using nets in Dedekind, monotone, or Scott incomplete ordered fields and definability issues, Proceedings of the Ninth Prague Topological Symposium Petr Simon, ed. Topol. Atlas 195-203 (2002) [abstract] |
| 44. | M. Karimi Behbahani, A. Rafiey and M. Shahshahani, On skeletons attached to grey scale images, International Conference on Machine Learning and Applications M. Arif Wani, ed. CSREA, Las Vegas 282-288 (2002) [abstract] |
| 45. | V. D. Tonchev and H. Kharaghani, On a class of twin balanced incomplete block designs, Codes and Designs K.T. Arasu and A. Seress, eds. de Gruyter, New York 157-164 (2002) [abstract] |
| 46. | A. Farhadi and M. Shahshahani, Classification and detection in computer vision, International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences F. Valafar, ed. CSREA Press, Las Vegas 446-452 (2001) [abstract] |
| 47. | B. Djafari-Rouhani, E. Tarafdar and P. J. Watson, Fixed point theorems, coincidence theorems and variational inequalities, 502 Generalized Convexity and Generalized Monotonicity N. Hadjisavvas, J. E. Martinez-Legaz, and Jean-Paul Penot, eds. Springer-Verlag, Berlin 183-188 (2001) [abstract] |
| 48. | H. Kharaghani, An asymptotic existence result for orthogonal designs, 329 Combinatorics Advances Math. Appl. (C.J. Colbourn and E.S. Mahmoodian, eds.) Kluwer Academic Press, Dordrecht 225-233 (1996) [abstract] MR 96h:05032 |
| 49. | B. Kalantari and I. Kalantari, A linear-time algorithm for minimum cost flow on undirected one-trees, 329 Combinatorics Advances Math. Appl. (C.J. Colbourn and E.S. Mahmoodian, eds.) Kluwer Academic Press, Dordrecht 217-223 (1996) [abstract] MR 1366850 |
| 50. | B. Kalantari, A simple polynomial time algorithm for a convex hull problem equivalent to linear programming, 329 Combinatorics Advances Math. Appl.(C.J. Colbourn and E.S. Mahmoodian, eds.) Kluwer Academic Press, Dordrecht 207-216 (1996) [abstract] MR 96j:90051 |