Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Dynamic Argument Reduction for In-memory Data Queries.

P. Rao, I. Ramakrishnan, T. Swift, and D. Warren. Workshop on Deductive Databases and Logic Programming, volume 231 of GMD-Studien, page 117-129. Gesellschaft für Mathematik und Datenverarbeitung MBH, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

I. Steinwart

V. Vaikuntanathan

I. Dudic

Cheng-I Ho University of Stuttgart

D. Inkermann

Other publications of authors with the same name

Generalized Unfold/fold Transformation Systems for Normal Logic Programs.A. Roychoudhury, K. Kumar, and I. Ramakrishnan. ICLP, page 616. MIT Press, (1999)On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution.P. Rao, C. Ramakrishnan, and I. Ramakrishnan. IJCSLP, page 310-324. MIT Press, (1998)Automating the Biological Data Collection Process with Agents.Z. Lacroix, K. Parekh, H. Davulcu, I. Ramakrishnan, and N. Julasana. CSB, page 489-490. IEEE Computer Society, (2004)A Conservative Technique to Improve Deterministic Evaluation of Logic Programs.A. Roychoudhury, C. Ramakrishnan, I. Ramakrishnan, and R. Sekar. ICCL, page 196-205. IEEE Computer Society, (1998)Efficient Access Mechanisms for Tabled Logic Programs.I. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. Warren. J. Log. Program., 38 (1): 31-54 (1999)Automata-driven efficient subterm unification.R. Ramesh, I. Ramakrishnan, and R. Sekar. Theor. Comput. Sci., 254 (1-2): 187-223 (2001)Dialogue Act Modeling for Non-Visual Web Access.V. Ashok, Y. Borodin, S. Stoyanchev, and I. Ramakrishnan. SIGDIAL Conference, page 123-132. The Association for Computer Linguistics, (2014)Optimal Time Bounds for Parallel Term Matching.R. Verma, and I. Ramakrishnan. CADE, volume 310 of Lecture Notes in Computer Science, page 694-703. Springer, (1988)Towards Enabling Blind People to Independently Write on Printed Forms.S. Feiz, S. Billah, V. Ashok, R. Shilkrot, and I. Ramakrishnan. CHI, page 300. ACM, (2019)Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools.Y. Dong, X. Du, Y. Ramakrishna, C. Ramakrishnan, I. Ramakrishnan, S. Smolka, O. Sokolsky, E. Stark, and D. Warren. TACAS, volume 1579 of Lecture Notes in Computer Science, page 74-88. Springer, (1999)