Priti Shankar

Publication Activity (10 Years)

Years Active: 1979-2008
Publications (10 Years): 0

Publications

Sreejith K. Menon, Priti Shankar
COMPASS - A tool for evaluation of compression strategies for embedded processors. J. Syst. Archit. 54 (10) (2008)
Prakash Prabhu, Priti Shankar
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. SAS (2008)
Divya Jain, K. Vasanta Lakshmi, Priti Shankar
Deep Packet Inspection Using Message Passing Networks. RAID (2008)
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
A Combinatorial Family of Near Regular LDPC Codes. ISIT (2007)
Karunakaran Murali Krishnan, Priti Shankar
Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Trans. Inf. Theory 53 (6) (2007)
Priti Shankar
An Application of Regular Tree Grammars. Formal Models, Languages and Applications (2007)
Priti Shankar
Algebraic Structure Theory of Tail-Biting Trellises. AAECC (2007)
Priti Shankar, P. N. A. Kumar, K. Sasidharan, B. Sundar Rajan, A. S. Madhu
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises CoRR (2006)
K. Murali Krishnan, Priti Shankar
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds CoRR (2006)
K. Murali Krishnan, Priti Shankar
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. ISIT (2006)
S. Hariharan, Priti Shankar
Evaluating the Role of Context in Syntax Directed Compression of XML Documents. DCC (2006)
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
A Combinatorial Family of Near Regular LDPC Codes CoRR (2006)
K. Murali Krishnan, Priti Shankar
On the Complexity of finding stopping set size in Tanner Graphs. CISS (2006)
Madhu Achuthan Syamala, Priti Shankar
Approximate MAP decoding on tail-biting trellises. ISIT (2005)
Hariharan Subramanian, Priti Shankar
Compressing XML Documents Using Recursive Finite State Automata. CIAA (2005)
Sreejith K. Menon, Priti Shankar
A code compression advisory tool for embedded processors. SAC (2005)
K. Vasanta Lakshmi, Deepak Sreedhar, Easwaran Raman, Priti Shankar
Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework. HiPC (2005)
A. S. Madhu, Priti Shankar
Approximate MAP Decoding on Tail-Biting Trellises CoRR (2005)
Sreejith K. Menon, Priti Shankar
An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. DCC (2005)
K. Murali Krishnan, Priti Shankar
On the Complexity of finding Stopping Distance in Tanner Graphs CoRR (2005)
Priti Shankar
On the complexity of exact maximum likelihood decoding on tail-biting trellises. ISIT (2004)
J. Prakash, C. Sandeep, Priti Shankar, Y. N. Srikant
A Simple and Fast Scheme for Code Compression for VLIW Processors. DCC (2003)
Siddhartha Rai, Priti Shankar
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code. Comput. J. 46 (5) (2003)
Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. Sci. Comput. Program. 48 (1) (2003)
Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan
On viewing block codes as finite automata. Theor. Comput. Sci. 290 (3) (2003)
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. ICALP (2001)
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
On the Many Faces of Block Codes. STACS (2000)
Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna
Extending Graham-Glanville techniques for optimal code generation. ACM Trans. Program. Lang. Syst. 22 (6) (2000)
Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan
A new algorithm for linear regular tree pattern matching. Theor. Comput. Sci. 242 (1-2) (2000)
Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
A Package for the Implementation of Block Codes as Finite Automata. CIAA (2000)
Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar
A Simple Algorithm for Partial Redundancy Elimination. ACM SIGPLAN Notices 33 (12) (1998)
Maya Madhavan, Priti Shankar
Optimal Regular Tree Pattern Matching Using Pushdown Automata. FSTTCS (1998)
Sulekha R. Kulkarni, Priti Shankar
Linear Time Parsers for Classes of Non Context Free Languages. Theor. Comput. Sci. 165 (2) (1996)
Naveen Gabrani, Priti Shankar
A Note on the Reconstruction of a Binary Tree from its Traversals. Inf. Process. Lett. 42 (2) (1992)
Priti Shankar, B. S. Adiga
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. Theor. Comput. Sci. 95 (2) (1992)
Priti Shankar, B. S. Adiga
A Graph-Based Regularity Test for Deterministic Context-free Languages. Theor. Comput. Sci. 88 (1) (1991)
H. K. Haripriyan, Y. N. Srikant, Priti Shankar
A Compiler Writing System Based on Affix Grammars. Comput. Lang. 13 (1) (1988)
A. Unnikrishnan, Priti Shankar, Y. V. Venkatesh
Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images. IEEE Trans. Software Eng. 14 (5) (1988)
A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar
Distribution of black nodes at various levels in a linear quadtree. Pattern Recognit. Lett. 6 (5) (1987)
Y. N. Srikant, Priti Shankar
Parallel parsing of programming languages. Inf. Sci. 43 (1-2) (1987)
Y. N. Srikant, Priti Shankar
A new parallel algorithm for parsing arithmetic infix expressions. Parallel Comput. 4 (3) (1987)
A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar
Connected Component Labelling Using Quadtrees - A Bottom-up Approach. Comput. J. 30 (2) (1987)
Priti Shankar
On BCH codes over arbitrary integer tings (Corresp.). IEEE Trans. Inf. Theory 25 (4) (1979)