The SCEAS System
Navigation Menu

Search the dblp DataBase


Saurabh Sinha: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Saurabh Sinha, Martin Tompa
    Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites. [Citation Graph (0, 0)][DBLP]
    BIBE, 2003, pp:214-0 [Conf]
  2. Ganesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha
    Semantics-based reverse engineering of object-oriented data models. [Citation Graph (0, 0)][DBLP]
    ICSE, 2006, pp:192-201 [Conf]
  3. Saurabh Sinha, Mary Jean Harrold, Gregg Rothermel
    System-Dependence-Graph-Based Slicing of Programs with Arbitrary Interprocedural Control Flow. [Citation Graph (0, 0)][DBLP]
    ICSE, 1999, pp:432-441 [Conf]
  4. Saurabh Sinha, Alessandro Orso, Mary Jean Harrold
    Automated Support for Development, Maintenance, and Testing in the Presence of Implicit Control Flow. [Citation Graph (0, 0)][DBLP]
    ICSE, 2004, pp:336-345 [Conf]
  5. Alessandro Orso, Saurabh Sinha, Mary Jean Harrold
    Incremental Slicing Based on Data-Dependences Types. [Citation Graph (0, 0)][DBLP]
    ICSM, 2001, pp:158-0 [Conf]
  6. Saurabh Sinha, Mary Jean Harrold
    Analysis of Programs with Exception-Handling Constructs. [Citation Graph (0, 0)][DBLP]
    ICSM, 1998, pp:348-357 [Conf]
  7. Saurabh Sinha, Mary Jean Harrold
    Criteria for Testing Exception-Handling Constructs in Java Programs. [Citation Graph (0, 0)][DBLP]
    ICSM, 1999, pp:265-0 [Conf]
  8. Yuqun Chen, Ramarathnam Venkatesan, Matthew Cary, Ruoming Pang, Saurabh Sinha, Mariusz H. Jakubowski
    Oblivious Hashing: A Stealthy Software Integrity Verification Primitive. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2002, pp:400-414 [Conf]
  9. Ramarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha
    A Graph Theoretic Approach to Software Watermarking. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2001, pp:157-168 [Conf]
  10. Mathieu Blanchette, Saurabh Sinha
    Separating real motifs from their artifacts. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2001, pp:30-38 [Conf]
  11. Saurabh Sinha
    On counting position weight matrix matches in a sequence, with application to discriminative motif finding. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2006, pp:454-463 [Conf]
  12. Saurabh Sinha, Erik van Nimwegen, Eric D. Siggia
    A probabilistic method to detect regulatory modules. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2003, pp:292-301 [Conf]
  13. Saurabh Sinha, Martin Tompa
    A Statistical Method for Finding Transcription Factor Binding Sites. [Citation Graph (0, 0)][DBLP]
    ISMB, 2000, pp:344-354 [Conf]
  14. Mary Jean Harrold, Gregg Rothermel, Saurabh Sinha
    Computation of Interprocedural Control Dependence. [Citation Graph (0, 0)][DBLP]
    ISSTA, 1998, pp:11-20 [Conf]
  15. Alessandro Orso, Saurabh Sinha, Mary Jean Harrold
    Effects of Pointers on Data Dependences. [Citation Graph (0, 0)][DBLP]
    IWPC, 2001, pp:39-49 [Conf]
  16. Mary Jean Harrold, James A. Jones, Tongyu Li, Donglin Liang, Alessandro Orso, Maikel Pennings, Saurabh Sinha, S. Alexander Spoon, Ashish Gujarathi
    Regression Test Selection for Java Software. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2001, pp:312-326 [Conf]
  17. Amol Prakash, Mathieu Blanchette, Saurabh Sinha, Martin Tompa
    Motif Discovery in Heterogeneous Sequence Data. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2004, pp:348-359 [Conf]
  18. Saurabh Sinha
    Discriminative motifs. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:291-298 [Conf]
  19. Raúl A. Santelices, Saurabh Sinha, Mary Jean Harrold
    Subsumption of program entities for efficient coverage and monitoring. [Citation Graph (0, 0)][DBLP]
    SOQUA, 2006, pp:2-5 [Conf]
  20. Jaebum Kim, Saurabh Sinha
    Indelign: a probabilistic framework for annotation of insertions and deletions in a multiple alignment. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:3, pp:289-297 [Journal]
  21. Saurabh Sinha, Mathieu Blanchette, Martin Tompa
    PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:170- [Journal]
  22. Saurabh Sinha, Mark D. Schroeder, Ulrich Unnerstall, Ulrike Gaul, Eric D. Siggia
    Cross-species comparison significantly improves genome-wide prediction of cis-regulatory modules in Drosophila. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:129- [Journal]
  23. Saurabh Sinha
    Discriminative Motifs. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:3/4, pp:599-615 [Journal]
  24. Saurabh Sinha, Martin Tompa
    YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2003, v:31, n:13, pp:3586-3588 [Journal]
  25. Saurabh Sinha, Yupu Liang, Eric D. Siggia
    Stubb: a program for discovery and analysis of cis-regulatory modules. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2006, v:34, n:Web-Server-Issue, pp:555-559 [Journal]
  26. Sandra A. Mamrak, Saurabh Sinha
    A Case Study: Productivity and Quality Gains Using an Object-Oriented Framework. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1999, v:29, n:6, pp:501-518 [Journal]
  27. Alessandro Orso, Saurabh Sinha, Mary Jean Harrold
    Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2004, v:13, n:2, pp:199-239 [Journal]
  28. Saurabh Sinha, Mary Jean Harrold, Gregg Rothermel
    Interprocedural control dependence. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2001, v:10, n:2, pp:209-254 [Journal]
  29. Saurabh Sinha, Mary Jean Harrold
    Analysis and Testing of Programs with Exception Handling Constructs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2000, v:26, n:9, pp:849-871 [Journal]

  30. From Informal Process Diagrams to Formal Process Models. [Citation Graph (, )][DBLP]

  31. Debugging Model-Transformation Failures Using Dynamic Tainting. [Citation Graph (, )][DBLP]

  32. Accurate Interprocedural Null-Dereference Analysis for Java. [Citation Graph (, )][DBLP]

  33. Making defect-finding tools work for you. [Citation Graph (, )][DBLP]

  34. Efficient Testing of Service-Oriented Applications Using Semantic Service Stubs. [Citation Graph (, )][DBLP]

  35. Compact modeling of carbon nanotube transistor for early stage process-design exploration. [Citation Graph (, )][DBLP]

  36. Workload-aware neuromorphic design of low-power supply voltage controller. [Citation Graph (, )][DBLP]

  37. A statistical method for alignment-free comparison of regulatory sequences. [Citation Graph (, )][DBLP]

  38. A Simplified Model of Carbon Nanotube Transistor with Applications to Analog and Digital Design. [Citation Graph (, )][DBLP]

  39. Fault localization and repair for Java runtime exceptions. [Citation Graph (, )][DBLP]

  40. Automated support for repairing input-model faults. [Citation Graph (, )][DBLP]

  41. Demystifying model transformations: an approach based on automated rule inference. [Citation Graph (, )][DBLP]

  42. Parametric Process Model Inference. [Citation Graph (, )][DBLP]

  43. Heart of the Matter: Discovering the Consensus of Multiple Clustering Results. [Citation Graph (, )][DBLP]

  44. Automated Bug Neighborhood Analysis for Identifying Incomplete Bug Fixes. [Citation Graph (, )][DBLP]

  45. A 5 GHz BiCMOS I/Q VCO with 360degree variable phase outputs using the vector sum method. [Citation Graph (, )][DBLP]

  46. Towards realistic benchmarks for multiple alignments of non-coding sequences. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002