 | 2007 |
|---|
| 19 |       | Rajesh Ingle,
G. Sivakumar:
Tunable Group Key Agreement.
LCN 2007: 1017-1024 |
| 1999 |
|---|
| 18 | | R. Krishnan,
G. Sivakumar,
P. Bhattacharya:
Extracting decision trees from trained neural networks.
Pattern Recognition 32(12): 1999-2009 (1999) |
| 17 | | R. Krishnan,
G. Sivakumar,
P. Bhattacharya:
A search technique for rule extraction from trained neural networks.
Pattern Recognition Letters 20(3): 273-280 (1999) |
| 1998 |
|---|
| 16 | | Deepak Kapur,
G. Sivakumar:
Proving Associative-Communicative Termination Using RPO-Compatible Orderings.
FTP (LNCS Selection) 1998: 39-61 |
| 1997 |
|---|
| 15 |  | S. Ramesh,
G. Sivakumar:
Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings
Springer 1997 |
| 14 | | Deepak Kapur,
G. Sivakumar:
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems.
RTA 1997: 142-156 |
| 1995 |
|---|
| 13 | | Deepak Kapur,
G. Sivakumar:
Maximal Extensions os Simplification Orderings.
FSTTCS 1995: 225-239 |
| 12 | | Deepak Kapur,
G. Sivakumar,
Hantao Zhang:
A Path Ordering for Proving Termination of AC Rewrite Systems.
J. Autom. Reasoning 14(2): 293-316 (1995) |
| 1992 |
|---|
| 11 | | Nachum Dershowitz,
Subrata Mitra,
G. Sivakumar:
Decidable Matching for Convergent Systems (Preliminary Version).
CADE 1992: 589-602 |
| 1991 |
|---|
| 10 | | Subrata Mitra,
G. Sivakumar:
AC-Equation Solving.
FSTTCS 1991: 40-56 |
| 1990 |
|---|
| 9 | | Nachum Dershowitz,
Subrata Mitra,
G. Sivakumar:
Equation Solving in Conditional AC-Theories.
ALP 1990: 283-297 |
| 8 | | S. Ramanathan,
G. Sivakumar:
Rewrite Systems for Protocol Specification and Verification.
FORTE 1990: 79-94 |
| 7 | | Deepak Kapur,
G. Sivakumar,
Hantao Zhang:
A New Method for Proving Termination of AC-Rewrite Systems.
FSTTCS 1990: 133-148 |
| 1988 |
|---|
| 6 | | Nachum Dershowitz,
G. Sivakumar:
Goal-Directed Equation Solving.
AAAI 1988: 166-170 |
| 5 | | Nachum Dershowitz,
Mitsuhiro Okada,
G. Sivakumar:
Canonical Conditional Rewrite Systems.
CADE 1988: 538-549 |
| 1987 |
|---|
| 4 | | Nachum Dershowitz,
Mitsuhiro Okada,
G. Sivakumar:
Confluence of Conditional Rewrite Systems.
CTRS 1987: 31-44 |
| 3 | | Nachum Dershowitz,
G. Sivakumar:
Solving Goals in Equational Languages.
CTRS 1987: 45-55 |
| 1986 |
|---|
| 2 | | Deepak Kapur,
G. Sivakumar,
Hantao Zhang:
RRL: A Rewrite Rule Laboratory.
CADE 1986: 691-692 |
| 1985 |
|---|
| 1 | | Deepak Kapur,
Paliath Narendran,
G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems.
TAPSOFT, Vol.1 1985: 173-187 |
