default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPriti Shankar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[p4]Priti Shankar:
Syntax Directed Compression of Trees Using Pushdown Automata. Modern Applications of Automata Theory 2012: 585-616- [e3]Deepak D'Souza, Priti Shankar:
Modern Applications of Automata Theory. IISc Research Monographs Series 2, World Scientific 2012, ISBN 978-981-4271-04-2 [contents]
2000 – 2009
- 2008
- [j19]Sreejith K. Menon, Priti Shankar:
COMPASS - A tool for evaluation of compression strategies for embedded processors. J. Syst. Archit. 54(10): 995-1003 (2008) - [c19]Divya Jain, K. Vasanta Lakshmi, Priti Shankar:
Deep Packet Inspection Using Message Passing Networks. RAID 2008: 419-420 - [c18]Prakash Prabhu, Priti Shankar:
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. SAS 2008: 110-127 - 2007
- [j18]Karunakaran Murali Krishnan
, Priti Shankar:
Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Trans. Inf. Theory 53(6): 2278-2280 (2007) - [c17]Priti Shankar:
Algebraic Structure Theory of Tail-Biting Trellises. AAECC 2007: 47 - [c16]Priti Shankar:
An Application of Regular Tree Grammars. Formal Models, Languages and Applications 2007: 337-353 - [c15]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. ISIT 2007: 761-765 - [p3]Prakash Prabhu, Priti Shankar, Y. N. Srikant:
The Static Single Assignment Form: Construction and Application to Program Optimization. The Compiler Design Handbook, 2nd ed. 2007: 11 - [p2]Priti Shankar:
Instruction Selection Using Tree Parsing. The Compiler Design Handbook, 2nd ed. 2007: 17 - [e2]Y. N. Srikant, Priti Shankar:
The Compiler Design Handbook: Optimizations and Machine Code Generation, Second Edition. CRC Press 2007, ISBN 978-1-42-004382-2 [contents] - 2006
- [c14]K. Murali Krishnan, Priti Shankar:
On the Complexity of finding stopping set size in Tanner Graphs. CISS 2006: 157-158 - [c13]S. Hariharan, Priti Shankar:
Evaluating the Role of Context in Syntax Directed Compression of XML Documents. DCC 2006: 453 - [c12]K. Murali Krishnan, Priti Shankar:
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. ISIT 2006: 2245-2249 - [i5]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) - [i4]K. Murali Krishnan, Priti Shankar:
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. CoRR abs/cs/0601126 (2006) - [i3]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. CoRR abs/cs/0609146 (2006) - 2005
- [c11]Sreejith K. Menon, Priti Shankar:
An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. DCC 2005: 470 - [c10]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 - [c9]Madhu Achuthan Syamala, Priti Shankar:
Approximate MAP decoding on tail-biting trellises. ISIT 2005: 1325-1328 - [c8]Sreejith K. Menon, Priti Shankar:
A code compression advisory tool for embedded processors. SAC 2005: 863-867 - [c7]Hariharan Subramanian, Priti Shankar:
Compressing XML Documents Using Recursive Finite State Automata. CIAA 2005: 282-293 - [i2]A. S. Madhu, Priti Shankar:
Approximate MAP Decoding on Tail-Biting Trellises. CoRR abs/cs/0506009 (2005) - [i1]K. Murali Krishnan, Priti Shankar:
On the Complexity of finding Stopping Distance in Tanner Graphs. CoRR abs/cs/0512101 (2005) - 2004
- [c6]Priti Shankar:
On the complexity of exact maximum likelihood decoding on tail-biting trellises. ISIT 2004: 104 - 2003
- [j17]Siddhartha Rai, Priti Shankar:
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code. Comput. J. 46(5): 476-486 (2003) - [j16]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) - [j15]Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan:
On viewing block codes as finite automata. Theor. Comput. Sci. 290(3): 1775-1797 (2003) - [c5]J. Prakash, C. Sandeep, Priti Shankar, Y. N. Srikant:
A Simple and Fast Scheme for Code Compression for VLIW Processors. DCC 2003: 444 - 2002
- [p1]Priti Shankar:
Instruction Selection Using Tree Parsing. The Compiler Design Handbook 2002: 565-602 - [e1]Y. N. Srikant, Priti Shankar:
The Compiler Design Handbook: Optimizations and Machine Code Generation. CRC Press 2002, ISBN 0-8493-1240-X [contents] - 2001
- [c4]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
- [j14]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) - [j13]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) - [c3]Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan:
On the Many Faces of Block Codes. STACS 2000: 53-64 - [c2]Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan:
A Package for the Implementation of Block Codes as Finite Automata. CIAA 2000: 279-292
1990 – 1999
- 1998
- [j12]Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar:
A Simple Algorithm for Partial Redundancy Elimination. ACM SIGPLAN Notices 33(12): 35-43 (1998) - [c1]Maya Madhavan, Priti Shankar:
Optimal Regular Tree Pattern Matching Using Pushdown Automata. FSTTCS 1998: 122-133 - 1996
- [j11]Sulekha R. Kulkarni, Priti Shankar:
Linear Time Parsers for Classes of Non Context Free Languages. Theor. Comput. Sci. 165(2): 355-390 (1996) - 1992
- [j10]Naveen Gabrani, Priti Shankar:
A Note on the Reconstruction of a Binary Tree from its Traversals. Inf. Process. Lett. 42(2): 117-119 (1992) - [j9]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
- [j8]Priti Shankar, B. S. Adiga:
A Graph-Based Regularity Test for Deterministic Context-free Languages. Theor. Comput. Sci. 88(1): 117-125 (1991)
1980 – 1989
- 1988
- [j7]H. K. Haripriyan, Y. N. Srikant, Priti Shankar:
A Compiler Writing System Based on Affix Grammars. Comput. Lang. 13(1): 1-11 (1988) - [j6]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
- [j5]A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar:
Connected Component Labelling Using Quadtrees - A Bottom-up Approach. Comput. J. 30(2): 176-182 (1987) - [j4]Y. N. Srikant, Priti Shankar:
Parallel parsing of programming languages. Inf. Sci. 43(1-2): 55-83 (1987) - [j3]Y. N. Srikant, Priti Shankar:
A new parallel algorithm for parsing arithmetic infix expressions. Parallel Comput. 4(3): 291-304 (1987) - [j2]A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar:
Distribution of black nodes at various levels in a linear quadtree. Pattern Recognit. Lett. 6(5): 341-342 (1987)
1970 – 1979
- 1979
- [j1]Priti Shankar:
On BCH codes over arbitrary integer tings (Corresp.). IEEE Trans. Inf. Theory 25(4): 480-483 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
