2009 |
148 | EE | Yevgen Borodin,
Glenn Dausch,
I. V. Ramakrishnan:
TeleWeb: accessible service for web browsing via phone.
W4A 2009: 96-97 |
147 | EE | Jalal Mahmud,
Yevgen Borodin,
I. V. Ramakrishnan,
C. R. Ramakrishnan:
Automated construction of web accessibility models from transaction click-streams.
WWW 2009: 871-880 |
146 | EE | I. V. Ramakrishnan,
Jalal Mahmud,
Yevgen Borodin,
Muhammad Asiful Islam,
Faisal Ahmed:
Bridging the Web Accessibility Divide.
Electr. Notes Theor. Comput. Sci. 235: 107-124 (2009) |
2008 |
145 | EE | Yevgen Borodin,
Jeffrey P. Bigham,
Rohit Raman,
I. V. Ramakrishnan:
What's new?: making web page updates accessible.
ASSETS 2008: 145-152 |
144 | EE | Jalal Mahmud,
Yevgen Borodin,
I. V. Ramakrishnan:
Assistive browser for conducting web transactions.
IUI 2008: 365-368 |
143 | EE | Chang Zhao,
Jalal Mahmud,
I. V. Ramakrishnan:
Exploiting Structured Reference Data for Unsupervised Text Segmentation with Conditional Random Fields.
SDM 2008: 420-431 |
142 | EE | Anu Singh,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
David Scott Warren,
Jennifer L. Wong:
A methodology for in-network evaluation of integrated logical-statistical models.
SenSys 2008: 197-210 |
141 | EE | Yevgen Borodin,
Jeffrey P. Bigham,
Amanda Stent,
I. V. Ramakrishnan:
Towards one world web with HearSay3.
W4A 2008: 130-131 |
140 | EE | Saikat Mukherjee,
I. V. Ramakrishnan:
Automated Semantic Analysis of Schematic Data.
World Wide Web 11(4): 427-464 (2008) |
2007 |
139 | EE | Anu Singh,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott D. Stoller,
David Scott Warren:
Security policy analysis using deductive spreadsheets.
FMSE 2007: 42-50 |
138 | EE | Radu Grosu,
S. Mitra,
Pei Ye,
Emilia Entcheva,
I. V. Ramakrishnan,
Scott A. Smolka:
Learning Cycle-Linear Hybrid Automata for Excitable Cells.
HSCC 2007: 245-258 |
137 | EE | Hai-Feng Guo,
Jalal Mahmud,
Yevgen Borodin,
Amanda Stent,
I. V. Ramakrishnan:
A General Approach for Partitioning Web Page Content Based on Geometric and Style Information.
ICDAR 2007: 929-933 |
136 | EE | Yevgen Borodin,
Jalal Mahmud,
Asad Ahmed,
I. V. Ramakrishnan:
WebVAT: Web Page Visualization and Analysis Tool.
ICWE 2007: 516-520 |
135 | EE | Jalal Mahmud,
Yevgen Borodin,
Dipanjan Das,
I. V. Ramakrishnan:
Combating information overload in non-visual web access using context.
IUI 2007: 341-344 |
134 | EE | Yevgen Borodin,
Jalal Mahmud,
I. V. Ramakrishnan:
Context browsing with mobiles - when less is more.
MobiSys 2007: 3-15 |
133 | EE | Chang Zhao,
Jalal Mahmud,
I. V. Ramakrishnan,
Subramanyam Swaminathan:
Computing Statistical Profiles of Active Sites in Proteins.
SDM 2007 |
132 | EE | Yevgen Borodin,
Jalal Mahmud,
I. V. Ramakrishnan,
Amanda Stent:
The HearSay non-visual web browser.
W4A 2007: 128-129 |
131 | EE | Jalal Mahmud,
Yevgen Borodin,
I. V. Ramakrishnan:
Csurf: a context-driven non-visual web-browser.
WWW 2007: 31-40 |
130 | EE | Hai-Feng Guo,
Miao Liu,
Partha S. Roop,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Precise specification matching for adaptive reuse in embedded systems.
J. Applied Logic 5(2): 333-355 (2007) |
129 | EE | C. R. Ramakrishnan,
I. V. Ramakrishnan,
David Scott Warren:
XcelLog: a deductive spreadsheet system.
Knowledge Eng. Review 22(3): 269-279 (2007) |
128 | EE | Zan Sun,
Jalal Mahmud,
I. V. Ramakrishnan,
Saikat Mukherjee:
Model-directed Web transactions under constrained modalities.
TWEB 1(3): (2007) |
2006 |
127 | EE | Jalal Mahmud,
Yevgen Borodin,
Dipanjan Das,
I. V. Ramakrishnan:
Improving non-visual web access using context.
ASSETS 2006: 273-274 |
126 | EE | C. R. Ramakrishnan,
I. V. Ramakrishnan,
David Scott Warren:
Deductive Spreadsheets Using Tabled Logic Programming.
ICLP 2006: 391-405 |
125 | EE | Wei Xu,
V. N. Venkatakrishnan,
R. Sekar,
I. V. Ramakrishnan:
A Framework for Building Privacy-Conscious Composite Web Services.
ICWS 2006: 655-662 |
124 | EE | Saikat Mukherjee,
Chang Zhao,
I. V. Ramakrishnan:
Profiling Protein Families from Partially Aligned Sequences.
SDM 2006 |
123 | EE | Zan Sun,
Amanda Stent,
I. V. Ramakrishnan:
Dialog generation for voice browsing.
W4A 2006: 49-56 |
122 | EE | Zan Sun,
Jalal Mahmud,
Saikat Mukherjee,
I. V. Ramakrishnan:
Model-directed web transactions under constrained modalities.
WWW 2006: 447-456 |
2005 |
121 | EE | 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.
ASSETS 2005: 220-221 |
120 | EE | 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.
DILS 2005: 19-30 |
119 | EE | Saikat Mukherjee,
I. V. Ramakrishnan,
Amarjeet Singh:
Bootstrapping Semantic Annotations for Content-Rich HTML Documents.
ICDE 2005: 583-593 |
118 | EE | Saikat Mukherjee,
I. V. Ramakrishnan:
Browsing fatigue in handhelds: semantic bookmarking spells relief.
WWW 2005: 593-602 |
117 | EE | Wei Xu,
R. Sekar,
I. V. Ramakrishnan,
V. N. Venkatakrishnan:
An approach for realizing privacy-preserving web-based services.
WWW (Special interest tracks and posters) 2005: 1014-1015 |
2004 |
116 | EE | Saikat Mukherjee,
I. V. Ramakrishnan,
Michael Kifer:
Semantic bookmarking for non-visual web access.
ASSETS 2004: 185-192 |
115 | EE | Zoé Lacroix,
Kaushal Parekh,
Hasan Davulcu,
I. V. Ramakrishnan,
Nikeeta Julasana:
Automating the Biological Data Collection Process with Agents.
CSB 2004: 489-490 |
114 | EE | Saikat Mukherjee,
I. V. Ramakrishnan:
Taming the Unstructured: Creating Structured Content from Partially Labeled Schematic Text Sequences.
CoopIS/DOA/ODBASE (2) 2004: 909-926 |
113 | EE | Hasan Davulcu,
Zoé Lacroix,
Kaushal Parekh,
I. V. Ramakrishnan,
Nikeeta Julasana:
Exploiting Agent and Database Technologies for Biological Data Collection.
DEXA Workshops 2004: 376-381 |
112 | EE | Giridhar Pemmasani,
Hai-Feng Guo,
Yifei Dong,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Online Justification for Tabled Logic Programs.
FLOPS 2004: 24-38 |
111 | EE | 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.
IUI 2004: 356-357 |
110 | EE | I. V. Ramakrishnan,
Amanda Stent,
Guizhen Yang:
Hearsay: enabling audio browsing on hypertext content.
WWW 2004: 80-89 |
109 | EE | Hasan Davulcu,
Michael Kifer,
I. V. Ramakrishnan:
CTR-S: a logic for specifying contracts in semantic web services.
WWW (Alternate Track Papers & Posters) 2004: 144-153 |
108 | EE | Abhik Roychoudhury,
K. Narayan Kumar,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
An unfold/fold transformation framework for definite logic programs.
ACM Trans. Program. Lang. Syst. 26(3): 464-509 (2004) |
107 | EE | Abhik Roychoudhury,
I. V. Ramakrishnan:
Inductively Verifying Invariant Properties of Parameterized Systems.
Autom. Softw. Eng. 11(2): 101-139 (2004) |
2003 |
106 | EE | Guizhen Yang,
I. V. Ramakrishnan,
Michael Kifer:
On the complexity of schema inference from web pages in the presence of nullable data attributes.
CIKM 2003: 224-231 |
105 | EE | Saikat Mukherjee,
Guizhen Yang,
Wenfang Tan,
I. V. Ramakrishnan:
Automatic Discovery of Semantic Structures in HTML Documents.
ICDAR 2003: 245-249 |
104 | EE | Guizhen Yang,
Saikat Mukherjee,
I. V. Ramakrishnan:
On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources.
ICDM 2003: 395-402 |
103 | EE | Giridhar Pemmasani,
Hai-Feng Guo,
Yifei Dong,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Online Justification for Tabled Logic Programs.
ICLP 2003: 500-501 |
102 | EE | Guizhen Yang,
Saikat Mukherjee,
Wenfang Tan,
I. V. Ramakrishnan,
Hasan Davulcu:
On the Power of Semantic Partitioning of Web Documents.
IIWeb 2003: 39-44 |
101 | EE | Saikat Mukherjee,
Guizhen Yang,
I. V. Ramakrishnan:
Automatic Annotation of Content-Rich HTML Documents: Structural and Semantic Analysis.
International Semantic Web Conference 2003: 533-549 |
100 | EE | Hasan Davulcu,
Srinivas Vadrevu,
Saravanakumar Nagarajan,
I. V. Ramakrishnan:
OntoMiner: Bootstrapping and Populating Ontologies from Domain-Specific Web Sites.
IEEE Intelligent Systems 18(5): 24-33 (2003) |
2002 |
99 | EE | Hasan Davulcu,
Saikat Mukherjee,
I. V. Ramakrishnan:
Extraction Techniques for Mining Services from Web Sources.
ICDM 2002: 601-604 |
98 | EE | Giridhar Pemmasani,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints.
ICLP 2002: 100-114 |
97 | EE | Hai-Feng Guo,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Justification Based on Program Transformation.
LOPSTR 2002: 158-159 |
96 | EE | Hasan Davulcu,
Saikat Mukherjee,
I. V. Ramakrishnan:
A Clustering Technique for Mining Data from Text Tables.
SDM 2002 |
95 | EE | Hasan Davulcu,
Saikat Mukherjee,
Arvind Seth,
I. V. Ramakrishnan:
CuTeX: a system for extracting data from text tables.
SIGIR 2002: 457 |
94 | EE | 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 |
93 | EE | Abhik Roychoudhury,
K. Narayan Kumar,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.
Int. J. Found. Comput. Sci. 13(3): 387-403 (2002) |
2001 |
92 | | I. V. Ramakrishnan:
Practical Aspects of Declarative Languages, Third International Symposium, PADL 2001, Las Vegas, Nevada, March 11-12, 2001, Proceedings
Springer 2001 |
91 | EE | Abhik Roychoudhury,
I. V. Ramakrishnan:
Automated Inductive Verification of Parameterized Protocols.
CAV 2001: 25-37 |
90 | EE | Hai-Feng Guo,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Speculative Beats Conservative Justification.
ICLP 2001: 150-165 |
89 | EE | 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 |
88 | EE | R. Sekar,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka:
Model-Carrying Code (MCC): a new paradigm for mobile-code security.
NSPW 2001: 23-30 |
87 | | I. V. Ramakrishnan,
R. C. Sekar,
Andrei Voronkov:
Term Indexing.
Handbook of Automated Reasoning 2001: 1853-1964 |
86 | EE | R. Ramesh,
I. V. Ramakrishnan,
R. C. Sekar:
Automata-driven efficient subterm unification.
Theor. Comput. Sci. 254(1-2): 187-223 (2001) |
2000 |
85 | | 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 |
84 | EE | 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 |
83 | | Leo Bachmair,
I. V. Ramakrishnan,
Ashish Tiwari,
Laurent Vigneron:
Congruence Closure Modulo Associativity and Commutativity.
FroCos 2000: 245-259 |
82 | EE | I. V. Ramakrishnan:
Current Trends in Logic Programming: Prospects and Promises.
PADL 2000: 324 |
81 | EE | Hasan Davulcu,
Guizhen Yang,
Michael Kifer,
I. V. Ramakrishnan:
Computational Aspects of Resilient Data Extraction from Semistructured Sources.
PODS 2000: 136-144 |
80 | EE | Abhik Roychoudhury,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Justifying proofs using memo tables.
PPDP 2000: 178-189 |
79 | EE | 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 |
1999 |
78 | EE | 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 |
77 | | 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 |
76 | | Abhik Roychoudhury,
K. Narayan Kumar,
I. V. Ramakrishnan:
Generalized Unfold/fold Transformation Systems for Normal Logic Programs.
ICLP 1999: 616 |
75 | | 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 |
74 | EE | 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 |
73 | EE | Leo Bachmair,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Ashish Tiwari:
Normalization via Rewrite Closures.
RTA 1999: 190-204 |
72 | EE | Hasan Davulcu,
Juliana Freire,
Michael Kifer,
I. V. Ramakrishnan:
A Layered Architecture for Querying Dynamic Web Content.
SIGMOD Conference 1999: 491-502 |
71 | EE | 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 |
70 | | I. V. Ramakrishnan,
Prasad Rao,
Konstantinos F. Sagonas,
Terrance Swift,
David Scott Warren:
Efficient Access Mechanisms for Tabled Logic Programs.
J. Log. Program. 38(1): 31-54 (1999) |
1998 |
69 | EE | 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 |
68 | | Prasad Rao,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution.
IJCSLP 1998: 310-324 |
67 | EE | 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 |
66 | EE | Hasan Davulcu,
Michael Kifer,
C. R. Ramakrishnan,
I. V. Ramakrishnan:
Logic Based Modeling and Analysis of Workflows.
PODS 1998: 25-33 |
65 | EE | Abhik Roychoudhury,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka:
Tabulation-based Induction Proofs with Application to Automated Verification.
TAPD 1998: 83-88 |
1997 |
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 | EE | R. C. Sekar,
I. V. Ramakrishnan,
Prateek Mishra:
On the power and limitations of strictness analysis.
J. ACM 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.
J. Funct. Program. 7(2): 183-217 (1997) |
1996 |
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 |
1995 |
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 | EE | R. C. Sekar,
I. V. Ramakrishnan:
Fast Strictness Analysis Based on Demand Propagation.
ACM Trans. Program. Lang. Syst. 17(6): 896-937 (1995) |
52 | | R. Ramesh,
I. V. Ramakrishnan,
David Scott Warren:
Automata-Driven Indexing of Prolog Clauses.
J. Log. Program. 23(2): 151-202 (1995) |
51 | | R. C. Sekar,
R. Ramesh,
I. V. Ramakrishnan:
Adaptive Pattern Matching.
SIAM J. Comput. 24(6): 1207-1234 (1995) |
1994 |
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.
Softw., Pract. Exper. 24(12): 1097-1119 (1994) |
1993 |
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
Inf. Comput. 104(1): 78-109 (1993) |
1992 |
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 | EE | 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
Inf. Comput. 101(1): 33-69 (1992) |
39 | EE | R. Ramesh,
I. V. Ramakrishnan:
Nonlinear Pattern Matching in Trees.
J. ACM 39(2): 295-316 (1992) |
1991 |
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
Inf. Comput. 91(2): 155-171 (1991) |
1990 |
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.
J. Symb. Comput. 9(4): 485-501 (1990) |
1989 |
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 Trans. Computers 38(2): 278-283 (1989) |
27 | | Rajiv Gupta,
Alessandro Zorat,
I. V. Ramakrishnan:
Reconfigurable Multipipelines for Vector Supercomputers.
IEEE Trans. Computers 38(9): 1297-1307 (1989) |
26 | | R. Ramesh,
Rakesh M. Verma,
Krishnaprasad Thirunarayan,
I. V. Ramakrishnan:
Term Matching on Parallel Computers.
J. Log. Program. 6(3): 213-228 (1989) |
1988 |
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 |
1987 |
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.
Inf. Process. Lett. 24(4): 217-221 (1987) |
1986 |
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 Trans. Computers 35(11): 989-996 (1986) |
14 | | I. V. Ramakrishnan,
Donald S. Fussell,
Abraham Silberschatz:
Mapping Homogeneous Graphs on Linear Arrays.
IEEE Trans. Computers 35(3): 189-209 (1986) |
13 | | Shaunak Pawagi,
I. V. Ramakrishnan:
An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees.
Inf. Process. Lett. 22(5): 223-229 (1986) |
1985 |
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 |
1984 |
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 Trans. Computers 33(10): 919-922 (1984) |
3 | | I. V. Ramakrishnan,
Peter J. Varman:
Modular Matrix Multiplication on a Linear Array.
IEEE Trans. Computers 33(11): 952-958 (1984) |
1983 |
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.
IEEE Trans. Software Eng. 9(4): 411-415 (1983) |