Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Priti Shankar
Observed names:
P. Shankar,
Prof Priti Shankar,
Shankar, Priti
Observed institutions:
École Normale Supérieure Paris-Saclay,
Laboratoire Spécification et Vérification,
Indian Institute of Science Bangalore
OpenAlex ID:
A5013592136
On BCH codes over arbitrary integer tings (Corresp.)
1979
·
P. Shankar
·
IEEE Transactions on Information Theory
·
125
Compiler Design Handbook: Optimizations and Machine Code Generation
2002
·
Y. N. Srikant
, Priti Shankar
·
78
Computing the Stopping Distance of a Tanner Graph Is NP-Hard
2007
·
Karunakaran Murali Krishnan
, Priti Shankar
·
IEEE Transactions on Information Theory
·
68
PDF
The Compiler Design Handbook: Optimizations and Machine Code Generation
2002
·
Y.N. Srikant
, Priti Shankar
·
CRC Press eBooks
·
32
A simple and fast scheme for code compression for VLIW processors
2003
·
J. Prakash
, C. Sandeep
, et al.
·
DCC
·
30
Modern Applications of Automata Theory
2011
·
Deepak D'Souza
, Priti Shankar
·
Co-Published with Indian Institute of Science (IISc), Bangalore, India eBooks
·
28
Error correcting codes: 1. How numbers protect themselves
1996
·
Priti Shankar
·
Resonance
·
26
The Compiler Design Handbook: Optimizations and Machine Code Generation, Second Edition
2007
·
Y.N. Srikant
, Priti Shankar
·
CRC Press eBooks
·
25
On viewing block codes as finite automata
2003
·
Priti Shankar
, Amitava Dasgupta
, et al.
·
Theoretical Computer Science
·
23
PDF
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
2006
·
Shankar, Priti
, Kumar, P. N. A.
, et al.
·
arXiv (Cornell University)
·
20
PDF
A simple algorithm for partial redundancy elimination
1998
·
Vineeth Kumar Paleri
, Y. N. Srikant
, et al.
·
ACM SIGPLAN Notices
·
19
PDF
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm
2002
·
V.K. Paleri
, Y.N. Srikant
, et al.
·
Science of Computer Programming
·
17
PDF
Compressing XML Documents Using Recursive Finite State Automata
2006
·
Hariharan Subramanian
, Priti Shankar
·
Lecture notes in computer science
·
16
A new algorithm for linear regular tree pattern matching
2000
·
Priti Shankar
, Amitranjan Gantait
, et al.
·
Theoretical Computer Science
·
16
Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes
2006
·
A.V. Nori
, P. Shankar
·
IEEE Transactions on Information Theory
·
15
A new parallel algorithm for parsing arithmetic infix expressions
1987
·
Y.N Srikant
, Priti Shankar
·
Parallel Computing
·
10
On the Complexity of finding stopping set size in Tanner Graphs
2006
·
K. Krishnan
, Priti Shankar
·
Conference on Information Sciences and Systems
·
8
Extending Graham-Glanville techniques for optimal code generation
2000
·
Maya Madhavan
, Priti Shankar
, et al.
·
ACM Transactions on Programming Languages and Systems
·
8
Error correcting codes: 2. The Hamming codes
1997
·
Priti Shankar
·
Resonance
·
8
An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors
2005
·
S.K. Menon
, P. Shankar
·
DCC
·
7
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
2001
·
Priti Shankar
, P.N.A. Kumar
, et al.
·
Lecture notes in computer science
·
7
Error correcting codes: 3. Reed Solomon codes
1997
·
Priti Shankar
·
Resonance
·
7
Threaded linear hierarchical quadtrees for computation of geometric properties of binary images
1988
·
A. Unnikrishnan
, P. Shankar
, et al.
·
IEEE Transactions on Software Engineering
·
7
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA
2008
·
Prakash Prabhu
, Priti Shankar
·
Lecture notes in computer science
·
6
Evaluating the Role of Context in Syntax Directed Compression of XML Documents
2006
·
S. Hariharan
, P. Shankar
·
DCC
·
6
Show more works
View as search
Works count:
122
Citation count:
690
H-index:
15
I10-index:
16
Year
Topic
Type
