| 2008 |
|---|
| 37 | EE | Divya Jain,
K. Vasanta Lakshmi,
Priti Shankar:
Deep Packet Inspection Using Message Passing Networks.
RAID 2008: 419-420 |
| 36 | EE | Prakash Prabhu,
Priti Shankar:
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA.
SAS 2008: 110-127 |
| 35 | EE | Sreejith K. Menon,
Priti Shankar:
COMPASS - A tool for evaluation of compression strategies for embedded processors.
Journal of Systems Architecture - Embedded Systems Design 54(10): 995-1003 (2008) |
| 2007 |
|---|
| 34 | EE | Priti Shankar:
Algebraic Structure Theory of Tail-Biting Trellises.
AAECC 2007: 47 |
| 33 | EE | K. Murali Krishnan,
Priti Shankar:
Computing the Stopping Distance of a Tanner Graph Is NP-Hard.
IEEE Transactions on Information Theory 53(6): 2278-2280 (2007) |
| 2006 |
|---|
| 32 | EE | S. Hariharan,
Priti Shankar:
Evaluating the Role of Context in Syntax Directed Compression of XML Documents.
DCC 2006: 453 |
| 31 | EE | Priti Shankar,
P. N. A. Kumar,
K. Sasidharan,
B. Sundar Rajan,
A. S. Madhu:
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
CoRR abs/cs/0601023: (2006) |
| 30 | EE | K. Murali Krishnan,
Priti Shankar:
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
CoRR abs/cs/0601126: (2006) |
| 29 | EE | K. Murali Krishnan,
Rajdeep Singh,
L. Sunil Chandran,
Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes
CoRR abs/cs/0609146: (2006) |
| 2005 |
|---|
| 28 | EE | Hariharan Subramanian,
Priti Shankar:
Compressing XML Documents Using Recursive Finite State Automata.
CIAA 2005: 282-293 |
| 27 | EE | Sreejith K. Menon,
Priti Shankar:
An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors.
DCC 2005: 470 |
| 26 | EE | 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: 518-527 |
| 25 | EE | Sreejith K. Menon,
Priti Shankar:
A code compression advisory tool for embedded processors.
SAC 2005: 863-867 |
| 24 | EE | A. S. Madhu,
Priti Shankar:
Approximate MAP Decoding on Tail-Biting Trellises
CoRR abs/cs/0506009: (2005) |
| 23 | EE | K. Murali Krishnan,
Priti Shankar:
On the Complexity of finding Stopping Distance in Tanner Graphs
CoRR abs/cs/0512101: (2005) |
| 2003 |
|---|
| 22 | EE | J. Prakash,
C. Sandeep,
Priti Shankar,
Y. N. Srikant:
A Simple and Fast Scheme for Code Compression for VLIW Processors.
DCC 2003: 444 |
| 21 | EE | Siddhartha Rai,
Priti Shankar:
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code.
Comput. J. 46(5): 476-486 (2003) |
| 20 | EE | Vineeth Kumar Paleri,
Y. N. Srikant,
Priti Shankar:
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm.
Sci. Comput. Program. 48(1): 1-20 (2003) |
| 19 | | Priti Shankar,
Amitava Dasgupta,
Kaustubh Deshmukh,
B. Sundar Rajan:
On viewing block codes as finite automata.
Theor. Comput. Sci. 290(3): 1775-1797 (2003) |
| 2002 |
|---|
| 18 | | Y. N. Srikant,
Priti Shankar:
The Compiler Design Handbook: Optimizations and Machine Code Generation
CRC Press 2002 |
| 17 | | Priti Shankar:
Instruction Selection Using Tree Parsing.
The Compiler Design Handbook 2002: 565-602 |
| 2001 |
|---|
| 16 | EE | 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: 627-638 |
| 2000 |
|---|
| 15 | EE | Priti Shankar,
K. Sasidharan,
Vikas Aggarwal,
B. Sundar Rajan:
A Package for the Implementation of Block Codes as Finite Automata.
CIAA 2000: 279-292 |
| 14 | EE | Kaustubh Deshmukh,
Priti Shankar,
Amitava Dasgupta,
B. Sundar Rajan:
On the Many Faces of Block Codes.
STACS 2000: 53-64 |
| 13 | EE | Maya Madhavan,
Priti Shankar,
Siddhartha Rai,
U. Ramakrishna:
Extending Graham-Glanville techniques for optimal code generation.
ACM Trans. Program. Lang. Syst. 22(6): 973-1001 (2000) |
| 12 | EE | Priti Shankar,
Amitranjan Gantait,
A. R. Yuvaraj,
Maya Madhavan:
A new algorithm for linear regular tree pattern matching.
Theor. Comput. Sci. 242(1-2): 125-142 (2000) |
| 1998 |
|---|
| 11 | | Maya Madhavan,
Priti Shankar:
Optimal Regular Tree Pattern Matching Using Pushdown Automata.
FSTTCS 1998: 122-133 |
| 10 | | Vineeth Kumar Paleri,
Y. N. Srikant,
Priti Shankar:
A Simple Algorithm for Partial Redundancy Elimination.
SIGPLAN Notices 33(12): 35-43 (1998) |
| 1996 |
|---|
| 9 | EE | Sulekha R. Kulkarni,
Priti Shankar:
Linear Time Parsers for Classes of Non Context Free Languages.
Theor. Comput. Sci. 165(2): 355-390 (1996) |
| 1992 |
|---|
| 8 | | Naveen Gabrani,
Priti Shankar:
A Note on the Reconstruction of a Binary Tree from its Traversals.
Inf. Process. Lett. 42(2): 117-119 (1992) |
| 7 | | Priti Shankar,
B. S. Adiga:
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages.
Theor. Comput. Sci. 95(2): 339-340 (1992) |
| 1991 |
|---|
| 6 | | Priti Shankar,
B. S. Adiga:
A Graph-Based Regularity Test for Deterministic Context-free Languages.
Theor. Comput. Sci. 88(1): 117-125 (1991) |
| 1988 |
|---|
| 5 | | H. K. Haripriyan,
Y. N. Srikant,
Priti Shankar:
A Compiler Writing System Based on Affix Grammars.
Comput. Lang. 13(1): 1-11 (1988) |
| 4 | EE | 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): 659-665 (1988) |
| 1987 |
|---|
| 3 | | A. Unnikrishnan,
Y. V. Venkatesh,
Priti Shankar:
Connected Component Labelling Using Quadtrees - A Bottom-up Approach.
Comput. J. 30(2): 176-182 (1987) |
| 2 | EE | Y. N. Srikant,
Priti Shankar:
Parallel parsing of programming languages.
Inf. Sci. 43(1-2): 55-83 (1987) |
| 1 | EE | Y. N. Srikant,
Priti Shankar:
A new parallel algorithm for parsing arithmetic infix expressions.
Parallel Computing 4(3): 291-304 (1987) |
