The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Priti Shankar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. Hariharan, Priti Shankar
    Evaluating the Role of Context in Syntax Directed Compression of XML Documents. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:453- [Conf]
  2. Sreejith K. Menon, Priti Shankar
    An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:470- [Conf]
  3. J. Prakash, C. Sandeep, Priti Shankar, Y. N. Srikant
    A Simple and Fast Scheme for Code Compression for VLIW Processors. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:444- [Conf]
  4. Maya Madhavan, Priti Shankar
    Optimal Regular Tree Pattern Matching Using Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:122-133 [Conf]
  5. K. Vasanta Lakshmi, Deepak Sreedhar, Easwaran Raman, Priti Shankar
    Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:518-527 [Conf]
  6. Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan
    Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:627-638 [Conf]
  7. Sreejith K. Menon, Priti Shankar
    A code compression advisory tool for embedded processors. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:863-867 [Conf]
  8. Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
    On the Many Faces of Block Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:53-64 [Conf]
  9. Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
    A Package for the Implementation of Block Codes as Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:279-292 [Conf]
  10. Hariharan Subramanian, Priti Shankar
    Compressing XML Documents Using Recursive Finite State Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:282-293 [Conf]
  11. Siddhartha Rai, Priti Shankar
    Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2003, v:46, n:5, pp:476-486 [Journal]
  12. A. Unnikrishnan, Y. V. Venkatesh, Priti Shankar
    Connected Component Labelling Using Quadtrees - A Bottom-up Approach. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:2, pp:176-182 [Journal]
  13. H. K. Haripriyan, Y. N. Srikant, Priti Shankar
    A Compiler Writing System Based on Affix Grammars. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1988, v:13, n:1, pp:1-11 [Journal]
  14. Naveen Gabrani, Priti Shankar
    A Note on the Reconstruction of a Binary Tree from its Traversals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:2, pp:117-119 [Journal]
  15. Y. N. Srikant, Priti Shankar
    Parallel parsing of programming languages. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1987, v:43, n:1-2, pp:55-83 [Journal]
  16. Y. N. Srikant, Priti Shankar
    A new parallel algorithm for parsing arithmetic infix expressions. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1987, v:4, n:3, pp:291-304 [Journal]
  17. Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar
    Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2003, v:48, n:1, pp:1-20 [Journal]
  18. Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar
    A Simple Algorithm for Partial Redundancy Elimination. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1998, v:33, n:12, pp:35-43 [Journal]
  19. Sulekha R. Kulkarni, Priti Shankar
    Linear Time Parsers for Classes of Non Context Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:355-390 [Journal]
  20. Priti Shankar, B. S. Adiga
    A Graph-Based Regularity Test for Deterministic Context-free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:117-125 [Journal]
  21. Priti Shankar, B. S. Adiga
    Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:339-340 [Journal]
  22. Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan
    On viewing block codes as finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1775-1797 [Journal]
  23. Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan
    A new algorithm for linear regular tree pattern matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:125-142 [Journal]
  24. K. Murali Krishnan, Priti Shankar
    Computing the Stopping Distance of a Tanner Graph Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2278-2280 [Journal]
  25. Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna
    Extending Graham-Glanville techniques for optimal code generation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2000, v:22, n:6, pp:973-1001 [Journal]
  26. A. Unnikrishnan, Priti Shankar, Y. V. Venkatesh
    Threaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1988, v:14, n:5, pp:659-665 [Journal]
  27. K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
    A Combinatorial Family of Near Regular LDPC Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  28. Priti Shankar, P. N. A. Kumar, K. Sasidharan, B. Sundar Rajan, A. S. Madhu
    Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  29. K. Murali Krishnan, Priti Shankar
    Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  30. Algebraic Structure Theory of Tail-Biting Trellises. [Citation Graph (, )][DBLP]


  31. Deep Packet Inspection Using Message Passing Networks. [Citation Graph (, )][DBLP]


  32. Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. [Citation Graph (, )][DBLP]


  33. Approximate MAP Decoding on Tail-Biting Trellises [Citation Graph (, )][DBLP]


  34. On the Complexity of finding Stopping Distance in Tanner Graphs [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.154secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002