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

Search the dblp DataBase

Title:
Author:
I. V. Ramakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hasan Davulcu, Michael Kifer, C. R. Ramakrishnan, I. V. Ramakrishnan
    Logic Based Modeling and Analysis of Workflows. [Citation Graph (2, 17)][DBLP]
    PODS, 1998, pp:25-33 [Conf]
  2. R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
    Term Matching on Parallel Computers. [Citation Graph (1, 0)][DBLP]
    ICALP, 1987, pp:336-346 [Conf]
  3. Ta Chen, I. V. Ramakrishnan, R. Ramesh
    Multistage Indexing Algorithms for Speeding Prolog Execution. [Citation Graph (1, 0)][DBLP]
    JICSLP, 1992, pp:639-653 [Conf]
  4. I. V. Ramakrishnan, Prasad Rao, Konstantinos F. Sagonas, Terrance Swift, David Scott Warren
    Efficient Tabling Mechanisms for Logic Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1995, pp:697-711 [Conf]
  5. R. Ramesh, I. V. Ramakrishnan, David Scott Warren
    Automata-Driven Indexing of Prolog Clauses. [Citation Graph (1, 0)][DBLP]
    POPL, 1990, pp:281-291 [Conf]
  6. Hasan Davulcu, Michael Kifer, L. Robert Pokorny, C. R. Ramakrishnan, I. V. Ramakrishnan, Steven Dawson
    Modeling and Analysis of Interactions in Virtual Enterprises. [Citation Graph (1, 0)][DBLP]
    RIDE, 1999, pp:12-18 [Conf]
  7. Hasan Davulcu, Juliana Freire, Michael Kifer, I. V. Ramakrishnan
    A Layered Architecture for Querying Dynamic Web Content. [Citation Graph (1, 24)][DBLP]
    SIGMOD Conference, 1999, pp:491-502 [Conf]
  8. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:322-333 [Conf]
  9. Vineet Enagandula, Niraj Juthani, I. V. Ramakrishnan, Devashish Rawal, Ritwick Vidyasagar
    BlackBoardNV: a system for enabling non-visual access to the blackboard course management system. [Citation Graph (0, 0)][DBLP]
    ASSETS, 2005, pp:220-221 [Conf]
  10. Saikat Mukherjee, I. V. Ramakrishnan, Michael Kifer
    Semantic bookmarking for non-visual web access. [Citation Graph (0, 0)][DBLP]
    ASSETS, 2004, pp:185-192 [Conf]
  11. Jalal Mahmud, Yevgen Borodin, Dipanjan Das, I. V. Ramakrishnan
    Improving non-visual web access using context. [Citation Graph (0, 0)][DBLP]
    ASSETS, 2006, pp:273-274 [Conf]
  12. Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
    Subsumption Algorithms Based on Search Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:135-148 [Conf]
  13. R. C. Sekar, I. V. Ramakrishnan
    Programming with Equations: A Framework for Lazy Parallel Evaluation. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:618-632 [Conf]
  14. Rakesh M. Verma, I. V. Ramakrishnan
    Optimal Time Bounds for Parallel Term Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:694-703 [Conf]
  15. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Terrance Swift, David Scott Warren
    Efficient Model Checking Using Tabled Resolution. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:143-154 [Conf]
  16. C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Yifei Dong, Xiaoqun Du, Abhik Roychoudhury, V. N. Venkatakrishnan
    XMC: A Logic-Programming-Based Verification Toolset. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:576-580 [Conf]
  17. Abhik Roychoudhury, I. V. Ramakrishnan
    Automated Inductive Verification of Parameterized Protocols. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:25-37 [Conf]
  18. Guizhen Yang, I. V. Ramakrishnan, Michael Kifer
    On the complexity of schema inference from web pages in the presence of nullable data attributes. [Citation Graph (0, 0)][DBLP]
    CIKM, 2003, pp:224-231 [Conf]
  19. Hasan Davulcu, Guizhen Yang, Michael Kifer, I. V. Ramakrishnan
    Design and Implementation of the Physical Layer in WebBases: The XRover Experience. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:1094-1105 [Conf]
  20. Saikat Mukherjee, I. V. Ramakrishnan
    Taming the Unstructured: Creating Structured Content from Partially Labeled Schematic Text Sequences. [Citation Graph (0, 0)][DBLP]
    CoopIS/DOA/ODBASE (2), 2004, pp:909-926 [Conf]
  21. Zoé Lacroix, Kaushal Parekh, Hasan Davulcu, I. V. Ramakrishnan, Nikeeta Julasana
    Automating the Biological Data Collection Process with Agents. [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:489-490 [Conf]
  22. Prasad Rao, I. V. Ramakrishnan, Terrance Swift, David Scott Warren
    Dynamic Argument Reduction for In-memory Data Queries. [Citation Graph (0, 0)][DBLP]
    Workshop on Deductive Databases and Logic Programming, 1994, pp:117-129 [Conf]
  23. Hasan Davulcu, Zoé Lacroix, Kaushal Parekh, I. V. Ramakrishnan, Nikeeta Julasana
    Exploiting Agent and Database Technologies for Biological Data Collection. [Citation Graph (0, 0)][DBLP]
    DEXA Workshops, 2004, pp:376-381 [Conf]
  24. Prabhdeep Singh, R. Bhimavarapu, Hasan Davulcu, Chitta Baral, Seungchan Kim, Huan Liu, Michael L. Bittner, I. V. Ramakrishnan
    BioLog: A Browser Based Collaboration and Resource Navigation Assistant for BioMedical Researchers. [Citation Graph (0, 0)][DBLP]
    DILS, 2005, pp:19-30 [Conf]
  25. Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan
    Online Justification for Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:24-38 [Conf]
  26. Ernie Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, Prasad Rao
    A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:284-300 [Conf]
  27. Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron
    Congruence Closure Modulo Associativity and Commutativity. [Citation Graph (0, 0)][DBLP]
    FroCos, 2000, pp:245-259 [Conf]
  28. I. V. Ramakrishnan
    On Mapping Cube Graphs onto VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:296-316 [Conf]
  29. R. Ramesh, I. V. Ramakrishnan, R. C. Sekar
    Automata-Driven Efficient Subterm Unification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:288-299 [Conf]
  30. Deepak D. Sherlekar, Shaunak Pawagi, I. V. Ramakrishnan
    O(1) Parallel Time Incremental Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:477-495 [Conf]
  31. Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
    An Efficient Parallel Algorithm for Term Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:504-518 [Conf]
  32. Radu Grosu, S. Mitra, P. Ye, E. Entcheva, I. V. Ramakrishnan, Scott A. Smolka
    Learning Cycle-Linear Hybrid Automata for Excitable Cells. [Citation Graph (0, 0)][DBLP]
    HSCC, 2007, pp:245-258 [Conf]
  33. R. Ramesh, I. V. Ramakrishnan
    Nonlinear Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:473-488 [Conf]
  34. R. C. Sekar, R. Ramesh, I. V. Ramakrishnan
    Adaptive Pattern Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:247-260 [Conf]
  35. Peter J. Varman, I. V. Ramakrishnan
    On Matrix Multiplication Using Array Processors. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:487-496 [Conf]
  36. Rakesh M. Verma, I. V. Ramakrishnan
    Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:370-385 [Conf]
  37. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICCL, 1998, pp:196-205 [Conf]
  38. Saikat Mukherjee, Guizhen Yang, Wenfang Tan, I. V. Ramakrishnan
    Automatic Discovery of Semantic Structures in HTML Documents. [Citation Graph (0, 0)][DBLP]
    ICDAR, 2003, pp:245-249 [Conf]
  39. Saikat Mukherjee, I. V. Ramakrishnan, Amarjeet Singh
    Bootstrapping Semantic Annotations for Content-Rich HTML Documents. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:583-593 [Conf]
  40. Hasan Davulcu, Saikat Mukherjee, I. V. Ramakrishnan
    Extraction Techniques for Mining Services from Web Sources. [Citation Graph (0, 0)][DBLP]
    ICDM, 2002, pp:601-604 [Conf]
  41. Guizhen Yang, Saikat Mukherjee, I. V. Ramakrishnan
    On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources. [Citation Graph (0, 0)][DBLP]
    ICDM, 2003, pp:395-402 [Conf]
  42. Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma
    Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:166-180 [Conf]
  43. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    Extracting Determinacy in Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:424-438 [Conf]
  44. Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan
    Speculative Beats Conservative Justification. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:150-165 [Conf]
  45. Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan
    Online Justification for Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:500-501 [Conf]
  46. Giridhar Pemmasani, C. R. Ramakrishnan, I. V. Ramakrishnan
    Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:100-114 [Conf]
  47. Abhik Roychoudhury, K. Narayan Kumar, I. V. Ramakrishnan
    Generalized Unfold/fold Transformation Systems for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:616- [Conf]
  48. C. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren
    Deductive Spreadsheets Using Tabled Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:391-405 [Conf]
  49. Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan
    A Thread in Time Saves Tabling Time. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:112-126 [Conf]
  50. Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan
    On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:310-324 [Conf]
  51. P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
    Computing Tree Functions on Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:703-710 [Conf]
  52. P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
    An Efficient Connected Components Algorithm on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:711-714 [Conf]
  53. P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
    Parallel Approximate Algorithms for the 0-1 Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:444-451 [Conf]
  54. Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan
    A Parallel Algorithm for Dominators. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:877-879 [Conf]
  55. Shaunak Pawagi, I. V. Ramakrishnan
    Parallel Updates of Graph Properties in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:186-193 [Conf]
  56. I. V. Ramakrishnan, Donald S. Fussell, Abraham Silberschatz
    On Mapping Homogeneous Graphs on a Linear Array-Processor Model. [Citation Graph (0, 0)][DBLP]
    ICPP, 1983, pp:440-447 [Conf]
  57. I. V. Ramakrishnan, Peter J. Varman
    An Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:376-383 [Conf]
  58. Peter J. Varman, I. V. Ramakrishnan
    A Fault-Tolerant VLSI Matrix Multiplier. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:351-357 [Conf]
  59. Wei Xu, V. N. Venkatakrishnan, R. Sekar, I. V. Ramakrishnan
    A Framework for Building Privacy-Conscious Composite Web Services. [Citation Graph (0, 0)][DBLP]
    ICWS, 2006, pp:655-662 [Conf]
  60. Leo Bachmair, Ta Chen, I. V. Ramakrishnan, Siva Anantharaman, Jacques Chabin
    Experiments with Associative-Commutative Discrimination Nets. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:348-355 [Conf]
  61. Guizhen Yang, Saikat Mukherjee, Wenfang Tan, I. V. Ramakrishnan, Hasan Davulcu
    On the Power of Semantic Partitioning of Web Documents. [Citation Graph (0, 0)][DBLP]
    IIWeb, 2003, pp:39-44 [Conf]
  62. I. V. Ramakrishnan, Peter J. Varman
    Modular Matrix Multiplication on a Linear Array. [Citation Graph (0, 0)][DBLP]
    ISCA, 1984, pp:232-238 [Conf]
  63. Nikeeta Julasana, Akshat Khandelwal, Anupama Lolage, Prabhdeep Singh, Priyanka Vasudevan, Hasan Davulcu, I. V. Ramakrishnan
    WinAgent: a system for creating and executing personal information assistants using a web browser. [Citation Graph (0, 0)][DBLP]
    Intelligent User Interfaces, 2004, pp:356-357 [Conf]
  64. Jalal Mahmud, Yevgen Borodin, Dipanjan Das, I. V. Ramakrishnan
    Combating information overload in non-visual web access using context. [Citation Graph (0, 0)][DBLP]
    Intelligent User Interfaces, 2007, pp:341-344 [Conf]
  65. Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1992, pp:335-344 [Conf]
  66. R. C. Sekar, I. V. Ramakrishnan
    Programming in Equational Logic: Beyond Strong Sequentiality [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:230-241 [Conf]
  67. Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan
    Justification Based on Program Transformation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:158-159 [Conf]
  68. R. Sekar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Model-Carrying Code (MCC): a new paradigm for mobile-code security. [Citation Graph (0, 0)][DBLP]
    NSPW, 2001, pp:23-30 [Conf]
  69. I. V. Ramakrishnan
    Current Trends in Logic Programming: Prospects and Promises. [Citation Graph (0, 0)][DBLP]
    PADL, 2000, pp:324- [Conf]
  70. C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    A Symbolic Constraint Solving Framework for Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:12-23 [Conf]
  71. Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren
    Logic Programming and Model Checking. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:1-20 [Conf]
  72. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan
    Design and Implementation of Jump Tables for Fast Indexing of Logic Programs [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:133-150 [Conf]
  73. Hasan Davulcu, Guizhen Yang, Michael Kifer, I. V. Ramakrishnan
    Computational Aspects of Resilient Data Extraction from Semistructured Sources. [Citation Graph (0, 18)][DBLP]
    PODS, 2000, pp:136-144 [Conf]
  74. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos F. Sagonas, Steven Skiena, Terrance Swift, David Scott Warren
    Unification Factoring for Efficient Execution of Logic Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:247-258 [Conf]
  75. R. C. Sekar, Prateek Mishra, I. V. Ramakrishnan
    On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    POPL, 1991, pp:37-48 [Conf]
  76. R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan
    Small Domains Spell Fast Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 1990, pp:169-183 [Conf]
  77. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:396-413 [Conf]
  78. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan
    Justifying proofs using memo tables. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:178-189 [Conf]
  79. Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari
    Normalization via Rewrite Closures. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:190-204 [Conf]
  80. R. Ramesh, I. V. Ramakrishnan
    Optimal Speedups for Parallel Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:274-285 [Conf]
  81. R. Ramesh, I. V. Ramakrishnan
    Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:335-347 [Conf]
  82. R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan
    Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:404-418 [Conf]
  83. Hasan Davulcu, Saikat Mukherjee, I. V. Ramakrishnan
    A Clustering Technique for Mining Data from Text Tables. [Citation Graph (0, 0)][DBLP]
    SDM, 2002, pp:- [Conf]
  84. Saikat Mukherjee, Chang Zhao, I. V. Ramakrishnan
    Profiling Protein Families from Partially Aligned Sequences. [Citation Graph (0, 0)][DBLP]
    SDM, 2006, pp:- [Conf]
  85. Saikat Mukherjee, Guizhen Yang, I. V. Ramakrishnan
    Automatic Annotation of Content-Rich HTML Documents: Structural and Semantic Analysis. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2003, pp:533-549 [Conf]
  86. Prashant Choudhari, Hasan Davulcu, Abhishek Joglekar, Akshay More, Saikat Mukherjee, Supriya Patil, I. V. Ramakrishnan
    YellowPager: a tool for ontology-based mining of service directories from web sources. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2002, pp:458- [Conf]
  87. Hasan Davulcu, Saikat Mukherjee, Arvind Seth, I. V. Ramakrishnan
    CuTeX: a system for extracting data from text tables. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2002, pp:457- [Conf]
  88. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Terrance Swift
    Optimizing Clause Resolution: Beyond Unification Factoring. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:194-208 [Conf]
  89. Rakesh M. Verma, I. V. Ramakrishnan
    Some Complexity Theoretic Aspects of AC Rewriting. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:407-420 [Conf]
  90. Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren
    Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:74-88 [Conf]
  91. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Verification of Parameterized Systems Using Logic Program Transformations. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:172-187 [Conf]
  92. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Tabulation-based Induction Proofs with Application to Automated Verification. [Citation Graph (0, 0)][DBLP]
    TAPD, 1998, pp:83-88 [Conf]
  93. Leo Bachmair, Ta Chen, I. V. Ramakrishnan
    Associative-Commutative Discrimination Nets. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:61-74 [Conf]
  94. Gurdip Singh, Scott A. Smolka, I. V. Ramakrishnan
    Distributed Algorithms for Tree Pattern Matching. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:92-107 [Conf]
  95. Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan
    CTR-S: a logic for specifying contracts in semantic web services. [Citation Graph (0, 0)][DBLP]
    WWW (Alternate Track Papers & Posters), 2004, pp:144-153 [Conf]
  96. Saikat Mukherjee, I. V. Ramakrishnan
    Browsing fatigue in handhelds: semantic bookmarking spells relief. [Citation Graph (0, 0)][DBLP]
    WWW, 2005, pp:593-602 [Conf]
  97. I. V. Ramakrishnan, Amanda Stent, Guizhen Yang
    Hearsay: enabling audio browsing on hypertext content. [Citation Graph (0, 0)][DBLP]
    WWW, 2004, pp:80-89 [Conf]
  98. Zan Sun, Jalal Mahmud, Saikat Mukherjee, I. V. Ramakrishnan
    Model-directed web transactions under constrained modalities. [Citation Graph (0, 0)][DBLP]
    WWW, 2006, pp:447-456 [Conf]
  99. Wei Xu, R. Sekar, I. V. Ramakrishnan, V. N. Venkatakrishnan
    An approach for realizing privacy-preserving web-based services. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:1014-1015 [Conf]
  100. Abhik Roychoudhury, I. V. Ramakrishnan
    Inductively Verifying Invariant Properties of Parameterized Systems. [Citation Graph (0, 0)][DBLP]
    Autom. Softw. Eng., 2004, v:11, n:2, pp:101-139 [Journal]
  101. Hasan Davulcu, Srinivas Vadrevu, Saravanakumar Nagarajan, I. V. Ramakrishnan
    OntoMiner: Bootstrapping and Populating Ontologies from Domain-Specific Web Sites. [Citation Graph (0, 0)][DBLP]
    IEEE Intelligent Systems, 2003, v:18, n:5, pp:24-33 [Journal]
  102. P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
    Approximate Algorithms for the Knapsack Problem on Parallel Computers [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:91, n:2, pp:155-171 [Journal]
  103. R. C. Sekar, I. V. Ramakrishnan
    Programming in Equational Logic: Beyond Strong Sequentiality [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:1, pp:78-109 [Journal]
  104. Rakesh M. Verma, I. V. Ramakrishnan
    Tight Complexity Bounds for Term Matching Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:33-69 [Journal]
  105. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:387-403 [Journal]
  106. Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan
    Computing Dominators in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:4, pp:217-221 [Journal]
  107. Shaunak Pawagi, I. V. Ramakrishnan
    An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:5, pp:223-229 [Journal]
  108. R. Ramesh, I. V. Ramakrishnan
    Nonlinear Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:2, pp:295-316 [Journal]
  109. R. C. Sekar, I. V. Ramakrishnan, Prateek Mishra
    On the power and limitations of strictness analysis. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:505-525 [Journal]
  110. Hai-Feng Guo, Miao Liu, Partha S. Roop, C. R. Ramakrishnan, I. V. Ramakrishnan
    Precise specification matching for adaptive reuse in embedded systems. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2007, v:5, n:2, pp:333-355 [Journal]
  111. Owen Kaser, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    EQUALS - A Fast Parallel Implementation of a Lazy Language. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:2, pp:183-217 [Journal]
  112. I. V. Ramakrishnan, Prasad Rao, Konstantinos F. Sagonas, Terrance Swift, David Scott Warren
    Efficient Access Mechanisms for Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:38, n:1, pp:31-54 [Journal]
  113. R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
    Term Matching on Parallel Computers. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1989, v:6, n:3, pp:213-228 [Journal]
  114. R. Ramesh, I. V. Ramakrishnan, David Scott Warren
    Automata-Driven Indexing of Prolog Clauses. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1995, v:23, n:2, pp:151-202 [Journal]
  115. R. Ramesh, I. V. Ramakrishnan
    Parallel Tree Pattern Matching. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:4, pp:485-501 [Journal]
  116. R. C. Sekar, R. Ramesh, I. V. Ramakrishnan
    Adaptive Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1207-1234 [Journal]
  117. Ta Chen, I. V. Ramakrishnan, R. Ramesh
    Multistage Indexing for Speeding Prolog Executions. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1994, v:24, n:12, pp:1097-1119 [Journal]
  118. Rajiv Gupta, Alessandro Zorat, I. V. Ramakrishnan
    Reconfigurable Multipipelines for Vector Supercomputers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:9, pp:1297-1307 [Journal]
  119. I. V. Ramakrishnan, Donald S. Fussell, Abraham Silberschatz
    Mapping Homogeneous Graphs on Linear Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:3, pp:189-209 [Journal]
  120. I. V. Ramakrishnan, Peter J. Varman
    Modular Matrix Multiplication on a Linear Array. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:11, pp:952-958 [Journal]
  121. Peter J. Varman, I. V. Ramakrishnan
    Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:11, pp:989-996 [Journal]
  122. Peter J. Varman, I. V. Ramakrishnan
    Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:2, pp:278-283 [Journal]
  123. Peter J. Varman, I. V. Ramakrishnan, Donald S. Fussell
    A Robust Matrix-Multiplication Array. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:10, pp:919-922 [Journal]
  124. R. Ramesh, I. V. Ramakrishnan, R. C. Sekar
    Automata-driven efficient subterm unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:187-223 [Journal]
  125. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    An unfold/fold transformation framework for definite logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2004, v:26, n:3, pp:464-509 [Journal]
  126. R. C. Sekar, I. V. Ramakrishnan
    Fast Strictness Analysis Based on Demand Propagation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1995, v:17, n:6, pp:896-937 [Journal]
  127. I. V. Ramakrishnan, James C. Browne
    A Paradigm for the Design of Parallel Algorithms with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1983, v:9, n:4, pp:411-415 [Journal]
  128. Yevgen Borodin, Jalal Mahmud, Asad Ahmed, I. V. Ramakrishnan
    WebVAT: Web Page Visualization and Analysis Tool. [Citation Graph (0, 0)][DBLP]
    ICWE, 2007, pp:516-520 [Conf]
  129. Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan
    Context browsing with mobiles - when less is more. [Citation Graph (0, 0)][DBLP]
    MobiSys, 2007, pp:3-15 [Conf]
  130. Chang Zhao, Jalal Mahmud, I. V. Ramakrishnan, Subramanyam Swaminathan
    Computing Statistical Profiles of Active Sites in Proteins. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]
  131. Zan Sun, Amanda Stent, I. V. Ramakrishnan
    Dialog generation for voice browsing. [Citation Graph (0, 0)][DBLP]
    W4A, 2006, pp:49-56 [Conf]
  132. Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan, Amanda Stent
    The HearSay non-visual web browser. [Citation Graph (0, 0)][DBLP]
    W4A, 2007, pp:128-129 [Conf]
  133. Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan
    Csurf: a context-driven non-visual web-browser. [Citation Graph (0, 0)][DBLP]
    WWW, 2007, pp:31-40 [Conf]
  134. Zan Sun, Jalal Mahmud, I. V. Ramakrishnan, Saikat Mukherjee
    Model-directed Web transactions under constrained modalities. [Citation Graph (0, 0)][DBLP]
    TWEB, 2007, v:1, n:3, pp:- [Journal]

  135. What's new?: making web page updates accessible. [Citation Graph (, )][DBLP]


  136. Security policy analysis using deductive spreadsheets. [Citation Graph (, )][DBLP]


  137. A General Approach for Partitioning Web Page Content Based on Geometric and Style Information. [Citation Graph (, )][DBLP]


  138. Assistive browser for conducting web transactions. [Citation Graph (, )][DBLP]


  139. Exploiting Structured Reference Data for Unsupervised Text Segmentation with Conditional Random Fields. [Citation Graph (, )][DBLP]


  140. Improving Accessibility of Transaction-centric Web Objects. [Citation Graph (, )][DBLP]


  141. A methodology for in-network evaluation of integrated logical-statistical models. [Citation Graph (, )][DBLP]


  142. TeleWeb: accessible service for web browsing via phone. [Citation Graph (, )][DBLP]


  143. Towards one world web with HearSay3. [Citation Graph (, )][DBLP]


  144. Automated construction of web accessibility models from transaction click-streams. [Citation Graph (, )][DBLP]


  145. Hearsay: a new generation context-driven multi-modal assistive web browser. [Citation Graph (, )][DBLP]


  146. Bridging the Web Accessibility Divide. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.023secs
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