The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sudebkumar Prasant Pal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Reflection. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:316-325 [Conf]
  2. Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal
    Algorithms for Convex Visibility Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:181-192 [Conf]
  3. Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:369-389 [Conf]
  4. Siddhartha Brahma, Sandeep Macharla, Sudebkumar Prasant Pal, Sudhir Kumar Singh
    Fair Leader Election by Randomized Voting. [Citation Graph (0, 0)][DBLP]
    ICDCIT, 2004, pp:22-31 [Conf]
  5. Saswata Shannigrahi, Sudebkumar Prasant Pal
    Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:588-597 [Conf]
  6. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:284-295 [Conf]
  7. Rajat K. Pal, A. K. Datta, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
    A general graph theoretic framework for multi-layer channel routing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1995, pp:202-207 [Conf]
  8. Rajat K. Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
    Computing area and wire length efficient routes for channels. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1995, pp:196-201 [Conf]
  9. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal
    An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1997, pp:531-533 [Conf]
  10. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta
    NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1993, pp:80-83 [Conf]
  11. Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal
    Recognizing weakly convex visible polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:171-186 [Journal]
  12. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Characterizing and Recognizing Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal]
  13. D. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey
    Visibility with multiple diffuse reflections. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:187-196 [Journal]
  14. Sudebkumar Prasant Pal, Dilip Sarkar
    On multiple connectedness of regions visible due to multiple diffuse reflections [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  15. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  16. Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth
    A combinatorial approach for studying LOCC transformations of multipartite states [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  17. Smruti R. Sarangi, P. N. Sireesh, Sudebkumar Prasant Pal
    A scalable, efficient and general Monte Carlo scheme for generating synthetic web request streams. [Citation Graph (0, 0)][DBLP]
    Comput. Syst. Sci. Eng., 2003, v:18, n:3, pp:121-128 [Journal]
  18. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:1, pp:61-78 [Journal]
  19. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with One Reflection. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:4, pp:553-574 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:5, pp:595-605 [Journal]
  21. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:12, pp:1549-1557 [Journal]
  22. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal
    An algorithm for finding a non-trivial lower bound for channel routing1. [Citation Graph (0, 0)][DBLP]
    Integration, 1998, v:25, n:1, pp:71-84 [Journal]
  23. 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. [Citation Graph (0, 0)][DBLP]
    J. High Speed Networks, 2004, v:13, n:4, pp:249-263 [Journal]
  24. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
    An algorithm for recognizing palm polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1994, v:10, n:8, pp:443-451 [Journal]

  25. Algorithms for Computing Diffuse Reflection Paths in Polygons. [Citation Graph (, )][DBLP]


  26. Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002