## Technical Reports in 1998

| << 1997 | 1998 | 1999 >> | TR Main |

- [1998-1]
- Completeness of Negation as Finite Failure: A Resolution Proof

*V Chandru, S Roy and R Subramanyam* - [1998-2]
- Mathematical Programming Embeddings of Logic

*V S Borkar, V Chandru, D Micciancio and S K Millter* - [1998-4]
- Integer Programming

*V Chandru and M R Rao* - [1998-6]
- An Enhanced Co-scheduling Method using Reduced MS-State Diagrams

*R Govindarajan, N S S Narasimha Rao, Erik R Altman and Guang R Gao* - [1998-7]
- Finding Minimum Cost Derivation Trees for Regular Tree Grammars

*Maya Madhavan and Priti Shankar* - [1998-8]
- Dynamic Vectorization: The Potential of Exploiting Repetitive Control Flow

*Sriram Vajapeyam, Tulika Mitra, P J Joseph and Arghya Mukherjee* - [1998-9]
- An Overview of Homology Searching for Biological Sequences Databases

*Pethuru Raj*

| << 1997 | 1998 | 1999 >> | TR Main |

Problems ? Contact techrep@csa.iisc.ernet.in

Valid HTML 4.01! [Updated at 2009-10-22T06:42Z]