Priti Shankar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Syntax directed compression of trees using pushdown automata Modern Applications of Automata Theory	2013-02-26	Paper
Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes IEEE Transactions on Information Theory	2008-12-21	Paper
Implementation and Application of Automata Lecture Notes in Computer Science	2006-11-13	Paper
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code The Computer Journal	2004-07-12	Paper
On viewing block codes as finite automata. Theoretical Computer Science	2003-08-17	Paper
Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm. Science of Computer Programming	2003-08-13	Paper
scientific article; zbMATH DE number 1775631 (Why is no real title available?)	2002-08-04	Paper
scientific article; zbMATH DE number 1500506 (Why is no real title available?)	2000-11-22	Paper
A new algorithm for linear regular tree pattern matching Theoretical Computer Science	2000-08-21	Paper
Linear time parsers for classes of non context free languages Theoretical Computer Science	1997-02-27	Paper
A note on the reconstruction of a binary tree from its traversals Information Processing Letters	1993-01-16	Paper
A graph-based regularity test for deterministic context-free languages Theoretical Computer Science	1992-06-26	Paper
A compiler writing system based on affix grammars Computer Languages	1988-01-01	Paper
Parallel parsing of programming languages Information Sciences	1987-01-01	Paper
A new parallel algorithm for parsing arithmetic infix expressions Parallel Computing	1987-01-01	Paper
On BCH codes over arbitrary integer tings (Corresp.) IEEE Transactions on Information Theory	1979-01-01	Paper

Research outcomes over time

This page was built for person: Priti Shankar