Priti Shankar

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