default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. R. Ramakrishnan 0001
Cartic R. Ramakrishnan
Person information
- affiliation: Stony Brook University, Department of Computer Science, ony Brook, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i12]Xiaojie Fan, Caitao Zhan, Himanshu Gupta, C. R. Ramakrishnan:
Optimized Distribution of Entanglement Graph States in Quantum Networks. CoRR abs/2405.00222 (2024)- [i11]Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan:
Distributed Quantum Computation with Minimum Circuit Execution Time over Quantum Networks. CoRR abs/2405.07499 (2024) - 2023
- [c79]Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan:
Generation and Distribution of GHZ States in Quantum Networks. QCE 2023: 1120-1131 - 2022
- [c78]Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan:
Distribution of Quantum Circuits Over General Quantum Networks. QCE 2022: 415-425 - [c77]Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan, Ertai Luo:
Pre-Distribution of Entanglements in Quantum Networks. QCE 2022: 426-436 - [i10]Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan, Ertai Luo:
Pre-Distribution of Entanglements in Quantum Networks. CoRR abs/2205.04036 (2022) - [i9]Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan:
Distribution of Quantum Circuits Over General Quantum Networks. CoRR abs/2206.06437 (2022) - 2021
- [c76]Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan:
Efficient Distribution of Quantum Circuits. DISC 2021: 41:1-41:20 - [i8]Mohammad Ghaderibaneh, Caitao Zhan, Himanshu Gupta, C. R. Ramakrishnan:
Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees. CoRR abs/2112.11002 (2021)
2010 – 2019
- 2019
- [c75]Sarthak Ghosh, C. R. Ramakrishnan:
Optimizing Value of Information Over an Infinite Time Horizon. ICTAI 2019: 690-696 - [c74]Sarthak Ghosh, C. R. Ramakrishnan:
Value of Information in Probabilistic Logic Programs. ICLP Technical Communications 2019: 71-84 - 2018
- [j21]Arun Nampally, Timothy Zhang, C. R. Ramakrishnan:
Constraint-Based Inference in Probabilistic Logic Programs. Theory Pract. Log. Program. 18(3-4): 638-655 (2018) - [c73]Andrey Gorlin, C. R. Ramakrishnan:
Separable GPL: Decidable Model Checking with More Non-Determinism. CONCUR 2018: 36:1-36:16 - [p2]C. R. Ramakrishnan:
State-space search with tabled logic programs. Declarative Logic Programming 2018: 427-472 - [i7]Arun Nampally, Timothy Zhang, C. R. Ramakrishnan:
Constraint-Based Inference in Probabilistic Logic Programs. CoRR abs/1804.10237 (2018) - 2017
- [c72]Sarthak Ghosh, C. R. Ramakrishnan:
Optimal Value of Information in Dynamic Bayesian Networks. ICTAI 2017: 16-23 - 2016
- [j20]Ezio Bartocci
, C. R. Ramakrishnan:
Preface of the special issue on Model Checking of Software - Selected papers of the 20th International SPIN Symposium on Model Checking of Software. Int. J. Softw. Tools Technol. Transf. 18(4): 355-357 (2016) - [c71]Arun Nampally, C. R. Ramakrishnan:
Inference in Probabilistic Logic Programs Using Lifted Explanations. ICLP (Technical Communications) 2016: 15:1-15:15 - [i6]Andrey Gorlin, C. R. Ramakrishnan:
XPL: An extended probabilistic logic for probabilistic transition systems. CoRR abs/1604.06118 (2016) - [i5]Arun Nampally, C. R. Ramakrishnan:
Inference in Probabilistic Logic Programs using Lifted Explanations. CoRR abs/1608.05763 (2016) - 2015
- [c70]Arun Nampally, C. R. Ramakrishnan:
Constraint-Based Inference in Probabilistic Logic Programs. PLP@ICLP 2015: 46-56 - 2014
- [c69]Radu Grosu, Doron A. Peled, C. R. Ramakrishnan, Scott A. Smolka, Scott D. Stoller, Junxing Yang:
Compositional Branching-Time Measurements. FPS@ETAPS 2014: 118-128 - [c68]Radu Grosu, Doron A. Peled, C. R. Ramakrishnan, Scott A. Smolka, Scott D. Stoller, Junxing Yang:
Using Statistical Model Checking for Measuring Systems. ISoLA (2) 2014: 223-238 - [i4]Arun Nampally, C. R. Ramakrishnan:
Adaptive MCMC-Based Inference in Probabilistic Logic Programs. CoRR abs/1403.6036 (2014) - 2013
- [e3]Ezio Bartocci, C. R. Ramakrishnan:
Model Checking Software - 20th International Symposium, SPIN 2013, Stony Brook, NY, USA, July 8-9, 2013. Proceedings. Lecture Notes in Computer Science 7976, Springer 2013, ISBN 978-3-642-39175-0 [contents] - 2012
- [j19]Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan:
Inference in probabilistic logic programs with continuous random variables. Theory Pract. Log. Program. 12(4-5): 505-523 (2012) - [j18]Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka:
Model checking with probabilistic tabled logic programming. Theory Pract. Log. Program. 12(4-5): 681-700 (2012) - [i3]Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan:
Parameter Learning in PRISM Programs with Continuous Random Variables. CoRR abs/1203.4287 (2012) - [i2]Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka:
Model Checking with Probabilistic Tabled Logic Programming. CoRR abs/1204.4736 (2012) - 2011
- [j17]Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C. R. Ramakrishnan:
Symbolic reachability analysis for parameterized administrative role-based access control. Comput. Secur. 30(2-3): 148-164 (2011) - [j16]Amit Sasturkar, Ping Yang, Scott D. Stoller, C. R. Ramakrishnan:
Policy analysis for Administrative Role-Based Access Control. Theor. Comput. Sci. 412(44): 6208-6234 (2011) - [c67]Ezio Bartocci, Radu Grosu, Panagiotis Katsaros, C. R. Ramakrishnan, Scott A. Smolka:
Model Repair for Probabilistic Systems. TACAS 2011: 326-340 - [i1]Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan:
Inference in Probabilistic Logic Programs with Continuous Random Variables. CoRR abs/1112.2681 (2011) - 2010
- [j15]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka:
A process calculus for Mobile Ad Hoc Networks. Sci. Comput. Program. 75(6): 440-469 (2010)
2000 – 2009
- 2009
- [c66]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka:
Query-Based Model Checking of Ad Hoc Network Protocols. CONCUR 2009: 603-619 - [c65]Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C. R. Ramakrishnan:
Symbolic reachability analysis for parameterized administrative role based access control. SACMAT 2009: 165-174 - [c64]Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan, C. R. Ramakrishnan:
Automated construction of web accessibility models from transaction click-streams. WWW 2009: 871-880 - 2008
- [c63]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka:
A Process Calculus for Mobile Ad Hoc Networks. COORDINATION 2008: 296-314 - [c62]Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R. Ramakrishnan, Scott A. Smolka:
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks. HASE 2008: 362-370 - [c61]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 - [e2]C. R. Ramakrishnan, Jakob Rehof:
Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings. Lecture Notes in Computer Science 4963, Springer 2008, ISBN 978-3-540-78799-0 [contents] - 2007
- [j14]Hai-Feng Guo, Miao Liu, Partha S. Roop, C. R. Ramakrishnan, I. V. Ramakrishnan:
Precise specification matching for adaptive reuse in embedded systems. J. Appl. Log. 5(2): 333-355 (2007) - [j13]C. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren:
XcelLog: a deductive spreadsheet system. Knowl. Eng. Rev. 22(3): 269-279 (2007) - [c60]Anu Singh, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott D. Stoller, David Scott Warren:
Security policy analysis using deductive spreadsheets. FMSE 2007: 42-50 - [c59]Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, Mikhail I. Gofman:
Efficient policy analysis for administrative role based access control. CCS 2007: 445-455 - [c58]Beata Sarna-Starosta, C. R. Ramakrishnan:
Compiling Constraint Handling Rules for Efficient Tabled Evaluation. PADL 2007: 170-184 - 2006
- [j12]Samik Basu, C. R. Ramakrishnan:
Compositional analysis for verification of parameterized systems. Theor. Comput. Sci. 354(2): 211-229 (2006) - [c57]Amit Sasturkar, Ping Yang, Scott D. Stoller, C. R. Ramakrishnan:
Policy Analysis for Administrative Role Based Access Control. CSFW 2006: 124-138 - [c56]Diptikalyan Saha, C. R. Ramakrishnan:
A Local Algorithm for Incremental Evaluation of Tabled Logic Programs. ICLP 2006: 56-71 - [c55]C. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren:
Deductive Spreadsheets Using Tabled Logic Programming. ICLP 2006: 391-405 - [c54]Diptikalyan Saha, C. R. Ramakrishnan:
Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs. PADL 2006: 215-229 - [c53]Ping Yang, Samik Basu, C. R. Ramakrishnan:
Parameterized Verification of pi-Calculus Systems. TACAS 2006: 42-57 - 2005
- [c52]Diptikalyan Saha, C. R. Ramakrishnan:
Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation. ICLP 2005: 235-249 - [c51]Ping Yang, Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka:
A Provably Correct Compiler for Efficient Model Checking of Mobile Processes. PADL 2005: 113-127 - [c50]Diptikalyan Saha, C. R. Ramakrishnan:
Incremental and demand-driven points-to analysis using logic programming. PPDP 2005: 117-128 - 2004
- [j11]Ping Yang, C. R. Ramakrishnan, Scott A. Smolka:
A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution. Int. J. Softw. Tools Technol. Transf. 6(1): 38-66 (2004) - [j10]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) - [j9]Michael Leuschel, Andreas Podelski, C. R. Ramakrishnan, Ulrich Ultes-Nitsche:
Introduction to the Special Issue on Verification and Computational Logic. Theory Pract. Log. Program. 4(5-6): 543-544 (2004) - [c49]L. Robert Pokorny, C. R. Ramakrishnan:
Modeling and Verification of Distributed Autonomous Agents Using Logic Programming. DALT 2004: 148-165 - [c48]Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan:
Online Justification for Tabled Logic Programs. FLOPS 2004: 24-38 - [p1]Abhik Roychoudhury, C. R. Ramakrishnan:
Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems. Program Development in Computational Logic 2004: 261-290 - 2003
- [c47]Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka:
Evidence Explorer: A Tool for Exploring Model-Checking Proofs. CAV 2003: 215-218 - [c46]Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka:
Model Checking and Evidence Exploration. ECBS 2003: 214-223 - [c45]Beata Sarna-Starosta, C. R. Ramakrishnan:
Constraint-Based Model Checking of Data-Independent Systems. ICFEM 2003: 579-598 - [c44]Diptikalyan Saha, C. R. Ramakrishnan:
Incremental Evaluation of Tabled Logic Programs. ICLP 2003: 392-406 - [c43]Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan:
Online Justification for Tabled Logic Programs. ICLP 2003: 500-501 - [c42]Samik Basu, C. R. Ramakrishnan:
Compositional Analysis for Verification of Parameterized Systems. TACAS 2003: 315-330 - [c41]Ping Yang, C. R. Ramakrishnan, Scott A. Smolka:
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution. VMCAI 2003: 116-131 - 2002
- [j8]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) - [j7]C. R. Ramakrishnan, R. Sekar:
Model-Based Analysis of Configuration Vulnerabilities. J. Comput. Secur. 10(1/2): 189-209 (2002) - [c40]Yifei Dong, Beata Sarna-Starosta, C. R. Ramakrishnan, Scott A. Smolka:
Vacuity Checking in the Modal Mu-Calculus. AMAST 2002: 147-162 - [c39]Giridhar Pemmasani, C. R. Ramakrishnan, I. V. Ramakrishnan:
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. ICLP 2002: 100-114 - [c38]Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan:
Justification Based on Program Transformation. LOPSTR 2002: 158-159 - [c37]Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan:
Resource-Constrained Model Checking of Recursive Programs. TACAS 2002: 236-250 - [e1]Shriram Krishnamurthi, C. R. Ramakrishnan:
Practical Aspects of Declarative Languages, 4th International Symposium, PADL 2002, Portland, OR, USA, January 19-20, 2002, Proceedings. Lecture Notes in Computer Science 2257, Springer 2002, ISBN 3-540-43092-X [contents] - 2001
- [c36]Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan:
Speculative Beats Conservative Justification. ICLP 2001: 150-165 - [c35]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 - [c34]K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka:
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. ICLP 2001: 227-241 - [c33]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 - [c32]C. R. Ramakrishnan:
A Model Checker for Value-Passing Mu-Calculus Using Logic Programming. PADL 2001: 1-13 - 2000
- [j6]C. R. Ramakrishnan:
Tabled logic programming for verification and program analysis. ACM SIGSOFT Softw. Eng. Notes 25(1): 73 (2000) - [j5]C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, David Scott Warren:
Specification and evaluation of logic-based model checking. ACM SIGSOFT Softw. Eng. Notes 25(1): 73-74 (2000) - [c31]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 - [c30]C. R. Ramakrishnan:
Verification Using Tabled Logic Programming. CONCUR 2000: 89-91 - [c29]Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan:
Justifying proofs using memo tables. PPDP 2000: 178-189 - [c28]Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka:
Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. RTSS 2000: 175-184 - [c27]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 - [c26]Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka:
Real-Time Verification Techniques for Untimed Systems. MTCS 2000: 258-272
1990 – 1999
- 1999
- [c25]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 - [c24]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 - [c23]Yifei Dong, C. R. Ramakrishnan:
An Optimizing Compiler for Efficient Model Checking. FORTE 1999: 241-256 - [c22]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 - [c21]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 - [c20]Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari:
Normalization via Rewrite Closures. RTA 1999: 190-204 - [c19]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 - 1998
- [j4]Owen Kaser, C. R. Ramakrishnan:
Evaluating Inlining Techniques. Comput. Lang. 24(2): 55-72 (1998) - [c18]Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, R. Sekar:
A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. ICCL 1998: 196-205 - [c17]Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan:
On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. IJCSLP 1998: 310-324 - [c16]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 - [c15]Hasan Davulcu, Michael Kifer, C. R. Ramakrishnan, I. V. Ramakrishnan:
Logic Based Modeling and Analysis of Workflows. PODS 1998: 25-33 - [c14]Xinxin Liu, C. R. Ramakrishnan, Scott A. Smolka:
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract). TACAS 1998: 5-19 - [c13]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
- [j3]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) - [c12]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 - 1996
- [j2]Steven Dawson, C. R. Ramakrishnan, Steven Skiena, Terrance Swift:
Principles and Practice of Unification Factoring. ACM Trans. Program. Lang. Syst. 18(5): 528-563 (1996) - [c11]Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan:
Subsumption Algorithms Based on Search Trees. CAAP 1996: 135-148 - [c10]Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan:
A Thread in Time Saves Tabling Time. JICSLP 1996: 112-126 - [c9]Steven Dawson, C. R. Ramakrishnan, David Scott Warren:
Practical Program Analysis Using General Purpose Logic Programming Systems - A Case Study. PLDI 1996: 117-126 - 1995
- [c8]C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar:
A Symbolic Constraint Solving Framework for Analysis of Logic Programs. PEPM 1995: 12-23 - [c7]Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan:
Design and Implementation of Jump Tables for Fast Indexing of Logic Programs. PLILP 1995: 133-150 - [c6]Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos Sagonas, Steven Skiena, Terrance Swift, David Scott Warren:
Unification Factoring for Efficient Execution of Logic Programs. POPL 1995: 247-258 - [c5]Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Terrance Swift:
Optimizing Clause Resolution: Beyond Unification Factoring. ILPS 1995: 194-208 - 1994
- [c4]R. Sekar, Yow-Jian Lin, C. R. Ramakrishnan:
Modelling techniques for evolving distributed applications. FORTE 1994: 461-476 - [c3]Owen Kaser, C. R. Ramakrishnan, R. C. Sekar:
A High Performance Runtime System for Parallel Evaluation of Lazy Languages. PASCO 1994: 234-243 - 1993
- [j1]Owen Kaser, C. R. Ramakrishnan, Shaunak Pawagi:
On the Conversion of Indirect to Direct Recursion. LOPLAS 2(1-4): 151-164 (1993) - [c2]Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar:
Extracting Determinacy in Logic Programs. ICLP 1993: 424-438 - 1992
- [c1]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