- [2009-1]
- Analysing Message Sequence Graph Specifications
*Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar* - [2009-2]
- Analysing Message Sequence Graph Specifications
*Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar* - [2009-3]
- [2009-4]
- [2009-5]
- A Computational Procedure for General-sum Stochastic Games
*Prasad H. L., S. Bhatnagar, N. Hemachandra* - [2009-7]
- Popular Matchings with variable job capacities
*Telikepalli Kavitha and Meghana Nasre* - [2009-8]
- Conflict-Tolerant Specifications in Temporal Logic
*Sumesh Divakaran, Deepak D'Souza, Raj Mohan M.* - [2009-9]
- Conflict-Tolerant Real-Time Specifications in Metric Temporal Logic
*Sumesh Divakaran, Deepak D'Souza, Raj Mohan M.* - [2007-1]
- Counter-free input-determined timed automata
*Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar* - [2006-1]
- An Adaptive, Energy-efficient Object Cache Architecture
*S.S. Shekhar, Y.N. Srikant* - [2006-2]
- Computing Complete Test Graphs for Hierarchical Systems
*Deepak D'Souza and Madhu Gopinathan* - [2006-3]
- Specification Based Regression Testing Using Explicit State Space Enumeration
*Sujit Kumar Chakraborti and Y.N. Srikant* - [2006-4]
- A Combinatorial Family of LDPC Codes
*K. Murali Krishnan, L. Sunil Chandran, Priti Shankar* - [2006-5]
- On the expressiveness of MTL with past operators
*Pavithra Prabhakar and Deepak D'Souza* - [2006-6]
- Compiler-Assisted Leakage Energy Optimization for Clustered VLIW Architectures
*Rahul Nagpal and Y N Srikant* - [2006-7]
- On continuous timed automata with input-determined guards
*Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar* - [2006-8]
- SPSA Algorithms with Measurement Reuse
*Mohammed Shahid Abdulla and Shalabh Bhatnagar* - [2006-9]
- A Randomized Algorithm for Large Scale SVM classification
*S. Krishnan C. Bhattacharyya R. Hariharan* - [2006-10]
- Field Flow Sensitive Pointer and Escape Analysis for Java as Logic Programs Using SSA
*Prakash Prabhu and Priti Shankar* - [2006-11]
- Flattening Metric Temporal Logic
*Deepak D'Souza, Raj Mohan M. and Pavithra Prabhakar* - [2006-12]
- Partial Flow Sensitivity
*Subhajit Roy and Y.N. Srikant* - [2006-13]
- Computing the Stopping Distance of a Tanner Graph is NP-hard
*K. Murali Krishnan and Priti Shankar* - [2005-1]
- Cache Traffic Optimization
*Anasua Bhowmik and Mohamed Zahran* - [2005-2]
- Design and Implementation of a Concurrent Garbage Collector for Rotor
*Archana Ravindar and Y.N. Srikant* - [2005-3]
- Exact And Approximate Algorithms for ML Decoding on Tail-Biting Trellises
*Priti Shankar, A.S. Madhu and Aditya Nori* - [2005-4]
- An Automata Based Approach for Verifying Information Flow Properties
*Deepak D'Souza, Raghavendra K. R., Barbara Sprick* - [2005-5]
- Hadwiger number and the cartesian product operation on graphs
*L. Sunil Chandran and J. Krishnam Raju* - [2005-6]
- Reinforcement Learning Based Algorithms For Average Cost Markov Decision Processes
*Mohammed Shahid Abdulla and Shalabh Bhatnagar* - [2005-7]
- On the expressiveness of MTL in the pointwise and continuous semantics
*Deepak D'Souza and Pavithra Prabhakar* - [2005-8]
- Eventual Timed Automata
*Deepak D'Souza and Raj Mohan M* - [2005-9]
- Measure Once 1-way Quantum Finite Automata with Quantum Nondeterminism
*M. V. Panduranga Rao, V. Vinay* - [2005-10]
- On a Computing Model Based on Optical Interference
*M. V. Panduranga Rao* - [2005-11]
- YAM: A Framework for Open Ended Heterogeneous Modelling and Documentation
*Sujit Kumar Chakrabarti and Y. N. Srikant* - [2005-12]
- Boxicity of Series Parallel graphs
*Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju* - [2005-13]
- Object Cache: An Energy Efficient Cache Architecture
*S.S. Shekhar and Y.N. Srikant* - [2005-14]
- Exploring Energy-Performance Trade-offs for Heterogeneous Interconnect Clustered VLIW Processors
*Rahul Nagpal and Y.N. Srikant* - [2005-15]
- Static Analysis for Identifying and Allocating Clusters of Immortal Objects
*Archana Ravindar and Y.N. Srikant* - [2005-16]
- Construction and Use of Linear Regression Models for Processor Performance Analysis
*P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthaveetil* - [2005-17]
- On Adiabatic Quantum Unordered Search
*M. V. Panduranga Rao* - [2004-1]
- On timed automata with input-determined guards
*Deepak D'Souza and Nicolas Tabareau* - [2004-2]
- Representing, Detecting, and Profiling Paths in Hardware
*Kapil Vaswani, T. Matthew Jacob, and Y.N. Srikant* - [2004-3]
- Exact and Approximate Maximum-Likelihood Decoding Algorithms on Tail-Biting Trellises
*Priti Shankar , A.S. Madhu and Aditya Nori* - [2004-4]
- Space/time tradeoffs in code compression for the TMS320C62x processor
*Sreejith Menon and Priti Shankar* - [2004-5]
- Experiments with a new dictionary based code-compression tool on a VLIW processor
*J. Prakash, C. Sandeep, Priti Shankar and Y.N. Srikant* - [2004-7]
- SWuS : Software Watermark using Slices (ME Report)
*Amarnath Mullick and Y.N. Srikant* - [2004-9]
- Quantum finite automata and weighted automata
*M. V. Panduranga Rao and V. Vinay* - [2004-10]
- The Best Nurturers in Computer Science Research
*M. Bharath Kumar and Y.N. srikant* - [2004-11]
- A Product Line Architecture for Word-of-Mouth Social Software
*M. Bharath Kumar and Srikanta J. Bedathur* - [2004-12]
- Transition Aware Scheduling: Increasing Continuous Idle Periods in Resource Units
*K. Ananda Vardhan and Y.N. Srikant* - [2004-13]
- A Graph Matching Based Integrated Scheduling Framework for Clustered VLIW Processors
*Rahul Nagpal and Y.N. Srikant* - [2004-14]
- Using Neighborhood Preserving Projections for Comparing Protein Structures
*Sourangshu Bhattacharya, Chiranjib Bhattacharyya* - [2003-1]
- An automata-theoretic approach to Constraint LTL
*Stephane Demri and Deepak D'Souza* - [2003-2]
- Architectural Support for Online Program Instrumentation
*Kapil Vaswani, Y N Srikant and T Matthew Jacob* - [2003-3]
- Maximum Likelihood Decoding of Block Codes on their Tail-Biting Trellises
*Priti Shankar, P.N.A. Kumar, K. Sasidharan and B.S. Rajan* - [2003-4]
- Tail-Biting Trellises for Linear Codes and their Duals
*Aditya Nori and Priti Shankar* - [2003-5]
- A Survey on Grammar Based Compression
*R. Easwaran* - [2002-1]
- Using Hardcoded Hedge-Automata for Compressing Structured Documents
*Aditya Nori, Priti Shankar and Helmut Seidl* - [2001-3]
- Non-Strict Cache Coherence: Exploiting Data-Race Tolerance in Emerging Applications
*Siddhartha V Tambat and Sriram Vajapeyam* - [2001-4]
- Sub-Tagged Caches: Study of Variable Cache-Block Size Emulation
*Siddhartha V Tambat, Sriram Vajapeyam and S Muthulaxmi* - [2000-1]
- Extensions of Some Efficient Algorithms for Similarity Searches
*Nimisha Gupta and Priti Shankar* - [1999-1]
- Information Geometry and Plefka's Mean-Field Theory
*C Bhattacharya and S S Keerthi* - [1999-2]
- Mean-Field Theory for Stochastic Connectionist Networks with Nits Having Discrete States
*C Bhattacharya and S S Keerthi* - [1999-4]
- Omnigraphics: An Alternative View of Images Synthesis
*S Manohar and R Srinivasan* - [1999-7]
- On Viewing Block Codes as Finite Automata
*Amitava Dasgupta, Priti Shankar, Kaustubh Deshmukh and B S Rajan* - [1998-1]
- Completeness of Negation as Finite Failure: A Resolution Proof
*V Chandru, S Roy and R Subramanyam* - [1998-2]
- Mathematical Programming Embeddings of Logic
*V S Borkar, V Chandru, D Micciancio and S K Millter* - [1998-4]
- Integer Programming
*V Chandru and M R Rao* - [1998-6]
- An Enhanced Co-scheduling Method using Reduced MS-State Diagrams
*R Govindarajan, N S S Narasimha Rao, Erik R Altman and Guang R Gao* - [1998-7]
- Finding Minimum Cost Derivation Trees for Regular Tree Grammars
*Maya Madhavan and Priti Shankar* - [1998-8]
- Dynamic Vectorization: The Potential of Exploiting Repetitive Control Flow
*Sriram Vajapeyam, Tulika Mitra, P J Joseph and Arghya Mukherjee* - [1998-9]
- An Overview of Homology Searching for Biological Sequences Databases
*Pethuru Raj* - [1997-1]
- Data Partitioning Technique for General Loops Across Distributed Memory Machines
*S R Prakash and Y N Srikant* - [1997-2]
- Communication Cost Estimation and Global Data Partitioning for Distributed Memory Machines
*S R Prakash and Y N Srikant* - [1997-3]
- Lectures on Algebraic Geometric Codes
*P Vijaya Kumar* - [1996-1]
- A Study of Robust Smoothing
*Ashok Subramanian* - [1996-2]
- Integrated Modeling and Reverse Engineering for Layered Manufacturing
*V Chandru, B Gurumoorthy and S Manohar* - [1996-3]
- Device Matrix: A Tool for Systematic Design of Virtual Environments
*Rajalakshmi Iyer S and S Manohar* - [1996-4]
- Combinatorial Optimization
*V Chandru and M R Rao* - [1996-5]
- The Recognition of Counting and Smoothing Networks
*V S Anil Kumar* - [1996-6]
- Constructive Negation in Definite Constraint Logic Programs
*V Chandru, S Roy and R Subramanyam* - [1996-7]
- Program Level Control of Network Delay for Parallel Asynchronous Iterative Applications
*P J Joseph and Sriram Vajapeyam* - [1996-8]
- Improving Instruction Dispatch and Issue for Superscalar Processors Running Ordinary Programs
*Sriram Vajapeyam and Tulika Mitra* - [1995-2]
- Voxel-based Modelling for Layered Manufacturing
*V Chandru* - [1995-3]
- Two Recent Algorithms for the Global Minimum Cut Problem
*Ashok Subramanian* - [1995-5]
- VICE: A Highly Parallel Rendering Environment for Visualization
*S Manohar* - [1994-1]
- A New Parallel Line Algorithms
*S M S Hebbar and S Manohar* - [1994-2]
- Preprocessing Classification of Plane Polygons for 3D Polygon Clipping
*B Shankaranarayanan* - [1994-3]
- Parallel Architecture for the Computation of Uniform Rational B-Spline Patches
*Meenakshi Sundaram Gopi and Swami Manohar* - [1994-4]
- Volume Rendering of Unstructured Grids: A Voxelization Approach
*C E Prakash and S Manohar* - [1994-5]
- A New Algorithm for Efficient Form Factor Computation
*M Sridhar, V Sriram and S Manohar* - [1994-6]
- A Polynomial Bound on the Number of Light Cycles in an Undirected Graph
*Ashok Subramanian* - [1994-7]
- New Complexity Results on Three and Higher Dimensional Generalized Voronoi Diagrams
*Abhi Dattasharma and Tamal K Dey* - [1993-1]
- Design and Analysis of Algorithms
*Ashok Subramanian* - [1993-3]
- An Explanation of Splaying
*Ashok Subramanian* - [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-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*

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

[Updated at 2009-10-22T06:42Z]