Publications by the members of CSE Department :

Filters Type : Member : Area : Lab:

- A New Parallel Algorithm for Solving Sparse Linear Systems.

- A genetic algorithm for the knowledge base partitioning problem.

- A Constant Time Algorithm for Theorem Proving in Propositional Logic on Reconfigurable Meshes.

- A New Modified Gram-schmidt Orthogonal Matrix Factorization Based Algorithm for Parallel Solution of Linear Equations.

K. N. Balasubramanya Murthy, C. Siva Ram Murthy

Appeared in*Parallel Algorithms Appl.*, Vol 6, pp.39-52, 1995. - A note on "task allocation and scheduling models for multiprocessor digital signal processing".

C. S. R. Krishnan, Douglas Antony Louis Piriyakumar, C. Siva Ram Murthy

Appeared in*IEEE Transactions on Signal Processing*, Vol 43, pp.802-805, 1995. - An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph

- Optimal Parallel Algorithms for Path Problems on Planar Graphs.

- An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Appeared in*Nord. J. Comput.*, Vol 2, pp.28-40, 1995. - Feedback vertex set on cocomparability graphs.

- Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.

Saptarshi Mahesh Prabhakarrao, C. Siva Ram Murthy, C. Pandu Rangan

Appeared in*IEICE Transactions*, Vol 78, pp.3-12, 1995. - Parallel Algorithms on Interval Graphs.

- Edge-disjoint paths in permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.59-72, 1995. - A linear algorithms for the two paths problem on permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.147-166, 1995. - Efficient algorithms for minimal disjoint path problems on chordal graphs.

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.119-145, 1995. - Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.

Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan

Appeared in*Parallel Processing Letters*, Vol 5, pp.343-355, 1995. - Weighted Independent Perfect Domination on Cocomparability Graphs.

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg

Appeared in*Discrete Applied Mathematics*, Vol 63, pp.215-222, 1995. - Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang

Appeared in*Inf. Process. Lett.*, Vol 56, pp.165-171, 1995. - Systematic Design of an Algorithm for Biconnected Components.

K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar

Appeared in*Sci. Comput. Program.*, Vol 25, pp.63-77, 1995. - Efficient Parallel Algorithms for Permutation Graphs.

K. Arvind, V. Kamakoti, C. Pandu Rangan

Appeared in*J. Parallel Distrib. Comput.*, Vol 26, pp.116-124, 1995. - Pitch extraction from root cepstrum.

Hema A. Murthy

Appeared in*The 3rd International Conference on Spoken Language Processing, ICSLP 1994, Yokohama, Japan, September 18-22, 1994 (ICSLP 1994)*, Sep 1994. - Edge-Disjoint Paths in Permutation Graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings*, Lecture Notes in Computer Science, Vol 834, pp.208-216, Aug 1994. - Weighted Irredundance of Interval Graphs.

C. Pandu Rangan, Maw-Shang Chang

Appeared in*Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings*, Lecture Notes in Computer Science, Vol 834, pp.567-574, Aug 1994. - Quality of Service Negotiation for Orchestrated, Distributed Mulitmedia Presentation.

S. V. Raghavan, B. Prabhakaran, Satish K. Tripathi

Appeared in*High Performance Networking V, Proceedings of the IFIP TC6/WG6.4 Fifth International Conference on High Performance Networking, Grenoble, France, 27 June - 1 July, 1994*, IFIP Transactions, pp.219-240, Jun 1994. - Planning with Thematic Actions.

Deepak Khemani

Appeared in*Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Chicago, Illinois, USA, June 13-15, 1994*, pp.287-292, Jun 1994. - Reverse scheduling - an effective method for scheduling tasks of parallel programs employing a divide-and-conquer strategy onto multiprocessors.

A. Sreenivas, K. N. Balasubramanya Murthy, C. Siva Ram Murthy

