| << 1989 | 1990 | 1993 >> | TR Main |

- [1990-1]
- Characterizing Weak Visibilty Polygons and Related Problems
*S K Ghosh, A Maheshwari, S P Pal, S Saluja and C E Veni Madhavan* - [1990-2]
- Algorithms for Weak Visibility Polygons
*S P Pal, S K Ghosh and C E Veni Madhavan* - [1990-3]
- A Linear Time Algorithm for Computing The Shortest Line Segment from which a Polygon is Weakly Externally Visible
*Binay K Bhattacharya, Ashish Mukhopadhyay and Godfried T Toussaini* - [1990-4]
- A Linear Time Algorithm for the Smallest Intersection Radius Problem
*Binay K Bhattacharya and Ashish Mukhopadhyay* - [1990-7]
- Optimal Polygon Placement by Translation
*S P Pal, B Dasgupta and C E Veni Madhavan* - [1990-8]
- 2-Separator Chordal Graphs
*P Sreenivasa Kumar and C E Veni Madhavan* - [1990-9]
- A Model for Content Addressable Memory
*S H Sreenivasa and M Narasimha Murty* - [1990-11]
- A Model-Theoretic Approach to Clustering
*V Sridhar and M Narasimha Murty* - [1990-13]
- Learning Defaults: Recognizing Patterns in Beliefs
*V Sridhar and M Narasimha Murty* - [1990-14]
- Belief Revision - An Axiomatic Approach
*V Sridhar and M Narasimha Murty* - [1990-16]
- A Semi-Aggressive Scheduler
*S Haldar* - [1990-17]
- An Efficient Concurrency Control Algorithm for Database Systems
*S Haldar* - [1990-20]
- A Knowledge-based Clustering Approach for Semantic Modelling of Databases
*V Sridhar and M Narasimha Murty*

| << 1989 | 1990 | 1993 >> | TR Main |

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

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