- Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental
- Ecient Statistical Modeling for the Compression of Tree Structured Intermediate Code
- Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
- Evaluating the Role of Context in Syntax Directed Compression of XML Documents
- COMPASS A tool for evaluation of compression strategies for embedded processors Sreejith K. Menon, Priti Shankar *
- On Viewing Block Codes as Finite Automata Priti Shankar Amitava Dasgupta Kaustubh Deshmukh y
- ISIT 2003, Yokohama, Japan, June 29 { July 4, 2003 A BCJR-like Labeling Algorithm for Tail-Biting Trellises
- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes are Easy to Construct
- Compressing XML Documents Using Recursive Finite State Automata
- International Symposium on Information Theory and its Applications, ISITA2004 Parma, Italy, October 1013, 2004
- Techniques for Linear Regular Tree Pattern Matching Priti Shankar
- July 11, 2005 12:56 WSPC/Trim Size: 9in x 6in for Review Volume tpmandcodegen An Application of Regular Tree
- Partial Redundancy Elimination: A Simple, Pragmatic, and Provably Correct
- An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors
- A Package for the Implementation of Block Codes as Finite Priti Shankar , K.Sasidharan , Vikas Aggarwal , and B.Sundar Rajan y
- ELSEVIER Theoretical Computer Science 165 (1996) 355-390 Theoretical
- Combinatorial Representations of Linear Block Priti Shankar
- Computing the Stopping Distance of a Tanner Graph is NP-hard
- Approximate MAP Decoding on Tail-Biting Department of Computer Science & Automation.
- Some History Some Old Theorems
- A Combinatorial Family of Near Regular LDPC K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran and Priti Shankar
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 10, OCTOBER 2006 4431 Unifying Views of Tail-Biting Trellis Constructions
- On the Complexity of finding stopping set size in Tanner Graphs.
- A Code Compression Advisory Tool for Embedded Processors Sreejith Menon
- On the complexity of exact maximum likelihood decoding on tail-biting Priti Shankar
- Extending Graham-Glanville Techniques for Optimal Code Generation
- Theoretical Computer Science 242 (2000) 125142 www.elsevier.com/locate/tcs
- Optimal Regular Tree Pattern Matching Using Pushdown Automata
- A Simple Algorithm for Partial Redundancy Elimination Vineeth Kumar Paleri, Y.N.Srikant, and Priti Shankar
- On the Many Faces of Block Codes Kaustubh Deshmukh , Priti Shankar y , Amitava Dasgupta y , and B.Sundar Rajan z
- Field Flow Sensitive Pointer and Escape Analysis for Java using Heap Array SSA
- Tail-biting Trellises for Linear Codes and their Duals Aditya Nori Priti Shankar