| 2005 |
|---|
| | K. Vasantalakshmi, Deepak Sridhar, Easwaran Raman and Priti Shankar: Integrating a new cluster scheduling and assignment algorithm into an experimental code generation framework. 12th Annual IEEE International Conference on High Performance Computing (HIPC 2005).
(pdf) |
| | S. Hariharan and Priti Shankar: Compressing XML documents using finite state automata. 2005 Conference on Implementation and Applications of Automata(CIAA 2005), Sophia Antipolis, France. June 2005.
(pdf) |
| | A.S. Madhu and Priti Shankar: Approximate MAP Decoding on Tail-Biting Trellises. 2005 IEEE International Symposium on Information Theory(ISIT 2005), Adelaide, Australia.
(pdf) |
| | Sreejith Menon and Priti Shankar: An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors, 2005 IEEE Data Compression Conference, (DCC 2005), Snowbird, Utah.
(pdf) |
| | Sreejith Menon and Priti Shankar: A Code Compression Advisory Tool for Embedded Processors, 2005 ACM Symposium on Applied Computing(SAC 2005), Santa Fe, New Mexico.
(pdf) |
| 2004 |
|---|
| | Aditya Nori and Priti Shankar: A coset construction for tail-biting trellises. Proceedings of 2004 International Symposium on Information Theory and Applications(ISITA 2004), Parma, Italy.
(pdf) |
| | Priti Shankar: On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises. In Proceedings of 2004 IEEE International Symposium on Information Theory(ISIT 2004), Chicago, USA.
(pdf) |
| 2003 |
|---|
| | Priti Shankar:
Codes and decoding on graphs. Current Science, 85(7), 980-988,October 2003
(ps) |
| | Aditya Nori and Priti Shankar:
Tail-biting trellises for linear codes and their duals. Forty-first Annual Allerton Conference on Communication Control and Computing, Allerton, October 2003(to be presented).
(pdf) |
| | Aditya Nori and Priti Shankar:
A BCJR-like labeling algorithm for tail-biting trellises. In Proceedings of 2003 IEEE International Symposium on Information Theory(ISIT 2003).
(ps) |
| | Siddhartha Rai and Priti Shankar:
Efficient Statistical Modeling for Tree Structured Intermediate Code. Computer Journal, 46(5), 476-486, 2003.
(ps) |
| | Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B.S. Rajan:
On Viewing Block Codes as Finite Automata. Theoretical Computer Science, 290(3), 1775-1795, 2003.
(ps) |
| | J. Prakash, C. Sandeep, Priti Shankar, Y.N. Srikant:
A Simple and Fast Scheme for Code compression for VLIW Architectures, IEEE Data Compression Conference(DCC'03)(poster presentation).
(pdf) |
| | V.K. Paleri, Y.N. Srikant, P. Shankar:
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. Science of Computer Programming.
(ps) |
| 2001 |
|---|
| | 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.
(ps): 627-638 |
| | Priti Shankar, P. N. A. Kumar, K.Sasidharan,
B. Sundar Rajan:
ML Decoding of Block Codes on their Tail-Biting Trellises, IEEE 2001 International Symposium on Information Theory(ISIT 2001).
(pdf): |
| | Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna:
Entending Graham-Glanville Techniques for Optimal Code Generation, ACM Transactions on Programming Languages and Systems, November 2000:973-2001.
(pdf) |
| 2000 |
|---|
| | Priti Shankar,
K. Sasidharan,
Vikas Aggarwal,
B. Sundar Rajan:
A Package for the Implementation of Block Codes as Finite Automata. 5th International Conference on Implementations and Applications of Automata(CIAA 2000):279-292.
(ps) |
| | Kaustubh Deshmukh,
Priti Shankar,
Amitava Dasgupta,
B. Sundar Rajan:
On the Many Faces of Block Codes. Symposium on Theoretical Aspects of Computer Science(STACS 2000):53-64.
(ps) |
| | Priti Shankar,
Amitranjan Gantait,
A. R. Yuvaraj,
Maya Madhavan:
A new algorithm for linear regular tree pattern matching. Theoretical Computer Science, 242(1-2)(2000):125-142
(pdf) |
| 1998 |
|---|
| | Maya Madhavan,
Priti Shankar:
Optimal Regular Tree Pattern Matching Using Pushdown Automata. FSTTCS 1998:122-133.
(pdf) |
| | Vineeth Kumar Paleri,
Y. N. Srikant,
Priti Shankar:
A Simple Algorithm for Partial Redundancy Elimination.
SIGPLAN Notices 33(12): 35-43 (1998)(ps) |
| 1997 |
|---|
| |
Priti Shankar:
Techniques for Linear Regular Tree Pattern Matching.
(Invited Paper)National Seminar on Theoretical Computer Science, Chennai, July 1997.
(ps)
|
| 1996 |
|---|
| | Sulekha R. Kulkarni,
Priti Shankar:
Linear Time Parsers for Classes of Non Context Free Languages.
Theoretical Computer Science 165(2): 355-390 (1996)
(pdf)
|