Priti Shankar

According to our database, Priti Shankar authored at least 45 papers between 1979 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2012

Syntax Directed Compression of Trees Using Pushdown Automata.

Priti Shankar

Proceedings of the Modern Applications of Automata Theory., 2012

2008

COMPASS - A tool for evaluation of compression strategies for embedded processors.

Sreejith K. Menon, Priti Shankar

J. Syst. Archit., 2008

Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA.

Prakash Prabhu, Priti Shankar

Proceedings of the Static Analysis, 15th International Symposium, 2008

Deep Packet Inspection Using Message Passing Networks.

Divya Jain, K. Vasanta Lakshmi, Priti Shankar

Proceedings of the Recent Advances in Intrusion Detection, 11th International Symposium, 2008

2007

Computing the Stopping Distance of a Tanner Graph Is NP-Hard.

Karunakaran Murali Krishnan, Priti Shankar

IEEE Trans. Inf. Theory, 2007

A Combinatorial Family of Near Regular LDPC Codes.

K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar

Proceedings of the IEEE International Symposium on Information Theory, 2007

An Application of Regular Tree Grammars.

Priti Shankar

Proceedings of the Formal Models, 2007

Algebraic Structure Theory of Tail-Biting Trellises.

Priti Shankar

Proceedings of the Applied Algebra, 2007

Instruction Selection Using Tree Parsing.

Priti Shankar

Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2007

The Static Single Assignment Form: Construction and Application to Program Optimization.

Prakash Prabhu, Priti Shankar, Y. N. Srikant

Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2007

2006

Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises

Priti Shankar, P. N. A. Kumar, K. Sasidharan, B. Sundar Rajan, A. S. Madhu

CoRR, 2006

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds.

K. Murali Krishnan, Priti Shankar

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Evaluating the Role of Context in Syntax Directed Compression of XML Documents.

S. Hariharan, Priti Shankar

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

On the Complexity of finding stopping set size in Tanner Graphs.

K. Murali Krishnan, Priti Shankar

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005

On the Complexity of finding Stopping Distance in Tanner Graphs

K. Murali Krishnan, Priti Shankar

CoRR, 2005

Approximate MAP Decoding on Tail-Biting Trellises

A. S. Madhu, Priti Shankar

CoRR, 2005

Compressing XML Documents Using Recursive Finite State Automata.

Hariharan Subramanian, Priti Shankar

Proceedings of the Implementation and Application of Automata, 2005

A code compression advisory tool for embedded processors.

Sreejith K. Menon, Priti Shankar

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Approximate MAP decoding on tail-biting trellises.

Madhu Achuthan Syamala, Priti Shankar

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework.

K. Vasanta Lakshmi, Deepak Sreedhar, Easwaran Raman, Priti Shankar

Proceedings of the High Performance Computing, 2005

An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors.

Sreejith K. Menon, Priti Shankar

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

On the complexity of exact maximum likelihood decoding on tail-biting trellises.

Priti Shankar

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On viewing block codes as finite automata.

Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan

Theor. Comput. Sci., 2003

Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm.

Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar

Sci. Comput. Program., 2003

Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code.

Siddhartha Rai, Priti Shankar

Comput. J., 2003

A Simple and Fast Scheme for Code Compression for VLIW Processors.

J. Prakash, C. Sandeep, Priti Shankar, Y. N. Srikant

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002

Instruction Selection Using Tree Parsing.

Priti Shankar

Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2002

2001

Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct.

Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Extending Graham-Glanville techniques for optimal code generation.

Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna

ACM Trans. Program. Lang. Syst., 2000

A new algorithm for linear regular tree pattern matching.

Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan

Theor. Comput. Sci., 2000

A Package for the Implementation of Block Codes as Finite Automata.

Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan

Proceedings of the Implementation and Application of Automata, 2000

On the Many Faces of Block Codes.

Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan

Proceedings of the STACS 2000, 2000

1998

A Simple Algorithm for Partial Redundancy Elimination.

Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar

ACM SIGPLAN Notices, 1998

Optimal Regular Tree Pattern Matching Using Pushdown Automata.

Maya Madhavan, Priti Shankar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1996

Linear Time Parsers for Classes of Non Context Free Languages.

Sulekha R. Kulkarni, Priti Shankar

Theor. Comput. Sci., 1996

1992

Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages.

Priti Shankar, B. S. Adiga

Theor. Comput. Sci., 1992

A Note on the Reconstruction of a Binary Tree from its Traversals.

Naveen Gabrani, Priti Shankar

Inf. Process. Lett., 1992

1991

A Graph-Based Regularity Test for Deterministic Context-free Languages.

Priti Shankar, B. S. Adiga

Theor. Comput. Sci., 1991

1988

Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images.

A. Unnikrishnan, Priti Shankar, Y. V. Venkatesh

IEEE Trans. Software Eng., 1988

A Compiler Writing System Based on Affix Grammars.

H. K. Haripriyan, Y. N. Srikant, Priti Shankar

Comput. Lang., 1988

1987

Distribution of black nodes at various levels in a linear quadtree.

A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar

Pattern Recognit. Lett., 1987

A new parallel algorithm for parsing arithmetic infix expressions.

Y. N. Srikant, Priti Shankar

Parallel Comput., 1987

Parallel parsing of programming languages.

Y. N. Srikant, Priti Shankar

Inf. Sci., 1987

Connected Component Labelling Using Quadtrees - A Bottom-up Approach.

A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar

Comput. J., 1987

1979

On BCH codes over arbitrary integer tings (Corresp.).

Priti Shankar

IEEE Trans. Inf. Theory, 1979