 | 
| |
Online DBLP entries are available for I. V. Ramakrishnan and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
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
-
Hasan
Davulcu,
Michael
Kifer,
C.
R. Ramakrishnan, I. V. Ramakrishnan: Logic Based Modeling and Analysis
of Workflows.
PODS
1998: 25-33
-
Y.
S. Ramakrishnan,
C.
R. Ramakrishnan, I. V. Ramakrishnan,
Scott
A. Smolka,
Terrance
Swift,
David
Scott Warren: Efficient Model Checking Using Tabled Resolution.
CAV
1997: 143-154
-
R.
C. Sekar, I. V. Ramakrishnan,
Prateek
Mishra: On the Power and Limitations of Strictness Analysis.
JACM
44(3): 505-525 (1997)
-
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)
-
Leo
Bachmair,
Ta
Chen,
C.
R. Ramakrishnan, I. V. Ramakrishnan: Subsumption Algorithms Based on
Search Trees.
CAAP
1996: 135-148
-
Prasad
Rao,
C.
R. Ramakrishnan, I. V. Ramakrishnan: A Thread in Time Saves Tabling
Time.
JICSLP
1996: 112-126
-
I. V. Ramakrishnan,
Prasad
Rao,
Konstantinos
F. Sagonas,
Terrance
Swift,
David
Scott Warren: Efficient Tabling Mechanisms for Logic Programs.
ICLP
1995: 697-711
-
Steven
Dawson,
C.
R. Ramakrishnan, I. V. Ramakrishnan,
Terrance
Swift: Optimizing Clause Resolution: Beyond Unification Factoring.
ILPS
1995: 194-208
-
C.
R. Ramakrishnan, I. V. Ramakrishnan,
R.
C. Sekar: A Symbolic Constraint Solving Framework for Analysis of Logic
Programs.
PEPM
1995: 12-23
-
Steven
Dawson,
C.
R. Ramakrishnan, I. V. Ramakrishnan: Design and Implementation of Jump
Tables for Fast Indexing of Logic Programs.
PLILP
1995: 133-150
-
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
-
R.
Ramesh, I. V. Ramakrishnan,
David
Scott Warren: Automata-Driven Indexing of Prolog Clauses.
JLP
23(2): 151-202 (1995)
-
R.
C. Sekar,
R.
Ramesh, I. V. Ramakrishnan: Adaptive Pattern Matching.
SIAM
J. Comput. 24(6): 1207-1234 (1995)
-
R.
C. Sekar, I. V. Ramakrishnan: Fast Strictness Analysis Based on Demand
Propagation.
TOPLAS
17(6): 896-937 (1995)
-
R.
Ramesh, I. V. Ramakrishnan,
R.
C. Sekar: Automata-Driven Efficient Subterm Unification.
FSTTCS
1994: 288-299
-
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
-
Ta
Chen, I. V. Ramakrishnan,
R.
Ramesh: Multistage Indexing for Speeding Prolog Executions.
SP&E
24(12): 1097-1119, (1994)
-
Steven
Dawson,
C.
R. Ramakrishnan, I. V. Ramakrishnan,
R.
C. Sekar: Extracting Determinacy in Logic Programs.
ICLP
1993: 424-438
-
Leo
Bachmair,
Ta
Chen, I. V. Ramakrishnan: Associative-Commutative Discrimination Nets.
TAPSOFT
1993: 61-74
-
R.
C. Sekar, I. V. Ramakrishnan: Programming in Equational Logic: Beyond
Strong Sequentiality.
Information
and Computation 104(1): 78-109 (1993)
-
R.
C. Sekar, I. V. Ramakrishnan: Programming with Equations: A Framework
for Lazy Parallel Evaluation.
CADE
1992: 618-632
-
R.
C. Sekar,
R.
Ramesh, I. V. Ramakrishnan: Adaptive Pattern Matching.
ICALP
1992: 247-260
-
Ta
Chen, I. V. Ramakrishnan,
R.
Ramesh: Multistage Indexing Algorithms for Speeding Prolog Execution.
JICSLP
1992: 639-653
-
Rakesh
M. Verma, I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching
Problems.
Information
and Computation 101(1): 33-69 (1992)
-
R.
Ramesh, I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees.
JACM
39(2): 295-316 (1992)
-
R.
C. Sekar,
Prateek
Mishra, I. V. Ramakrishnan: On the Power and Limitation of Strictness
Analysis Based on Abstract Interpretation.
POPL
1991: 37-48
-
R.
Ramesh, I. V. Ramakrishnan: Incremental Techniques for Efficient Normalization
of Nonlinear Rewrite Systems.
RTA
1991: 335-347
-
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)
-
Rakesh
M. Verma, I. V. Ramakrishnan: Nonoblivious Normalization Algorithms
for Nonlinear Rewrite Systems.
ICALP
1990: 370-385
-
R.
C. Sekar, I. V. Ramakrishnan: Programming in Equational Logic: Beyond
Strong Sequentiality.
LICS
1990: 230-241
-
R.
C. Sekar,
Shaunak
Pawagi, I. V. Ramakrishnan: Small Domains Spell Fast Strictness Analysis.
POPL
1990: 169-183
-
R.
Ramesh, I. V. Ramakrishnan,
David
Scott Warren: Automata-Driven Indexing of Prolog Clauses.
POPL
1990: 281-291
-
R.
Ramesh, I. V. Ramakrishnan: Parallel Tree Pattern Matching.
JSC
9(4): 485-501 (1990)
-
R.
C. Sekar,
Shaunak
Pawagi, I. V. Ramakrishnan: Transforming Strongly Sequential Rewrite
Systems with Constructors for Efficient parallel Execution.
RTA
1989: 404-418
-
Rakesh
M. Verma, I. V. Ramakrishnan: Some Complexity Theoretic Aspects of
AC Rewriting.
STACS
1989: 407-420
-
Peter
J. Varman, I. V. Ramakrishnan: Optimal Matrix Multiplication on Fault-Tolerant
VLSI Arrays.
IEEE
Transactions on Computers 38(2): 278-283 (1989)
-
Rajiv
Gupta,
Alessandro
Zorat, I. V. Ramakrishnan: Reconfigurable Multipipelines for Vector
Supercomputers.
IEEE
Transactions on Computers 38(9): 1297-1307 (1989)
-
R.
Ramesch,
Rakesh
M. Verma,
T.
Krishnaprasad, I. V. Ramakrishnan: Term Matching on Parallel Computers.
JLP
6(3): 213-228 (1989)
-
Rakesh
M. Verma, I. V. Ramakrishnan: Optimal Time Bounds for Parallel Term
Matching.
CADE
1988: 694-703
-
R.
Ramesh, I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees.
ICALP
1988: 473-488
-
R.
Ramesh,
Rakesh
M. Verma,
T.
Krishnaprasad, I. V. Ramakrishnan: Term Matching on Parallel Computers.
ICALP
1987: 336-346
-
R.
Ramesh, I. V. Ramakrishnan: Optimal Speedups for Parallel Pattern Matching
in Trees.
RTA
1987: 274-285
-
Gurdip
Singh,
Scott
A. Smolka, I. V. Ramakrishnan: Distributed Algorithms for Tree Pattern
Matching.
WDAG
1987: 92-107
-
Shaunak
Pawagi,
P.
S. Gopalakrishnan, I. V. Ramakrishnan: Computing Dominators in Parallel.
IPL
24(4): 217-221 (1987)
-
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)
-
I. V. Ramakrishnan,
Donald
S. Fussell,
Abraham
Silberschatz: Mapping Homogeneous Graphs on Linear Arrays.
IEEE
Transactions on Computers 35(3): 189-209 (1986)
-
Shaunak
Pawagi, I. V. Ramakrishnan: An O(log n) Algorithm for Parallel Update
of Minimum Spanning Trees.
IPL
22(5): 223-229 (1986)
-
Deepak
D. Sherlekar,
Shaunak
Pawagi, I. V. Ramakrishnan: O(1) Parallel Time Incremental Graph Algorithms.
FSTTCS
1985: 477-495
-
Peter
J. Varman, I. V. Ramakrishnan: On Matrix Multiplication Using Array
Processors.
ICALP
1985: 487-496
-
I. V. Ramakrishnan: On Mapping Cube Graphs onto VLSI Arrays.
FSTTCS
1984: 296-316
-
I. V. Ramakrishnan,
Peter
J. Varman: Modular Matrix Multiplication on a Linear Array.
ISCA
1984: 232-238
-
Peter
J. Varman, I. V. Ramakrishnan,
Donald
S. Fussell: A Robust Matrix-Multiplication Array.
IEEE
Transactions on Computers 33(10): 919-922 (1984)
-
I. V. Ramakrishnan,
Peter
J. Varman: Modular Matrix Multiplication on a Linear Array.
IEEE
Transactions on Computers 33(11): 952-958 (1984)
-
I. V. Ramakrishnan,
James
C. Browne: A Paradigm for the Design of Parallel Algorithms with Applications.
TSE
9(4): 411-415 (1983)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
