|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 16 occurrences of 16 keywords
|
|
|
|
|
Results
Found 37 publication records. Showing 37 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sreejith K. Menon, Priti Shankar |
COMPASS - A tool for evaluation of compression strategies for embedded processors.  |
Journal of Systems Architecture - Embedded Systems Design  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Divya Jain, K. Vasanta Lakshmi, Priti Shankar |
Deep Packet Inspection Using Message Passing Networks. |
RAID |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prakash Prabhu, Priti Shankar |
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. |
SAS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Murali Krishnan, Priti Shankar |
Computing the Stopping Distance of a Tanner Graph Is NP-Hard. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar |
Algebraic Structure Theory of Tail-Biting Trellises. |
AAECC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar, P. N. A. Kumar, K. Sasidharan, B. Sundar Rajan, A. S. Madhu |
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar |
A Combinatorial Family of Near Regular LDPC Codes |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | K. Murali Krishnan, Priti Shankar |
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | S. Hariharan, Priti Shankar |
Evaluating the Role of Context in Syntax Directed Compression of XML Documents. |
DCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | A. S. Madhu, Priti Shankar |
Approximate MAP Decoding on Tail-Biting Trellises |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | K. Murali Krishnan, Priti Shankar |
On the Complexity of finding Stopping Distance in Tanner Graphs |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sreejith K. Menon, Priti Shankar |
A code compression advisory tool for embedded processors. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
embedded system tool, run time decompression, code compression |
| 1 | Hariharan Subramanian, Priti Shankar |
Compressing XML Documents Using Recursive Finite State Automata. |
CIAA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sreejith K. Menon, Priti Shankar |
An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. (PDF / PS) |
DCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar |
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. |
Sci. Comput. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan |
On viewing block codes as finite automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddhartha Rai, Priti Shankar |
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code. |
Comput. J. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Prakash, C. Sandeep, Priti Shankar, Y. N. Srikant |
A Simple and Fast Scheme for Code Compression for VLIW Processors. |
DCC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. N. Srikant, Priti Shankar (eds.) |
The Compiler Design Handbook: Optimizations and Machine Code Generation |
|
2002 |
DBLP BibTeX RDF |
|
| 1 | Priti Shankar |
Instruction Selection Using Tree Parsing. |
The Compiler Design Handbook |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
tail-biting trellises, Reed-Solomon codes, cyclic codes, linear block codes |
| 1 | Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan |
A new algorithm for linear regular tree pattern matching. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna |
Extending Graham-Glanville techniques for optimal code generation. |
ACM Trans. Program. Lang. Syst. |
2000 |
DBLP DOI BibTeX RDF |
code-generator generator, optimal code generation, tree pattern matching |
| 1 | Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan |
On the Many Faces of Block Codes. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan |
A Package for the Implementation of Block Codes as Finite Automata. |
CIAA |
2000 |
DBLP DOI BibTeX RDF |
minimal trellis, decoder complexity, subtrellis overlaying, block codes |
| 1 | Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar |
A Simple Algorithm for Partial Redundancy Elimination. |
SIGPLAN Notices |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Madhavan, Priti Shankar |
Optimal Regular Tree Pattern Matching Using Pushdown Automata. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sulekha R. Kulkarni, Priti Shankar |
Linear Time Parsers for Classes of Non Context Free Languages. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Gabrani, Priti Shankar |
A Note on the Reconstruction of a Binary Tree from its Traversals. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar, B. S. Adiga |
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Priti Shankar, B. S. Adiga |
A Graph-Based Regularity Test for Deterministic Context-free Languages. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Unnikrishnan, Priti Shankar, Y. V. Venkatesh |
Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images. |
IEEE Trans. Software Eng. |
1988 |
DBLP DOI BibTeX RDF |
threaded linear hierarchical quadtree, TLHQT, adjacency links, labeling connected components, quadtree environment, data structures, computational geometry, computerised picture processing, structure, binary images, geometric properties, adjacencies, linear quadtree, Euler number, perimeter |
| 1 | H. K. Haripriyan, Y. N. Srikant, Priti Shankar |
A Compiler Writing System Based on Affix Grammars. |
Comput. Lang. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. N. Srikant, Priti Shankar |
A new parallel algorithm for parsing arithmetic infix expressions. |
Parallel Computing |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. N. Srikant, Priti Shankar |
Parallel parsing of programming languages. |
Inf. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar |
Connected Component Labelling Using Quadtrees - A Bottom-up Approach. |
Comput. J. |
1987 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #37 of 37 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")