Sudhir Kumar Singh (M. Sc. Maths. and
Computing 1999-2004, now in UCLA), S. P. Pal, Somesh Kumar (Department of Mathematics,
IIT Kharagpur) and R. Srikanth (Raman Research
Institute, Bangalore),
*
A combinatorial approach for studying LOCC transformations of
multipartite states,
Journal of Mathematical Physics, 46, 122105 (2005).
*

*S. P. Pal, Siddhartha Brahma (B. Tech.
CSE, 2001-2005) and Dilip Sarkar (Univ. of Miami),*
*
A linear worst-case lower bound on the number of holes in regions
visible due to multiple diffuse reflections,*
Journal of Geometry, vol. 81, no. 1-2, December 2004,
Birkhauser-Verlag.

*
*

D. Chithra Prasad (Ph. D. 1994-1996), S. P. Pal and T.
K. Dey (now in Ohio State Uninversity, USA). *Visibility with multiple
diffuse reflections (download gzipped postscript file)..
Computational Geometry:Theory and Applications, Vol. 10, (1998), 187--196.*

*B. Aronov (Brooklyn Polytechnic, NY, USA), A. Davis, T. K. Dey (now in Ohio State
University, USA),
S. P. Pal and D. Chithra Prasad (Ph. D. 1994-1996) Visibility
with multiple reflections (download gzipped postscript file).
Discrete & Computational Geometry, Vol. 20, No. 61, (1998), 61--78.
*

*
Preliminary version in Proceedings of the
5th SWAT (Scandinavian Workshop on Algorithms Theory),
1996, LNCS (Lecture Notes on Computer Science), 1097, 284-295.*

*B. Aronov (Brooklyn Polytechnic, NY, USA), A. Davis, T. K. Dey (now in
Ohio State University, USA),
S. P. Pal and D. Chithra Prasad (Ph. D. 1994-1996) Visibility
with one reflection (download gzipped postscript file).
Discrete & Computational Geometry, Vol. 19, No. 4, (1998), 553-574.
*

*
Preliminary version in Proceedings of the
11th ACM SoCG (Symposium on
Computational Geometry), 1995, 316-325.*

*S. K. Ghosh (TIFR Mumbai), A. Maheshwari,
S. P. Pal, S. Saluja and C. E. Veni*

*Madhavan (IISc Bangalore),*

*Characterizing and recognizing
weak visibility polygons,*

*Computational Geometry:*

*Theory and Applications, 3 (1993),
pp. 213-233, Elsevier, North-Holland.
*

*
Preliminary version in the Proceedings of the
Second Canadian Conference on Computational Geometry,
pp. 93-97, August 1990.
*

*S. Biswas, D. C. Prasad and
S. P. Pal,*

*Recognizing weakly convex visible*

*polygons, Computational Geometry:
Theory and Applications,*

*Elsevier, North-Holland, 10
(1998), pp. 171-186.*

*
Preliminary version in Proceedings of the
fourteenth conference on Foundations
of Software Technology and
Theoretical Computer Science (FSTTCS 1994), Lecture Notes on Computer Science, vol. 880, pp. 181-192, Springer-Verlag.
*

*S. K. Ghosh (TIFR Mumbai),*

*A. Maheshwari, S. P.Pal and
C. E. Veni Madhavan (IISc Bangalore),*

*An algorithm for recognizing
palm polygons,*

*The Visual Computer: Special
issue on Computational
*

*Geometry (Invited paper), 10
(1994), pp. 443-451, Springer-Verlag.*

*
Preliminary version in the Proceedings
of the Second Canadiam Conference on Computational Geometry,
pp. 246-251, August 1990.
*

*R. K. Pal (Ph. D. 1991-1993),
S. P. Pal and A. Pal,*

*An algorithm for finding a non-trivial*
*lower bound for channel*

*routing, INTEGRATION: The VLSI
Journal, 25 (1998), pp. 71-84, Elsevier, North-Holland.*

*S. P. Pal, B. Dasgupta and C.
E. Veni Madhavan (IISc Bangalore),*

*Optimal polygon placement by
translation,*

*International Journal of Computer
Mathematics,*

*52 (1994), pp. 139-148, Gordon
and Breach Science Publishers.*

*
Preliminary version in the Proceedings of the Second Canadiam Conference
on Computational Geometry, pp. 164-171, Auust 1990.
*

*Smruti Sarangi (B. Tech. 1998-2002),
P. N. Sireesh (B. Tech. 1998-2002)
and S. P. Pal,*

*A Scalable, Efficient and General
Monte Carlo Scheme for Generating Synthetic Web Request Streams,*

*
International Journal of Computer Systems Science and Engineering,
CRL Publishing Ltd., UK, Vol. 18, no. 3, pp. 121-128, May 2003.*
*ABSTRACT:
We propose a Monte Carlo scheme (GRAPES) for generating
synthetic web request streams. These request streams obey the Zipf
page popularity distribution and temporal locality in the form of
log-normal stack-distance distribution.
Our algorithm avoids the use of an explicit stack; it
uses a precomputed set of coefficients representing stack-distance
distribution to generate web page
requests. Using these coefficients our the algorithm runs
in time proportional to the number of generated requests in contrast
to other request stream generators that run in time proportional to the
product of the stack size and the number of generated requests.
The performance
plots suggest a speedup of an order of magnitude for large inputs. We
use an intricate
randomization strategy to produce a uniform and random request stream.
Our scheme is amenable to an efficient parallel implementation.
*

*S. P. Pal, Rakesh Kumar Koul (M. S. 1998-2000),
Frahad Musadeekh,
P. H. D. Ramakrishna (M. Tech. CSE 1998-2000) and Hironmay Basu (B. Tech. CSE 1999-2003)*

*Computations that require higher
than double precision for robust and exact decision making,*
International Journal of Computer Mathematics, vol 81, no. 5, pp.
595-605, May 2004.

*
*

*
Siddhartha Brahma (B Tech 2005), P. H. D. Ramakrishna (M Tech 2000)
and S. P. Pal,
*

*
A new and novel method for computing an upper bound
on the distance of an approximate zero from an exact zero
of a univariate polynomial,
*

*
*
International Journal of Computer Mathematics, vol. 81, no. 12, pp. 1549-1557,
December 2004.

*
Virtual video caching: A scalable and generic technique for improved
quality of video service, S. P. Pal, Rajiv Ranjan Suman (M Tech 2003),
G. S. Anil Kumar (Dual degree 2004) and Ruchi
Malhotra (B Tech 2003),
Journal of High Speed Networks, vol. 13, no. 4, December 2004, IOS Press.
*

*
*