| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. I. V. Ramakrishnan 96 Hasan Davulcu , Saikat Mukherjee , I. V. Ramakrishnan: Extraction Techniques for Mining Services from Web Sources. ICDM 2002 : 601-604 95 Giridhar Pemmasani , C. R. Ramakrishnan , I. V. Ramakrishnan: Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. ICLP 2002 : 100-114 94 Hai-Feng Guo , C. R. Ramakrishnan , I. V. Ramakrishnan: Justification Based on Program Transformation. LOPSTR 2002 : 158-159 93 Hasan Davulcu , Saikat Mukherjee , Arvind Seth , I. V. Ramakrishnan: CuTeX: a system for extracting data from text tables. SIGIR 2002 : 457 92 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. SIGIR 2002 : 458 91 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. International Journal of Foundations of Computer Science 13 (3): 387-403 (2002) 90 I. V. Ramakrishnan: Practical Aspects of Declarative Languages, Third International Symposium, PADL 2001, Las Vegas, Nevada, March 11-12, 2001, Proceedings. Springer 2001 89 Abhik Roychoudhury , I. V. Ramakrishnan: Automated Inductive Verification of Parameterized Protocols. CAV 2001 : 25-37 88 I. V. Ramakrishnan, R. C. Sekar , Andrei Voronkov : Term Indexing. Handbook of Automated Reasoning 2001 : 1853-1964 87 Hai-Feng Guo , C. R. Ramakrishnan , I. V. Ramakrishnan: Speculative Beats Conservative Justification. ICLP 2001 : 150-165 86 Samik Basu , Madhavan Mukund , C. R. Ramakrishnan , I. V. Ramakrishnan, Rakesh M. Verma : Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. ICLP 2001 : 166-180 85 R. Ramesh , I. V. Ramakrishnan, R. C. Sekar : Automata-driven efficient subterm unification. TCS 254 (1-2): 187-223 (2001) 84 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. CAV 2000 : 576-580 83 Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan: Design and Implementation of the Physical Layer in WebBases: The XRover Experience. Computational Logic 2000 : 1094-1105 82 Leo Bachmair , I. V. Ramakrishnan, Ashish Tiwari , Laurent Vigneron : Congruence Closure Modulo Associativity and Commutativity. FroCos 2000 : 245-259 81 I. V. Ramakrishnan: Current Trends in Logic Programming: Prospects and Promises. PADL 2000 : 324 80 Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan: Computational Aspects of Resilient Data Extraction from Semistructured Sources. PODS 2000 : 136-144 79 Abhik Roychoudhury , C. R. Ramakrishnan , I. V. Ramakrishnan: Justifying proofs using memo tables. PPDP 2000 : 178-189 78 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka : Verification of Parameterized Systems Using Logic Program Transformations. TACAS 2000 : 172-187 77 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. ASIAN 1999 : 322-333 76 Ernie Johnson , C. R. Ramakrishnan , I. V. Ramakrishnan, Prasad Rao : A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. Fuji International Symposium on Functional and Logic Programming 1999 : 284-300 75 Abhik Roychoudhury , K. Narayan Kumar , I. V. Ramakrishnan: Generalized Unfold/fold Transformation Systems for Normal Logic Programs. ICLP 1999 : 616 74 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. PPDP 1999 : 396-413 73 Hasan Davulcu , Michael Kifer , L. Robert Pokorny , C. R. Ramakrishnan , I. V. Ramakrishnan, Steven Dawson : Modeling and Analysis of Interactions in Virtual Enterprises. RIDE 1999 : 12-18 72 Leo Bachmair , C. R. Ramakrishnan , I. V. Ramakrishnan, Ashish Tiwari : Normalization via Rewrite Closures. RTA 1999 : 190-204 71 Hasan Davulcu , Juliana Freire , Michael Kifer , I. V. Ramakrishnan: A Layered Architecture for Querying Dynamic Web Content. SIGMOD Conference 1999 : 491-502 70 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. TACAS 1999 : 74-88 69 I. V. Ramakrishnan, Prasad Rao , Konstantinos F. Sagonas , Terrance Swift , David Scott Warren : Efficient Access Mechanisms for Tabled Logic Programs. JLP 38 (1): 31-54 (1999) 68 Abhik Roychoudhury , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. ICCL 1998 : 196-205 67 Prasad Rao , C. R. Ramakrishnan , I. V. Ramakrishnan: On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. IJCSLP 1998 : 310-324 66 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. PLILP/ALP 1998 : 1-20 65 Hasan Davulcu , Michael Kifer , C. R. Ramakrishnan , I. V. Ramakrishnan: Logic Based Modeling and Analysis of Workflows. PODS 1998 : 25-33 64 Y. S. Ramakrishna , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka , Terrance Swift , David Scott Warren : Efficient Model Checking Using Tabled Resolution. CAV 1997 : 143-154 63 R. C. Sekar , I. V. Ramakrishnan, Prateek Mishra : On the power and limitations of strictness analysis. JACM 44 (3): 505-525 (1997) 62 Owen Kaser , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : EQUALS - A Fast Parallel Implementation of a Lazy Language. Journal of Functional Programming 7 (2): 183-217 (1997) 61 Leo Bachmair , Ta Chen , C. R. Ramakrishnan , I. V. Ramakrishnan: Subsumption Algorithms Based on Search Trees. CAAP 1996 : 135-148 60 Prasad Rao , C. R. Ramakrishnan , I. V. Ramakrishnan: A Thread in Time Saves Tabling Time. JICSLP 1996 : 112-126 59 I. V. Ramakrishnan, Prasad Rao , Konstantinos F. Sagonas , Terrance Swift , David Scott Warren : Efficient Tabling Mechanisms for Logic Programs. ICLP 1995 : 697-711 58 Leo Bachmair , Ta Chen , I. V. Ramakrishnan, Siva Anantharaman , Jacques Chabin : Experiments with Associative-Commutative Discrimination Nets. IJCAI 1995 : 348-355 57 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan, Terrance Swift : Optimizing Clause Resolution: Beyond Unification Factoring. ILPS 1995 : 194-208 56 C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : A Symbolic Constraint Solving Framework for Analysis of Logic Programs. PEPM 1995 : 12-23 55 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan: Design and Implementation of Jump Tables for Fast Indexing of Logic Programs. PLILP 1995 : 133-150 54 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. POPL 1995 : 247-258 53 R. Ramesh , I. V. Ramakrishnan, David Scott Warren : Automata-Driven Indexing of Prolog Clauses. JLP 23 (2): 151-202 (1995) 52 R. C. Sekar , R. Ramesh , I. V. Ramakrishnan: Adaptive Pattern Matching. SIAM J. Comput. 24 (6): 1207-1234 (1995) 51 R. C. Sekar , I. V. Ramakrishnan: Fast Strictness Analysis Based on Demand Propagation. TOPLAS 17 (6): 896-937 (1995) 50 R. Ramesh , I. V. Ramakrishnan, R. C. Sekar : Automata-Driven Efficient Subterm Unification. FSTTCS 1994 : 288-299 49 Prasad Rao , I. V. Ramakrishnan, Terrance Swift , David Scott Warren : Dynamic Argument Reduction for In-memory Data Queries. Workshop on Deductive Databases and Logic Programming 1994 : 117-129 48 Ta Chen , I. V. Ramakrishnan, R. Ramesh : Multistage Indexing for Speeding Prolog Executions. Software - Practice and Experience 24 (12): 1097-1119 (1994) 47 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : Extracting Determinacy in Logic Programs. ICLP 1993 : 424-438 46 Leo Bachmair , Ta Chen , I. V. Ramakrishnan: Associative-Commutative Discrimination Nets. TAPSOFT 1993 : 61-74 45 R. C. Sekar , I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality. Information and Computation 104 (1): 78-109 (1993) 44 R. C. Sekar , I. V. Ramakrishnan: Programming with Equations: A Framework for Lazy Parallel Evaluation. CADE 1992 : 618-632 43 R. C. Sekar , R. Ramesh , I. V. Ramakrishnan: Adaptive Pattern Matching. ICALP 1992 : 247-260 42 Ta Chen , I. V. Ramakrishnan, R. Ramesh : Multistage Indexing Algorithms for Speeding Prolog Execution. JICSLP 1992 : 639-653 41 Owen Kaser , Shaunak Pawagi , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. LISP and Functional Programming 1992 : 335-344 40 Rakesh M. Verma , I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching Problems. Information and Computation 101 (1): 33-69 (1992) 39 R. Ramesh , I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees. JACM 39 (2): 295-316 (1992) 38 R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan: On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. POPL 1991 : 37-48 37 R. Ramesh , I. V. Ramakrishnan: Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems. RTA 1991 : 335-347 36 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Approximate Algorithms for the Knapsack Problem on Parallel Computers. Information and Computation 91 (2): 155-171 (1991) 35 Rakesh M. Verma , I. V. Ramakrishnan: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. ICALP 1990 : 370-385 34 R. C. Sekar , I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality. LICS 1990 : 230-241 33 R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan: Small Domains Spell Fast Strictness Analysis. POPL 1990 : 169-183 32 R. Ramesh , I. V. Ramakrishnan, David Scott Warren : Automata-Driven Indexing of Prolog Clauses. POPL 1990 : 281-291 31 R. Ramesh , I. V. Ramakrishnan: Parallel Tree Pattern Matching. JSC 9 (4): 485-501 (1990) 30 R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan: Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. RTA 1989 : 404-418 29 Rakesh M. Verma , I. V. Ramakrishnan: Some Complexity Theoretic Aspects of AC Rewriting. STACS 1989 : 407-420 28 Peter J. Varman , I. V. Ramakrishnan: Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays. IEEE Transactions on Computers 38 (2): 278-283 (1989) 27 Rajiv Gupta , Alessandro Zorat , I. V. Ramakrishnan: Reconfigurable Multipipelines for Vector Supercomputers. IEEE Transactions on Computers 38 (9): 1297-1307 (1989) 26 R. Ramesh , Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: Term Matching on Parallel Computers. JLP 6 (3): 213-228 (1989) 25 Rakesh M. Verma , I. V. Ramakrishnan: Optimal Time Bounds for Parallel Term Matching. CADE 1988 : 694-703 24 R. Ramesh , I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees. ICALP 1988 : 473-488 23 R. Ramesh , Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: Term Matching on Parallel Computers. ICALP 1987 : 336-346 22 R. Ramesh , I. V. Ramakrishnan: Optimal Speedups for Parallel Pattern Matching in Trees. RTA 1987 : 274-285 21 Gurdip Singh , Scott A. Smolka , I. V. Ramakrishnan: Distributed Algorithms for Tree Pattern Matching. WDAG 1987 : 92-107 20 Shaunak Pawagi , P. S. Gopalakrishnan , I. V. Ramakrishnan: Computing Dominators in Parallel. Information Processing Letters 24 (4): 217-221 (1987) 19 Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: An Efficient Parallel Algorithm for Term Matching. FSTTCS 1986 : 504-518 18 Peter J. Varman , I. V. Ramakrishnan: A Fault-Tolerant VLSI Matrix Multiplier. ICPP 1986 : 351-357 17 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Parallel Approximate Algorithms for the 0-1 Knapsack Problem. ICPP 1986 : 444-451 16 Shaunak Pawagi , P. S. Gopalakrishnan , I. V. Ramakrishnan: A Parallel Algorithm for Dominators. ICPP 1986 : 877-879 15 Peter J. Varman , I. V. Ramakrishnan: Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. IEEE Transactions on Computers 35 (11): 989-996 (1986) 14 I. V. Ramakrishnan, Donald S. Fussell , Abraham Silberschatz : Mapping Homogeneous Graphs on Linear Arrays. IEEE Transactions on Computers 35 (3): 189-209 (1986) 13 Shaunak Pawagi , I. V. Ramakrishnan: An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. Information Processing Letters 22 (5): 223-229 (1986) 12 Deepak D. Sherlekar , Shaunak Pawagi , I. V. Ramakrishnan: O(1) Parallel Time Incremental Graph Algorithms. FSTTCS 1985 : 477-495 11 Peter J. Varman , I. V. Ramakrishnan: On Matrix Multiplication Using Array Processors. ICALP 1985 : 487-496 10 Shaunak Pawagi , I. V. Ramakrishnan: Parallel Updates of Graph Properties in Logarithmic Time. ICPP 1985 : 186-193 9 I. V. Ramakrishnan, Peter J. Varman : An Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. ICPP 1985 : 376-383 8 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Computing Tree Functions on Mesh-Connected Computers. ICPP 1985 : 703-710 7 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : An Efficient Connected Components Algorithm on a Mesh-Connected Computer. ICPP 1985 : 711-714 6 I. V. Ramakrishnan: On Mapping Cube Graphs onto VLSI Arrays. FSTTCS 1984 : 296-316 5 I. V. Ramakrishnan, Peter J. Varman : Modular Matrix Multiplication on a Linear Array. ISCA 1984 : 232-238 4 Peter J. Varman , I. V. Ramakrishnan, Donald S. Fussell : A Robust Matrix-Multiplication Array. IEEE Transactions on Computers 33 (10): 919-922 (1984) 3 I. V. Ramakrishnan, Peter J. Varman : Modular Matrix Multiplication on a Linear Array. IEEE Transactions on Computers 33 (11): 952-958 (1984) 2 I. V. Ramakrishnan, Donald S. Fussell , Abraham Silberschatz : On Mapping Homogeneous Graphs on a Linear Array-Processor Model. ICPP 1983 : 440-447 1 I. V. Ramakrishnan, James C. Browne : A Paradigm for the Design of Parallel Algorithms with Applications. TSE 9 (4): 411-415 (1983)  DiSC'03 © 2003 Association for Computing Machinery |
