\documentclass[Kashida, openany, oneside, 12pt]{book}
\usepackage[colorlinks=true,citecolor=blue,pagebackref=true]{hyperref}
\usepackage{xepersian}
\settextfont{XB Yas}
%\setdigitfont{Parsi Digits}
%\hypersetup{colorlinks=true,linkcolor=black,citecolor=black,filecolor=black,urlcolor=cyan,pagebackref=true}


\begin{document}

\cite{11},\cite{1}
\newpage
\cite{14},\cite{4}
\newpage{\cite{14}}
\clearpage
\begin{thebibliography}{99}
\begin{latin}
\bibitem[\lr{BS98}]{1} Bachmann, O. and Sch\"onemann, H. ``Monomial representations for Gr\"obner bases computations''.
Proceedings of ISSAC 1998, ACM Press(1998) 309–316.

\bibitem[\lr{BS87}]{BS87}Bayer, D., and Stillman, M. ``A theorem on refining division orders by the revers lexicographic order''. Duke J. Math. 55 (1987), 321-328.

\bibitem[\lr{Bro77}]{2} Brown, W. S. ``Altran Users Manual''. 4th edition. Bell Labs, Murray Hill, N.J., 1977.

\bibitem[\lr{CLO92}]{3} Cox, D. Little, J. O’Shea, D. ``Ideals, Varieties and Algorithms: An Introduction to Computational
Algebraic Geometry and Commutative Algebra''. Springer Verlag, 1992.

\bibitem[\lr{Fat03}]{fat03}Fateman, R.,  ``Comparing the speed of programs for sparse polynomial multiplication''. ACM SIGSAM Bulletin 37(1), 4–15, 2003.

\bibitem[\lr{GCL92}]{4} Geddes, K. O. Czapor, S. R. and Labahn, G. ``Algorithms for Computer Algebra'', Kluwer Academic, 1992.

\bibitem[\lr{GS}]{5} Grayson, D. R. and Stillman, M. E. ``Macaulay 2, a software system for research in algebraic geometry''.
Available at http://www.math.uiuc.edu/Macaulay2/

\bibitem[\lr{PS05}]{6} Greuel G.-M., Pfister, G. and Sch\"onemann, H. ``Singular 3.0. A Computer Algebra System for Polynomial
Computations''. Centre for Computer Algebra, University of Kaiserslautern(2005).
http://www.singular.uni-kl.de.

\bibitem[\lr{HPSS75}]{hpss75} Harper, L.H., Payne, T.H., Savage, J.E., Straus, E., 1975. ``Sorting X+Y''. Comm. ACM 18 (6) 347–349.

\bibitem[\lr{JSM92}]{7} Jenks, R. Sutor, R. and Morrison, S. ``AXIOM: The Scientific Computation System''. Springer Verlag, 1992.

\bibitem[\lr{Joh74}]{8} Johnson, S-C. ``Sparse polynomial arithmetic''. ACMSIGSAM Bulletin, Volume 8, Issue 3 (1974) 63–71.

\bibitem[\lr{LL96}]{9} Anthony LaMarca, Richard Ladner. "The Influence of Caches on the Performance of Heaps". J. Experimental
Algorithms 1, Article 4, 1996.

\bibitem[\lr{MP07}]{11} Monagan, M. Pearce, R. ``Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors''. Proc. of CASC '07, Springer Verlag LNCS 4770,(2007) 295–315.

\bibitem[\lr{MP09}]{mp09} Monagan, M. Pearce, R. ``Sparse Polynomial Division using Heaps''. Accepted for J. Symb. Comp., September 2009.

\bibitem[\lr{MGHLVMD09}]{12} Monagan, M. Geddes, K. Heal, K. Labahn, G. Vorkoetter, S. McCarron, J. DeMarco, P. ``Maple 13 Introductory Programming Guide Maplesoft''. 2009.

\bibitem[\lr{Sto84}]{13} Stoutemyer, D. ``Which Polynomial Representation is Best?'' Proceedings of the 1984 Macsyma Users Conference Schenectedy, N.Y., (1984) 221–244.

\bibitem[\lr{Rob85}]{Rob85}Robbiano, L. ``Term Ordering on the Polynomial Ring''. in proceeding of EUROCAL 85, Lecture Notes in Computer Science 204 (1985), pp.513-517

\bibitem[\lr{Yan98}]{14} Yan, T. ``The Geobucket Data Structure for Polynomials''. J. Symb. Comput. 25 (1998) 285–293
\end{latin}
\end{thebibliography}

\end{document}