Publications by the members of CSE Department :

Filters Type : Member : Area : Lab:

- 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.

- A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.

- Efficient Load Information Management for Load Sharing in Distributed Systems.

Atul B. Mahamuni, Timothy A. Gonsalves, Bhaskar Ramamurthi

Appeared in*Computer Networks, Architecture and Applications, Proceedings of the IFIP TC6 Working Conference on Computer Networks, Architecture and Applications, NETWORKS '92, Trivandrum, India, 28-29 October, 1992*, IFIP Transactions, pp.43-54, Oct 1992. - Test Case Generation for Transport Protocols.

S. V. Raghavan, Vaduvur Bharghavan, S. Satish

Appeared in*Information Network and Data Communication, IV, Proceedings of the IFIP TC6 International Conference on Information Network and Data Communication, IV, Espoo, Finland, 16-19 March, 1992*, IFIP Transactions, pp.159-178, Mar 1992. - A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

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

Appeared in*Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, March 1992*, pp.112-115, Mar 1992. - Some results on time-varying and relativised cellular automata.

- An optimal algorithm to solve the all-pair shortest path problem on interval graphs.

- Generalized Vertex Covering in Interval Graphs.

Madhav V. Marathe, R. Ravi 0001, C. Pandu Rangan

Appeared in*Discrete Applied Mathematics*, Vol 39, pp.87-93, 1992. - An O(n log n) algorithm for a maxmin location problem.

C. Pandu Rangan, Ramesh Govindan

Appeared in*Discrete Applied Mathematics*, Vol 36, pp.203-205, 1992. - An Optimal Algorithm for Reconstructing a Binary Tree.

- Relativised Cellular Automata and Complexity Classes.

Meena Mahajan, Kamala Krithivasan

Appeared in*Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings*, Lecture Notes in Computer Science, Vol 560, pp.172-185, Dec 1991. - Synthesizing intonation for speech in hindi.

A. S. Madhukumar, S. Rajendran, C. Chandra Sekhar, B. Yegnanarayana

Appeared in*Second European Conference on Speech Communication and Technology, EUROSPEECH 1991, Genova, Italy, September 24-26, 1991 (EUROSPEECH 1991)*, Sep 1991. - Treewidth of Circular-Arc Graphs (Abstract).

Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan

Appeared in*Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings*, Lecture Notes in Computer Science, Vol 519, pp.41, Aug 1991. - Processing of noisy speech using modified group delay functions.

B. Yegnanarayana, Hema A. Murthy, V. R. Ramachandran

Appeared in*1991 International Conference on Acoustics, Speech, and Signal Processing, ICASSP '91, Toronto, Ontario, Canada, May 14-17, 1991*, pp.945-948, May 1991. - Fastest Path Across Constrained Moving Rectilinear Obstacles.

- Formant extraction from group delay function.

- An efficient algorithm for mapping VLSI circuit simulation programs onto multiprocessors.

- Downloading node programs/data into hypercubes.

- Efficient Reduction for Path Problems on Circular-Arc Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher

Appeared in*BIT*, Vol 31, pp.182-193, 1991. - Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.

- An efficient algorithm for finding a two-pair, and its applications.

Srinivasa Rao Arikati, C. Pandu Rangan

Appeared in*Discrete Applied Mathematics*, Vol 31, pp.71-74, 1991. - On Finding the Minimum Bandwidth of Interval Graphs

- Speech enhancement using group delay functions.

B. Yegnanarayana, Hema A. Murthy, V. R. Ramachandran

Appeared in*The First International Conference on Spoken Language Processing, ICSLP 1990, Kobe, Japan, November 18-22, 1990 (ICSLP 1990)*, Nov 1990. - Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures.

Amitava Datta, Kamala Krithivasan

Appeared in*Proceedings of the 1990 International Conference on Parallel Processing, Urbana-Champaign, IL, USA, August 1990. Volume 3: Algorithms and Applications.*, pp.344-345, Aug 1990. - Parallel Algorithms on Interval Graphs.

G. D. S. Ramkumar, C. Pandu Rangan

Appeared in*Proceedings of the 1990 International Conference on Parallel Processing, Urbana-Champaign, IL, USA, August 1990. Volume 3: Algorithms and Applications.*, pp.72-74, Aug 1990.

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