\documentclass[12pt]{article}

\usepackage{amsfonts}
\newcommand{\comment}[1]{\ignorespaces}

\renewcommand{\baselinestretch}{1.05}
\setlength{\topmargin}{-0.7in}
\setlength{\textwidth}{6.8in}
\setlength{\oddsidemargin}{0.0in}
\setlength{\textheight}{9.6in}

\newlength{\pagewidth}
\setlength{\pagewidth}{6.8in}

\newtheorem{lemma}{Lemma}[section]
\newtheorem{theorem}{Theorem}[section]
\newtheorem{example}{Example}[section]
\newtheorem{obs}{Observation}[section]
\begin{document}
%\setcounter{page}{0}

\title{ 
}

\author{
%Sandeep Sen
\thanks{
Department of Computer Science and Engineering, IIT Delhi, New
Delhi 1100116, India.
%E-mail:\texttt{ssen@cse.iitd.ernet.in}.
}}
\maketitle
\begin{abstract}
\end{abstract}
\section{Introduction}

\bibliographystyle{plain}
\begin{thebibliography}{}
%\bibitem{AgVi88} A. Aggarwal and J. S. Vitter, The Input/Output Complexity
%of Sorting and Related Problems, {\em Communications of the ACM}
%31(9), 1988, pp. 1116-1127.
%
%Parallel Algorithms and Architectures}, 2003, pp. 138-148.
%\bibitem{Chle:89} B.S. Chlebus, Sorting within distance bound on a mesh 
%connected array, {\em Optimal algorithm LNCS vol 401}, 1989, pp. 232-238.
\end{thebibliography}

\end{document}