2009 |
25 | EE | Subir Kumar Ghosh,
Partha P. Goswami,
Anil Maheshwari,
Subhas C. Nandy,
Sudebkumar Prasant Pal,
Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons.
WALCOM 2009: 47-58 |
2006 |
24 | EE | Saswata Shannigrahi,
Sudebkumar Prasant Pal:
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees.
ISAAC 2006: 588-597 |
2004 |
23 | EE | Siddhartha Brahma,
Sandeep Macharla,
Sudebkumar Prasant Pal,
Sudhir Kumar Singh:
Fair Leader Election by Randomized Voting.
ICDCIT 2004: 22-31 |
22 | EE | Sudhir Kumar Singh,
Sudebkumar Prasant Pal,
Somesh Kumar,
R. Srikanth:
A combinatorial approach for studying LOCC transformations of multipartite states
CoRR quant-ph/0406135: (2004) |
21 | EE | Siddhartha Brahma,
P. H. D. Ramakrishna,
Sudebkumar Prasant 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.
Int. J. Comput. Math. 81(12): 1549-1557 (2004) |
20 | EE | Sudebkumar Prasant Pal,
Rakesh Kumar Koul,
Frahad Musadeekh,
P. H. D. Ramakrishna,
Hironmay Basu:
Computations that require higher than double precision for robust and exact decision making.
Int. J. Comput. Math. 81(5): 595-605 (2004) |
19 | EE | Sudebkumar Prasant Pal,
Rajiv Ranjan Suman,
G. Sudha Anil Kumar,
Ruchi Malhotra:
Virtual video caching: A scalable and generic technique for improved quality of video service.
J. High Speed Networks 13(4): 249-263 (2004) |
2003 |
18 | EE | Sudebkumar Prasant Pal,
Dilip Sarkar:
On multiple connectedness of regions visible due to multiple diffuse reflections
CoRR cs.CG/0306010: (2003) |
17 | EE | P. H. D. Ramakrishna,
Sudebkumar Prasant Pal,
Samir Bhalla,
Hironmay Basu,
Sudhir Kumar Singh:
Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
CoRR cs.NA/0306015: (2003) |
16 | | Smruti R. Sarangi,
P. N. Sireesh,
Sudebkumar Prasant Pal:
A scalable, efficient and general Monte Carlo scheme for generating synthetic web request streams.
Comput. Syst. Sci. Eng. 18(3): 121-128 (2003) |
1998 |
15 | | Supriya Biswas,
D. Chithra Prasad,
Sudebkumar Prasant Pal:
Recognizing weakly convex visible polygons.
Comput. Geom. 10(3): 171-186 (1998) |
14 | | D. Chithra Prasad,
Sudebkumar Prasant Pal,
Tamal K. Dey:
Visibility with multiple diffuse reflections.
Comput. Geom. 10(3): 187-196 (1998) |
13 | EE | Boris Aronov,
Alan R. Davis,
Tamal K. Dey,
Sudebkumar Prasant Pal,
D. Chithra Prasad:
Visibility with One Reflection.
Discrete & Computational Geometry 19(4): 553-574 (1998) |
12 | EE | Boris Aronov,
Alan R. Davis,
Tamal K. Dey,
Sudebkumar Prasant Pal,
D. Chithra Prasad:
Visibility with Multiple Reflections.
Discrete & Computational Geometry 20(1): 61-78 (1998) |
11 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal:
An algorithm for finding a non-trivial lower bound for channel routing1.
Integration 25(1): 71-84 (1998) |
1997 |
10 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal:
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing.
VLSI Design 1997: 531-533 |
1996 |
9 | | Boris Aronov,
Alan R. Davis,
Tamal K. Dey,
Sudebkumar Prasant Pal,
D. Chithra Prasad:
Visibility with Multiple Reflections.
SWAT 1996: 284-295 |
1995 |
8 | EE | Boris Aronov,
Alan R. Davis,
Tamal K. Dey,
Sudebkumar Prasant Pal,
D. Chithra Prasad:
Visibility with Reflection.
Symposium on Computational Geometry 1995: 316-325 |
7 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
M. M. Das,
Ajit Pal:
Computing area and wire length efficient routes for channels.
VLSI Design 1995: 196-201 |
6 | EE | Rajat K. Pal,
A. K. Datta,
Sudebkumar Prasant Pal,
M. M. Das,
Ajit Pal:
A general graph theoretic framework for multi-layer channel routing.
VLSI Design 1995: 202-207 |
1994 |
5 | | Supriya Biswas,
D. Chithra Prasad,
Sudebkumar Prasant Pal:
Algorithms for Convex Visibility Problems.
FSTTCS 1994: 181-192 |
4 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
C. E. Veni Madhavan:
An algorithm for recognizing palm polygons.
The Visual Computer 10(8): 443-451 (1994) |
1993 |
3 | | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal,
Alak K. Dutta:
NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic.
VLSI Design 1993: 80-83 |
2 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom. 3: 213-233 (1993) |
1991 |
1 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon.
FSTTCS 1991: 369-389 |