• Algorithms and lower bounds for graph connectivity and covering  

      Narayanaswamy, N S
      Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ...
    • An Environment for Automatic Generation of Code Optimizers 

      Paleri, Vineeth Kumar (Indian Institute of Science, 2005-03-11)
      Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ...
    • A Parallelizing Compiler for Fortran 

      Janaki, S (Indian Institute of Science, 2005-03-09)
      With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and ...
    • Performance evaluation of backbone technologies in distributed systems 

      Rajiv, M
      The backbone of a distributed system is the interior-most part of the communication network which carries traffic generated from several sources. Applications such as accessing the Internet, multimedia, etc., demand a lot ...
    • TriSL: A Software Architecture Description Language and Environment 

      Lakshminarayanan, R (Indian Institute of Science, 2005-03-14)
      As the size and complexity of a software system increases, the design problem goes beyond the algorithms and data structures of the computation. Designing and specifying the overall system structure -- or software architecture ...
    • Wavelets for volume graphics 

      Lakshmish, M R
      In recent years, there has been a shift in the paradigm from surface-based graphics to volume graphics. Volume graphics uses a three-dimensional unit cube, known as a voxel, as its primitive, whereas surface-based graphics ...