Appeared in*Microprocessors and Microsystems - Embedded Hardware Design*, Vol 18, pp.187-192, 1994. - Generative Networkload Models for a Single Server Environment.

- Example Implementation of Name Services using X.500 Directory.

S. V. Raghavan, R. Sriram

Appeared in*Computer Networks and ISDN Systems*, Vol 26, pp.1425-1436, 1994. - Synchronization Models for Multimedia Presentation with User Participation.

- Static Task Allocation of Concurrent Programs for Distributed Computing Systems with Processor and Resource Heterogeneity.

- Two-sided Elimination Algorithm for Parallel Solution of Linear Equations Using Householder Reductions.

K. N. Balasubramanya Murthy, C. Siva Ram Murthy

Appeared in*Parallel Algorithms Appl.*, Vol 3, pp.287-309, 1994. - Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors.

C. Selvakumar, C. Siva Ram Murthy

Appeared in*IEEE Trans. Parallel Distrib. Syst.*, Vol 5, pp.328-336, 1994. - Parallel Arithmetic Expression Evaluation on Reconfigurable Meshes.

- Parallel Recognition and Parsing on Mesh Connected Computers with Multiple Broadcasting.

- Optimal scheduling of independent jobs in multiprocessor systems.

Paul P. Ignatius, C. Siva Ram Murthy

Appeared in*Microprocessing and Microprogramming*, Vol 40, pp.651-672, 1994. - Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension.

- Efficient Parallel Shuffle Recognition.

Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram

Appeared in*Parallel Processing Letters*, Vol 4, pp.455-463, 1994. - Treewidth of Circular-Arc Graphs.

Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan

Appeared in*SIAM J. Discrete Math.*, Vol 7, pp.647-655, 1994. - A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.

K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston

Appeared in*Inf. Process. Lett.*, Vol 51, pp.121-124, 1994. - Weighted Independent Perfect Domination on Cocomparability Graphs.

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg

Appeared in*Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings*, Lecture Notes in Computer Science, Vol 762, pp.506-514, Dec 1993. - Synchronization Models for Multimedia Presentation with User Participation.

B. Prabhakaran, S. V. Raghavan

Appeared in*Proceedings of the First ACM International Conference on Multimedia '93, Anaheim, CA, USA, August 1-6, 1993.*, pp.157-166, Aug 1993. - Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.

Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan

Appeared in*Algorithms and Data Structures, Third Workshop, WADS '93, Montral, Canada, August 11-13, 1993, Proceedings*, Lecture Notes in Computer Science, Vol 709, pp.131-141, Aug 1993. - A list scheduling anomaly.

S. Selvakumar, C. Siva Ram Murthy

Appeared in*Microprocessors and Microsystems - Embedded Hardware Design*, Vol 17, pp.471-474, 1993. - A constant time algorithm for finding maxima on reconfigurable bus systems using fewer processors.

C. S. R. Krishnan, C. Siva Ram Murthy

Appeared in*Microprocessors and Microsystems - Embedded Hardware Design*, Vol 17, pp.607-610, 1993. - Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.

- Language Classes Defined by Time-Bounded Relativised Cellular Automata.

- A Constant Time Algorithm for Redundancy Elimination in Task Graphs on Processor Arrays with Reconfigurable Bus Systems.

- An efficient heuristic algorithm for mapping parallel programs onto multicomputers.

S. Selvakumar, C. Siva Ram Murthy

Appeared in*Microprocessing and Microprogramming*, Vol 36, pp.83-92, 1993. - Scheduling of precedence-constrained parallel program tasks on multiprocessors.

C. Siva Ram Murthy, K. N. Balasubramanya Murthy, A. Sreenivas

Appeared in*Microprocessing and Microprogramming*, Vol 36, pp.93-104, 1993. - Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.

R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan

Appeared in*Theor. Comput. Sci.*, Vol 115, pp.351-357, 1993. - A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs.

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras