Priti Shankar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2012

Syntax Directed Compression of Trees Using Pushdown AutomataPriti Shankar. In Modern Applications of Automata Theory. pages 585-616, 2012. [doi]

2008

Deep Packet Inspection Using Message Passing NetworksDivya Jain, K. Vasanta Lakshmi, Priti Shankar. raid 2008: 419-420 [doi]

COMPASS - A tool for evaluation of compression strategies for embedded processorsSreejith K. Menon, Priti Shankar. jsa, 54(10):995-1003, 2008. [doi]

Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSAPrakash Prabhu, Priti Shankar. SAS 2008: 110-127 [doi]

2007

Computing the Stopping Distance of a Tanner Graph Is NP-HardK. Murali Krishnan, Priti Shankar. TIT, 53(6):2278-2280, 2007. [doi]

A Combinatorial Family of Near Regular LDPC CodesK. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar. isit 2007: 761-765 [doi]

The Static Single Assignment Form: Construction and Application to Program OptimizationPrakash Prabhu, Priti Shankar, Y. N. Srikant. In The Compiler Design Handbook, 2nd ed.. pages 11, 2007.

Algebraic Structure Theory of Tail-Biting TrellisesPriti Shankar. AAECC 2007: 47 [doi]

An Application of Regular Tree GrammarsPriti Shankar. BIRTHDAY 2007: 337-353

2006

On the Complexity of finding stopping set size in Tanner GraphsK. Murali Krishnan 0001, Priti Shankar. ciss 2006: 157-158 [doi]

Evaluating the Role of Context in Syntax Directed Compression of XML DocumentsS. Hariharan, Priti Shankar. dcc 2006: 453 [doi]

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two RoundsK. Murali Krishnan, Priti Shankar. isit 2006: 2245-2249 [doi]

2005

2004

On the complexity of exact maximum likelihood decoding on tail-biting trellisesPriti Shankar. isit 2004: 104 [doi]

2003

2002

Instruction Selection Using Tree ParsingPriti Shankar. In The Compiler Design Handbook. pages 565-602, 2002.

2001

Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to ConstructPriti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan. icalp 2001: 627-638 [doi]

2000

1998

Optimal Regular Tree Pattern Matching Using Pushdown AutomataMaya Madhavan, Priti Shankar. fsttcs 1998: 122-133

A Simple Algorithm for Partial Redundancy EliminationVineeth Kumar Paleri, Y. N. Srikant, Priti Shankar. SIGPLAN, 33(12):35-43, 1998.

1996

Linear Time Parsers for Classes of Non Context Free LanguagesSulekha R. Kulkarni, Priti Shankar. TCS, 165(2):355-390, 1996. [doi]

1992

A Note on the Reconstruction of a Binary Tree from its TraversalsNaveen Gabrani, Priti Shankar. ipl, 42(2):117-119, 1992.

Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free LanguagesPriti Shankar, B. S. Adiga. TCS, 95(2):339-340, 1992.

1991

A Graph-Based Regularity Test for Deterministic Context-free LanguagesPriti Shankar, B. S. Adiga. TCS, 88(1):117-125, 1991.

1988

A Compiler Writing System Based on Affix GrammarsH. K. Haripriyan, Y. N. Srikant, Priti Shankar. Comp. Lang., Syst. \& Struct., 13(1):1-11, 1988.

Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary ImagesA. Unnikrishnan, Priti Shankar, Y. V. Venkatesh. TSE, 14(5):659-665, 1988. [doi]

1987

A new parallel algorithm for parsing arithmetic infix expressionsY. N. Srikant, Priti Shankar. pc, 4(3):291-304, 1987. [doi]

Parallel parsing of programming languagesY. N. Srikant, Priti Shankar. isci, 43(1-2):55-83, 1987. [doi]

Connected Component Labelling Using Quadtrees - A Bottom-up ApproachA. Unnikrishnan, Y. V. Venkatesh, Priti Shankar. cj, 30(2):176-182, 1987.

Distribution of black nodes at various levels in a linear quadtreeA. Unnikrishnan, Y. V. Venkatesh, Priti Shankar. prl, 6(5):341-342, 1987. [doi]

1979

On BCH codes over arbitrary integer tings (Corresp.)Priti Shankar. TIT, 25(4):480-483, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL