The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bhaskar DasGupta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bhaskar DasGupta, Barbara Hammer
    On Approximate Learning by Multi-layered Feedforward Circuits. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:264-278 [Conf]
  2. Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
    Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:39-50 [Conf]
  3. Bhaskar DasGupta, Michael A. Palis
    Online real-time preemptive scheduling of jobs with deadlines. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:96-107 [Conf]
  4. Bhaskar DasGupta, Hava T. Siegelmann, Eduardo D. Sontag
    On a Learnability Question Associated to Neural Networks with Continuous Activations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:47-56 [Conf]
  5. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:162-171 [Conf]
  6. Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
    The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:244-253 [Conf]
  7. Bhaskar DasGupta, Sudip Dasgupta, Atal Chowdhury
    Generalized Approach towards the Fault Diagnosis in Any Arbitrarily Connected Networks. [Citation Graph (0, 0)][DBLP]
    HiPC, 1999, pp:404-410 [Conf]
  8. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    Highly Scalable Algorithms for Robust String Barcoding. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:1020-1028 [Conf]
  9. Madhuri Karnik, Bhaskar DasGupta, Vinayak Eswaran
    A Comparative Study of Dirichlet and Neumann Conditions for Path Planning through Harmonic Functions. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2002, pp:442-451 [Conf]
  10. Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani
    Inapproximability Results for the Lateral Gene Transfer Problem. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:182-195 [Conf]
  11. Bhaskar DasGupta, Eduardo D. Sontag
    Sample Complexity for Learning Recurrent Perceptron Mappings. [Citation Graph (0, 0)][DBLP]
    NIPS, 1995, pp:204-210 [Conf]
  12. Bhaskar DasGupta, Georg Schnitger
    The Power of Approximation: A Comparison of Activation Functions. [Citation Graph (0, 0)][DBLP]
    NIPS, 1992, pp:615-622 [Conf]
  13. Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk
    On the complexity and approximation of syntenic distance. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:99-108 [Conf]
  14. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Slice and dice: a simple, improved approximate tiling recipe. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:455-464 [Conf]
  15. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Simple approximation algorithm for nonoverlapping local alignments. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:677-678 [Conf]
  16. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Improved approximation algorithms for rectangle tiling and packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:427-436 [Conf]
  17. Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang
    On Distances between Phylogenetic Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:427-436 [Conf]
  18. Piotr Berman, Bhaskar DasGupta
    Improvements in throughout maximization for real-time scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:680-687 [Conf]
  19. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight Approximability Results for Test Set Problems in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:39-50 [Conf]
  20. Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
    Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:419-433 [Conf]
  21. Piotr Berman, Bhaskar DasGupta
    Approximating the Online Set Multicover Problems via Randomized Winnowing. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:110-121 [Conf]
  22. Bhaskar DasGupta, German A. Enciso, Eduardo D. Sontag, Yi Zhang
    Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:253-264 [Conf]
  23. Piotr Berman, Bhaskar DasGupta
    Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:331-356 [Journal]
  24. Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp
    On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:176-195 [Journal]
  25. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    DNA-BAR: distinguisher selection for DNA barcoding. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:16, pp:3424-3426 [Journal]
  26. Douglas Wood, Bhaskar DasGupta
    Classifying trend movements in the MSCI U.S.A. capital market index - A comparison of regression, arima and neural network methods. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:6, pp:611-622 [Journal]
  27. Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao
    Opportunity Cost Algorithms for Combinatorial Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  28. Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk
    On the Complexity and Approximation of Syntenic Distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:59-82 [Journal]
  29. Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
    The inverse protein folding problem on 2D and 3D lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:719-732 [Journal]
  30. Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
    Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:733-749 [Journal]
  31. Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag
    Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:010, pp:- [Journal]
  32. Madhuri Karnik, Bhaskar DasGupta, Vinayak Eswaran
    A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2004, v:20, n:3, pp:441-452 [Journal]
  33. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:437-455 [Journal]
  34. Bhaskar DasGupta, C. E. Veni Madhavan
    An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:1, pp:35-44 [Journal]
  35. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Approximation algorithms for MAX-MIN tiling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:122-134 [Journal]
  36. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:443-470 [Journal]
  37. Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
    Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:4, pp:766-785 [Journal]
  38. Piotr Berman, Bhaskar DasGupta
    Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:307-323 [Journal]
  39. Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani
    Inapproximability results for the lateral gene transfer problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:387-405 [Journal]
  40. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight approximability results for test set problems in bioinformatics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:145-162 [Journal]
  41. Bhaskar DasGupta, Michael A. Palis
    Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:57, n:3, pp:345-357 [Journal]
  42. Bhaskar DasGupta, Georg Schnitger
    Analog versus discrete neural networks. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1996, v:8, n:4, pp:805-818 [Journal]
  43. Derong Liu, Xiaoxu Xiong, Zeng-Guang Hou, Bhaskar DasGupta
    Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 2005, v:18, n:5-6, pp:835-842 [Journal]
  44. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:252-267 [Journal]
  45. Bhaskar DasGupta, Barbara Hammer
    On approximate learning by multi-layered feedforward circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:1, pp:95-127 [Journal]
  46. Bhaskar DasGupta, Eduardo D. Sontag
    A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:161-189 [Journal]
  47. Bhaskar DasGupta, Eduardo D. Sontag
    Sample complexity for learning recurrent perceptron mappings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1479-1487 [Journal]
  48. Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks
    A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:407-419 [Conf]
  49. Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta, Jie Liang
    Topology Independent Protein Structural Alignment. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:171-182 [Conf]
  50. Vipin K. Tripathi, Bhaskar DasGupta, Kalyanmoy Deb
    A Computational Method for Viewing Molecular Interactions in Docking. [Citation Graph (0, 0)][DBLP]
    VIEW, 2006, pp:152-163 [Conf]
  51. Piotr Berman, Bhaskar DasGupta, Jie Liang
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:4, pp:301- [Journal]
  52. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    Highly Scalable Algorithms for Robust String Barcoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  53. Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley
    Characterizations of bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:11-25 [Journal]
  54. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
    On constructing an optimal consensus clustering from multiple clusterings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:137-145 [Journal]

  55. On Approximating an Implicit Cover Problem in Biology. [Citation Graph (, )][DBLP]


  56. Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP. [Citation Graph (, )][DBLP]


  57. On Approximate Horn Formula Minimization. [Citation Graph (, )][DBLP]


  58. Reconstructing sibling relationships in wild populations. [Citation Graph (, )][DBLP]


  59. Approximating Transitive Reductions for Directed Networks. [Citation Graph (, )][DBLP]


  60. Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. [Citation Graph (, )][DBLP]


  61. NET-SYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks. [Citation Graph (, )][DBLP]


  62. Topology independent protein structural alignment. [Citation Graph (, )][DBLP]


  63. Approximating Transitivity in Directed Networks [Citation Graph (, )][DBLP]


  64. Stochastic Budget Optimization in Internet Advertising [Citation Graph (, )][DBLP]


  65. Approximating Transitive Reductions for Directed Networks. [Citation Graph (, )][DBLP]


  66. Approximating the Online Set Multicover Problems Via Randomized Winnowing. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002