Technical Reports in 1989

| 1989 | 1990 >> | TR Main |

[1989-1]
An Efficient Algorithm for the Polygon Containment Problem for Monotone Polygons
S P Pal, B Dasgupta and C E Veni Madhavan
[1989-2]
The Structure of Visibility Graphs of Simple Polygons
V Vinay and C E Veni Madhavan
[1989-3]
Conversion of decision tables to programs in a multiprocessor system
V Rajaram
[1989-4]
Fast Parallel Solution of Systems of Linear and Non-linear Circuit Equations on a Multiprocessors System
A Sarala and V Rajaraman
[1989-5]
Decision Tables
V Rajaraman
[1989-6]
A 3-D VLSI Modular Matrix Multiplier
A Sarala and V Rajaraman
[1989-7]
An Efficient Solution for the Collision Detection Problem
S S Keerthi, C Jaishankar and S Ramesh
[1989-8]
A Fast Method for Collision Avoidance for an articulated two link planar robot using Distance Functions
S S Keerthi, Joe Selvaraj
[1989-9]
Structure of Clique Hupergraphs of Chordal Graphs and Subclasses
P Sreenivasa Kumar and C E Veni Madhavan
[1989-10]
Efficient Algorithms for computing two measures of depth of collision between convex polygons
S Sathya Keerthi and K Sridharan
[1989-11]
Solution of Parameterized linear inequalities by fourier elimination and its applications
S S Keerthi and K Sridharan
[1989-12]
A Survey of Some Recent Developments in the Numerical Solution of ODEs
S S Keerthi
[1989-14]
A Fully Distributed Termination Detection Algorithm for an Arbitrary Network
S Haldar and D K Subramanian
[1989-15]
Variable-Based intelligent backtracking
V Rajasekhar and M Narasimha Murthy
[1989-16]
Parallel Heuristics for Euclidean Minimum Steiner Tree Problem
Sanjeev Saxena, P C P Bhatt and V C Prasad
[1989-17]
Dynamic Theory
V Rajaraman
[1989-22]
A Knowledge-based Environment for Clustering
Atul Negi and M Narasimha Murty
[1989-24]
Clustering using Biased Nearest-Neighbor Search
Atul Negi and M Narasimha Murty
[1989-25]
Shell Data Structure for Ray Tracing
B S S Pradhan and Ashish Mukhopadhyay
[1989-26]
Sub-Logarithmic Time Parallel Algorithms for Sorting of Integers
Sanjeev Saxena
[1989-27]
On Parallel Addition
Sanjeev Saxena
[1989-28]
An Optimal Divide and Conquer Algorithm for the Convex Hull Problem in Four or Higher Dimensions
Suresh Jadhav, Sanjay Malhotra and Ashish Mukhopadhyay
[1989-29]
Some Applications of Parallel Computational Geometry and Graph Theory to Planar Routing Algorithms
Sanjeev Saxena, V C Prasad and P C P Bhatt
[1989-30]
An Efficient Parallel Algorithm for Random Sampling
Vijayan Rajan, R K Ghosh and P Gupta

| 1989 | 1990 >> | TR Main |

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

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