default search action
R. Ramesh 0001
Person information
- affiliation: University of Texas at Dallas, Department of Computer Science, TX, USA
- affiliation (former): Texas Instruments Inc., Dallas, TX, USA
- affiliation (former): State University of New York at Stony Brook, Department of Computer Science, NY, USA
Other persons with the same name
- R. Ramesh — disambiguation page
- R. Ramesh 0002 — State University of New York at Buffalo, Jacobs School of Management, NY, USA
- R. Ramesh 0003 — SASTRA University, Department of ECE, Thanjavur, India
- R. Ramesh 0004
— Saveetha Engineering College, Department of Electronics and Communication Engineering, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
- [j8]R. Ramesh, I. V. Ramakrishnan, R. C. Sekar:
Automata-driven efficient subterm unification. Theor. Comput. Sci. 254(1-2): 187-223 (2001)
1990 – 1999
- 1997
- [j7]R. Ramesh, Weidong Chen:
Implementation of Tabled Evaluation with Delaying in Prolog. IEEE Trans. Knowl. Data Eng. 9(4): 559-574 (1997) - 1995
- [j6]R. Ramesh, I. V. Ramakrishnan, David Scott Warren:
Automata-Driven Indexing of Prolog Clauses. J. Log. Program. 23(2): 151-202 (1995) - [j5]R. C. Sekar, R. Ramesh, I. V. Ramakrishnan:
Adaptive Pattern Matching. SIAM J. Comput. 24(6): 1207-1234 (1995) - 1994
- [j4]Ta Chen, I. V. Ramakrishnan, R. Ramesh:
Multistage Indexing for Speeding Prolog Executions. Softw. Pract. Exp. 24(12): 1097-1119 (1994) - [c10]R. Ramesh, I. V. Ramakrishnan, R. C. Sekar:
Automata-Driven Efficient Subterm Unification. FSTTCS 1994: 288-299 - [c9]R. Ramesh, Weidong Chen:
A Portable Method of Integrating SLG Resolution into Prolog Systems. ILPS 1994: 618-632 - 1992
- [j3]R. Ramesh, I. V. Ramakrishnan:
Nonlinear Pattern Matching in Trees. J. ACM 39(2): 295-316 (1992) - [c8]R. C. Sekar, R. Ramesh, I. V. Ramakrishnan:
Adaptive Pattern Matching. ICALP 1992: 247-260 - [c7]Ta Chen, I. V. Ramakrishnan, R. Ramesh:
Multistage Indexing Algorithms for Speeding Prolog Execution. JICSLP 1992: 639-653 - [c6]S. Nagaraj, N. Padmini, N. S. Nagaraj, R. Ramesh, V. Sachidanand:
WCS - A CAD Solution for Worst Case Performance Analysis of Integrated Circuits. VLSI Design 1992: 297-302 - 1991
- [c5]R. Ramesh, I. V. Ramakrishnan:
Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems. RTA 1991: 335-347 - 1990
- [j2]R. Ramesh, I. V. Ramakrishnan:
Parallel Tree Pattern Matching. J. Symb. Comput. 9(4): 485-501 (1990) - [c4]R. Ramesh, I. V. Ramakrishnan, David Scott Warren:
Automata-Driven Indexing of Prolog Clauses. POPL 1990: 281-291
1980 – 1989
- 1989
- [j1]R. Ramesh, Rakesh M. Verma
Term Matching on Parallel Computers. J. Log. Program. 6(3): 213-228 (1989) - 1988
- [c3]R. Ramesh, I. V. Ramakrishnan:
Nonlinear Pattern Matching in Trees. ICALP 1988: 473-488 - 1987
- [c2]R. Ramesh, Rakesh M. Verma
Term Matching on Parallel Computers. ICALP 1987: 336-346 - [c1]R. Ramesh, I. V. Ramakrishnan:
Optimal Speedups for Parallel Pattern Matching in Trees. RTA 1987: 274-285
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: