|
 | Up a level |
Shankar, Priti and Sasidharan, K and Aggarwal, Vikas and Rajan, Sundar B (2001) A Package for the Implementation of Block Codes as Finite Automata. [Book Chapter]
Nori, Aditya and Shankar, Priti (2003) A BCJR-like Labeling Algorithm for Tail-Biting Trellises. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), JUN-JUL, 2003, YOKOHAMA, JAPAN.
Murali Krishnan, K and Singh, Rajdeep and Chandran, Sunil L and Shankar, Priti (2008) A Combinatorial Family of Near Regular LDPC Codes. In: IEEE International Symposium on Information Theory, 2007. ISIT 2007., 24-29 June 2007, Nice .
Prabhu, Prakash and Shankar, Priti (2008) Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. In: 15th International Symposium on Static Analysis, JUL 16-18, 2008, Valencia.
Shankar, Priti (2007) Combinatorial Representations of Block Codes. In: International Conference on Advances in Interdisciplinary Statistics and Combinatorics, October 12{14, 2007, University of North Carolina at Greensboro, Greensboro, North Carolina, USA, October 12-14, 2007, Greensboro, North Carolina.
Krishnan, Murali K and Shankar, Priti (2006) Approximate linear time ML decoding on tail-biting trellises in two rounds. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 2245-2249.
Hariharan, S and Shankar, Priti (2006) Evaluating the role of context in syntax directed compression of XML documents. In: Data Compression Conference, Mar 28-30, 2006, Snowbird, UT,, p. 453.
Krishnan, Murali K and Shankar, Priti (2006) On the complexity of finding stopping set size in Tanner Graphs. In: 40th Annual Conference on Information Sciences and Systems (CISS),, Mar 22-24, 2006, Princeton, NJ, pp. 157-158.
Menon, Sreejith K and Shankar, Priti (2005) An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. In: DCC 2005 Data Compression Conference, 2005, 29-31 March, Utah, p. 470.
Lakshmi, K Vasanta and Sreedhar, Deepak and Raman, Easwaran and Shankar, Priti (2005) Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework. In: 12th International Conference, December 18-21, 2005., Goa, India.
Shankar, Priti (2004) On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises. In: International Symposium on Information Theory, 2004. ISIT 2004, 27 June-2 July, Chicago, 104 -104.
Shankar, Priti and Kumar, PNA and Sasidharan, K and Rajan, BS (2001) ML Decoding of Block Codes on their Tailbiting Trellises. In: 2001 IEEE International Symposium on Information Theory, 24-29 June, Washington, p. 291.
Deshmukh, Kaustubh and Shankar, Priti and Dasgupta, Amitava and Rajan, Sundar B (2000) On the Many Faces of Block Codes. In: STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science, February 2000, France, pp. 53-64.
Madhavan, Maya and Shankar, Priti (1998) Optimal regular tree pattern matching using pushdown automata. In: 18th Conference on Foundations of Software Technology and Theoretical Computer Science, December 17-19, 1998, Chennai, India, pp. 122-133.
Menon, Sreejith K and Shankar, Priti (2008) COMPASS – A tool for evaluation of compression strategies for embedded processors. In: Journal of Systems Architecture, 54 (10). pp. 995-1003.
Jain, Divya and Lakshmi, K Vasanta and Shankar, Priti (2008) Deep Packet Inspection Using Message Passing Networks. In: Lecture Notes in Computer Science, 5230 . pp. 419-420.
Krishnan, Murali K and Shankar, Priti (2007) Computing the Stopping Distance of a Tanner Graph is NP-hard. In: IEEE Transactions on Information Theory, 53 (6). pp. 2278-2280.
Nori, Aditya V and Shankar, Priti (2006) Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes. In: IEEE Transactions on Information Theory, 52 (10). pp. 4431-4443.
Subramanian, Hariharan and Shankar, Priti (2006) Compressing XML Documents Using Recursive Finite State Automata. In: Lecture Notes in Computer Science, 3845 . pp. 282-293.
Shankar, Priti and Dasgupta, Amitava and Deshmukh, Kaustubh and Rajan, Sundar B (2003) On viewing block codes as finite automata. In: Theoretical Computer Science, 290 (3). pp. 1775-1797.
Shankar, Priti and Kumar, PNA and Singh, Harmeet and Rajan, BS (2001) Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. In: Automata Languages and Programming, Proceeding, 2076 . pp. 627-638.
Madhavan, Maya and Shankar, Priti and Rai, Siddartha and Ramakrishnan, U (2000) Extending Graham-Glanville Techniques for Optimal Code Generation. In: ACM Transactions on Programming Languages and Systems, 22 (06). pp. 973-1001.
Shankar, Priti and Gantait, Amitranjan and Yuvaraj, AR and Madhavan, Maya (2000) A new algorithm for linear regular tree pattern matching. In: Theoretical Computer Science, 242 (1-2). pp. 125-142.
Paleri, Vineeth Kumar and Srikant, YN and Shankar, Priti (1998) A simple algorithm for partial redundancy elimination. In: ACM Sigplan Notices, 33 (12). pp. 35-43.
Kulkarni, Sulekha R and Shankar, Priti (1996) Linear time parsers for classes of non context free languages. In: Theoretical Computer Science, 165 (2). pp. 355-390.
Gabrani, Naveen and Shankar, Priti (1992) A note on the reconstruction of a binary tree from its traversals. In: Information Processing Letters, 42 (2). 117 -119.
Shankar, Priti and Adiga, BS (1992) A graph-based regularity test for deterministic context-free languages. In: Theoretical Computer Science, 95 (2). pp. 339-340.
Unnikrishnan, A and Shankar, Priti and Venkatesh, YV (1988) Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images. In: IEEE Transactions on Software Engineering, 14 (5). pp. 659-665.
Haripriyan, HK and Srikant, YN and Shankar, Priti (1988) A compiler writing system based on affix grammars. In: Computer Languages, 13 (1). pp. 1-11.
Srikant, YN and Shankar, Priti (1987) Parallel parsing of programming languages. In: Information Sciences, 43 (1-2). pp. 55-83.
Srikant, YN and Shankar, Priti (1987) A new parallel algorithm for parsing arithmetic infix expressions. In: Parallel Computing, 4 (3). 291 -304.
