Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Priti Shankar
@incollection{DBLP:books/ws/automata2012/Shankar12,
author = {Priti Shankar},
editor = {Deepak D'Souza and
Priti Shankar},
title = {Syntax Directed Compression of Trees Using Pushdown Automata},
booktitle = {Modern Applications of Automata Theory},
series = {IISc Research Monographs Series},
volume = {2},
pages = {585--616},
publisher = {World Scientific},
year = {2012},
url = {https://doi.org/10.1142/9789814271059\_0019},
doi = {10.1142/9789814271059\_0019},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/automata2012/Shankar12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/ws/automata12,
editor = {Deepak D'Souza and
Priti Shankar},
title = {Modern Applications of Automata Theory},
series = {IISc Research Monographs Series},
volume = {2},
publisher = {World Scientific},
year = {2012},
url = {https://doi.org/10.1142/7237},
doi = {10.1142/7237},
isbn = {978-981-4271-04-2},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/ws/automata12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsa/MenonS08,
author = {Sreejith K. Menon and
Priti Shankar},
title = {{COMPASS} - {A} tool for evaluation of compression strategies for
embedded processors},
journal = {J. Syst. Archit.},
volume = {54},
number = {10},
pages = {995--1003},
year = {2008},
url = {https://doi.org/10.1016/j.sysarc.2008.04.015},
doi = {10.1016/J.SYSARC.2008.04.015},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsa/MenonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/raid/JainLS08,
author = {Divya Jain and
K. Vasanta Lakshmi and
Priti Shankar},
editor = {Richard Lippmann and
Engin Kirda and
Ari Trachtenberg},
title = {Deep Packet Inspection Using Message Passing Networks},
booktitle = {Recent Advances in Intrusion Detection, 11th International Symposium,
{RAID} 2008, Cambridge, MA, USA, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5230},
pages = {419--420},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87403-4\_35},
doi = {10.1007/978-3-540-87403-4\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/raid/JainLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/PrabhuS08,
author = {Prakash Prabhu and
Priti Shankar},
editor = {Mar{\'{\i}}a Alpuente and
Germ{\'{a}}n Vidal},
title = {Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap
Array {SSA}},
booktitle = {Static Analysis, 15th International Symposium, {SAS} 2008, Valencia,
Spain, July 16-18, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5079},
pages = {110--127},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69166-2\_8},
doi = {10.1007/978-3-540-69166-2\_8},
timestamp = {Wed, 25 Sep 2019 18:08:39 +0200},
biburl = {https://dblp.org/rec/conf/sas/PrabhuS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KrishnanS07,
author = {Karunakaran Murali Krishnan and
Priti Shankar},
title = {Computing the Stopping Distance of a Tanner Graph Is NP-Hard},
journal = {{IEEE} Trans. Inf. Theory},
volume = {53},
number = {6},
pages = {2278--2280},
year = {2007},
url = {https://doi.org/10.1109/TIT.2007.896864},
doi = {10.1109/TIT.2007.896864},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KrishnanS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Shankar07,
author = {Priti Shankar},
editor = {Serdar Boztas and
Hsiao{-}feng Lu},
title = {Algebraic Structure Theory of Tail-Biting Trellises},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
17th International Symposium, AAECC-17, Bangalore, India, December
16-20, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4851},
pages = {47},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77224-8\_7},
doi = {10.1007/978-3-540-77224-8\_7},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/Shankar07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Shankar07,
author = {Priti Shankar},
editor = {Madhavan Mukund and
K. Rangarajan and
K. G. Subramanian},
title = {An Application of Regular Tree Grammars},
booktitle = {Formal Models, Languages and Applications [this volume commemorates
the 75th birthday of Prof. Rani Siromoney]},
series = {Series in Machine Perception and Artificial Intelligence},
volume = {66},
pages = {337--353},
publisher = {World Scientific},
year = {2007},
url = {https://doi.org/10.1142/9789812773036\_0023},
doi = {10.1142/9789812773036\_0023},
timestamp = {Tue, 23 May 2017 01:06:47 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Shankar07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KrishnanSCS07,
author = {K. Murali Krishnan and
Rajdeep Singh and
L. Sunil Chandran and
Priti Shankar},
title = {A Combinatorial Family of Near Regular {LDPC} Codes},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007,
Nice, France, June 24-29, 2007},
pages = {761--765},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/ISIT.2007.4557316},
doi = {10.1109/ISIT.2007.4557316},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/KrishnanSCS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/CRCcompiler2007/PrabhuSS07,
author = {Prakash Prabhu and
Priti Shankar and
Y. N. Srikant},
editor = {Y. N. Srikant and
Priti Shankar},
title = {The Static Single Assignment Form: Construction and Application to
Program Optimization},
booktitle = {The Compiler Design Handbook: Optimizations and Machine Code Generation,
Second Edition},
pages = {11},
publisher = {{CRC} Press},
year = {2007},
timestamp = {Sun, 04 Aug 2019 17:44:34 +0200},
biburl = {https://dblp.org/rec/books/crc/CRCcompiler2007/PrabhuSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/CRCcompiler2007/Shankar07,
author = {Priti Shankar},
editor = {Y. N. Srikant and
Priti Shankar},
title = {Instruction Selection Using Tree Parsing},
booktitle = {The Compiler Design Handbook: Optimizations and Machine Code Generation,
Second Edition},
pages = {17},
publisher = {{CRC} Press},
year = {2007},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/CRCcompiler2007/Shankar07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/crc/Compiler07,
editor = {Y. N. Srikant and
Priti Shankar},
title = {The Compiler Design Handbook: Optimizations and Machine Code Generation,
Second Edition},
publisher = {{CRC} Press},
year = {2007},
isbn = {978-1-42-004382-2},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/Compiler07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciss/0001S06,
author = {K. Murali Krishnan and
Priti Shankar},
title = {On the Complexity of finding stopping set size in Tanner Graphs},
booktitle = {40th Annual Conference on Information Sciences and Systems, {CISS}
2006, Princeton, NJ, USA, 22-24 March 2006},
pages = {157--158},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/CISS.2006.286453},
doi = {10.1109/CISS.2006.286453},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciss/0001S06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/HariharanS06,
author = {S. Hariharan and
Priti Shankar},
title = {Evaluating the Role of Context in Syntax Directed Compression of {XML}
Documents},
booktitle = {2006 Data Compression Conference {(DCC} 2006), 28-30 March 2006, Snowbird,
UT, {USA}},
pages = {453},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/DCC.2006.34},
doi = {10.1109/DCC.2006.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/HariharanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KrishnanS06,
author = {K. Murali Krishnan and
Priti Shankar},
title = {Approximate Linear Time {ML} Decoding on Tail-Biting Trellises in
Two Rounds},
booktitle = {Proceedings 2006 {IEEE} International Symposium on Information Theory,
{ISIT} 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14,
2006},
pages = {2245--2249},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ISIT.2006.261966},
doi = {10.1109/ISIT.2006.261966},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/KrishnanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0601023,
author = {Priti Shankar and
P. N. A. Kumar and
K. Sasidharan and
B. Sundar Rajan and
A. S. Madhu},
title = {Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises},
journal = {CoRR},
volume = {abs/cs/0601023},
year = {2006},
url = {http://arxiv.org/abs/cs/0601023},
eprinttype = {arXiv},
eprint = {cs/0601023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0601023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0601126,
author = {K. Murali Krishnan and
Priti Shankar},
title = {Approximate Linear Time {ML} Decoding on Tail-Biting Trellises in
Two Rounds},
journal = {CoRR},
volume = {abs/cs/0601126},
year = {2006},
url = {http://arxiv.org/abs/cs/0601126},
eprinttype = {arXiv},
eprint = {cs/0601126},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0601126.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609146,
author = {K. Murali Krishnan and
Rajdeep Singh and
L. Sunil Chandran and
Priti Shankar},
title = {A Combinatorial Family of Near Regular {LDPC} Codes},
journal = {CoRR},
volume = {abs/cs/0609146},
year = {2006},
url = {http://arxiv.org/abs/cs/0609146},
eprinttype = {arXiv},
eprint = {cs/0609146},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MenonS05,
author = {Sreejith K. Menon and
Priti Shankar},
title = {An Instruction Set Architecture Based Code Compression Scheme for
Embedded Processors},
booktitle = {2005 Data Compression Conference {(DCC} 2005), 29-31 March 2005, Snowbird,
UT, {USA}},
pages = {470},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/DCC.2005.15},
doi = {10.1109/DCC.2005.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MenonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/LakshmiSRS05,
author = {K. Vasanta Lakshmi and
Deepak Sreedhar and
Easwaran Raman and
Priti Shankar},
editor = {David A. Bader and
Manish Parashar and
Sridhar Varadarajan and
Viktor K. Prasanna},
title = {Integrating a New Cluster Assignment and Scheduling Algorithm into
an Experimental Retargetable Code Generation Framework},
booktitle = {High Performance Computing - HiPC 2005, 12th International Conference,
Goa, India, December 18-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3769},
pages = {518--527},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602569\_53},
doi = {10.1007/11602569\_53},
timestamp = {Sat, 19 Oct 2019 20:28:58 +0200},
biburl = {https://dblp.org/rec/conf/hipc/LakshmiSRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/SyamalaS05,
author = {Madhu Achuthan Syamala and
Priti Shankar},
title = {Approximate {MAP} decoding on tail-biting trellises},
booktitle = {Proceedings of the 2005 {IEEE} International Symposium on Information
Theory, {ISIT} 2005, Adelaide, South Australia, Australia, 4-9 September
2005},
pages = {1325--1328},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ISIT.2005.1523557},
doi = {10.1109/ISIT.2005.1523557},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/SyamalaS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/MenonS05,
author = {Sreejith K. Menon and
Priti Shankar},
editor = {Hisham Haddad and
Lorie M. Liebrock and
Andrea Omicini and
Roger L. Wainwright},
title = {A code compression advisory tool for embedded processors},
booktitle = {Proceedings of the 2005 {ACM} Symposium on Applied Computing (SAC),
Santa Fe, New Mexico, USA, March 13-17, 2005},
pages = {863--867},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1066677.1066874},
doi = {10.1145/1066677.1066874},
timestamp = {Tue, 06 Nov 2018 11:06:45 +0100},
biburl = {https://dblp.org/rec/conf/sac/MenonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/SubramanianS05,
author = {Hariharan Subramanian and
Priti Shankar},
editor = {Jacques Farr{\'{e}} and
Igor Litovsky and
Sylvain Schmitz},
title = {Compressing {XML} Documents Using Recursive Finite State Automata},
booktitle = {Implementation and Application of Automata, 10th International Conference,
{CIAA} 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3845},
pages = {282--293},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11605157\_24},
doi = {10.1007/11605157\_24},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/wia/SubramanianS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0506009,
author = {A. S. Madhu and
Priti Shankar},
title = {Approximate {MAP} Decoding on Tail-Biting Trellises},
journal = {CoRR},
volume = {abs/cs/0506009},
year = {2005},
url = {http://arxiv.org/abs/cs/0506009},
eprinttype = {arXiv},
eprint = {cs/0506009},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0506009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512101,
author = {K. Murali Krishnan and
Priti Shankar},
title = {On the Complexity of finding Stopping Distance in Tanner Graphs},
journal = {CoRR},
volume = {abs/cs/0512101},
year = {2005},
url = {http://arxiv.org/abs/cs/0512101},
eprinttype = {arXiv},
eprint = {cs/0512101},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0512101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Shankar04,
author = {Priti Shankar},
title = {On the complexity of exact maximum likelihood decoding on tail-biting
trellises},
booktitle = {Proceedings of the 2004 {IEEE} International Symposium on Information
Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,
USA, June 27 - July 2, 2004},
pages = {104},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ISIT.2004.1365141},
doi = {10.1109/ISIT.2004.1365141},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/Shankar04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/RaiS03,
author = {Siddhartha Rai and
Priti Shankar},
title = {Efficient Statistical Modeling for the Compression of Tree Structured
Intermediate Code},
journal = {Comput. J.},
volume = {46},
number = {5},
pages = {476--486},
year = {2003},
url = {https://doi.org/10.1093/comjnl/46.5.476},
doi = {10.1093/COMJNL/46.5.476},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/RaiS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/PaleriSS03,
author = {Vineeth Kumar Paleri and
Y. N. Srikant and
Priti Shankar},
title = {Partial redundancy elimination: a simple, pragmatic, and provably
correct algorithm},
journal = {Sci. Comput. Program.},
volume = {48},
number = {1},
pages = {1--20},
year = {2003},
url = {https://doi.org/10.1016/S0167-6423(02)00083-7},
doi = {10.1016/S0167-6423(02)00083-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scp/PaleriSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarDDR03,
author = {Priti Shankar and
Amitava Dasgupta and
Kaustubh Deshmukh and
B. Sundar Rajan},
title = {On viewing block codes as finite automata},
journal = {Theor. Comput. Sci.},
volume = {290},
number = {3},
pages = {1775--1797},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00083-X},
doi = {10.1016/S0304-3975(02)00083-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarDDR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/PrakashSSS03,
author = {J. Prakash and
C. Sandeep and
Priti Shankar and
Y. N. Srikant},
title = {A Simple and Fast Scheme for Code Compression for {VLIW} Processors},
booktitle = {2003 Data Compression Conference {(DCC} 2003), 25-27 March 2003, Snowbird,
UT, {USA}},
pages = {444},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/DCC.2003.1194063},
doi = {10.1109/DCC.2003.1194063},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/PrakashSSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/CRCcompiler2002/Shankar02,
author = {Priti Shankar},
editor = {Y. N. Srikant and
Priti Shankar},
title = {Instruction Selection Using Tree Parsing},
booktitle = {The Compiler Design Handbook: Optimizations and Machine Code Generation},
pages = {565--602},
publisher = {{CRC} Press},
year = {2002},
url = {https://doi.org/10.1201/9781420040579.ch15},
doi = {10.1201/9781420040579.CH15},
timestamp = {Sun, 04 Aug 2019 17:44:34 +0200},
biburl = {https://dblp.org/rec/books/crc/CRCcompiler2002/Shankar02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/crc/Compiler02,
editor = {Y. N. Srikant and
Priti Shankar},
title = {The Compiler Design Handbook: Optimizations and Machine Code Generation},
publisher = {{CRC} Press},
year = {2002},
url = {https://doi.org/10.1201/9781420040579},
doi = {10.1201/9781420040579},
isbn = {0-8493-1240-X},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/Compiler02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ShankarKSR01,
author = {Priti Shankar and
P. N. A. Kumar and
Harmeet Singh and
B. Sundar Rajan},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy
to Construct},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {627--638},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_52},
doi = {10.1007/3-540-48224-5\_52},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ShankarKSR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarGYM00,
author = {Priti Shankar and
Amitranjan Gantait and
A. R. Yuvaraj and
Maya Madhavan},
title = {A new algorithm for linear regular tree pattern matching},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {125--142},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00205-9},
doi = {10.1016/S0304-3975(98)00205-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarGYM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/MadhavanSRR00,
author = {Maya Madhavan and
Priti Shankar and
Siddhartha Rai and
U. Ramakrishna},
title = {Extending Graham-Glanville techniques for optimal code generation},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {22},
number = {6},
pages = {973--1001},
year = {2000},
url = {https://doi.org/10.1145/371880.371881},
doi = {10.1145/371880.371881},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/MadhavanSRR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DeshmukhSDR00,
author = {Kaustubh Deshmukh and
Priti Shankar and
Amitava Dasgupta and
B. Sundar Rajan},
editor = {Horst Reichel and
Sophie Tison},
title = {On the Many Faces of Block Codes},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {53--64},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_4},
doi = {10.1007/3-540-46541-3\_4},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DeshmukhSDR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/ShankarSAR00,
author = {Priti Shankar and
K. Sasidharan and
Vikas Aggarwal and
B. Sundar Rajan},
editor = {Sheng Yu and
Andrei Paun},
title = {A Package for the Implementation of Block Codes as Finite Automata},
booktitle = {Implementation and Application of Automata, 5th International Conference,
{CIAA} 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2088},
pages = {279--292},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44674-5\_24},
doi = {10.1007/3-540-44674-5\_24},
timestamp = {Thu, 19 Mar 2020 15:28:05 +0100},
biburl = {https://dblp.org/rec/conf/wia/ShankarSAR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigplan/PaleriSS98,
author = {Vineeth Kumar Paleri and
Y. N. Srikant and
Priti Shankar},
title = {A Simple Algorithm for Partial Redundancy Elimination},
journal = {{ACM} {SIGPLAN} Notices},
volume = {33},
number = {12},
pages = {35--43},
year = {1998},
url = {https://doi.org/10.1145/307824.307851},
doi = {10.1145/307824.307851},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigplan/PaleriSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MadhavanS98,
author = {Maya Madhavan and
Priti Shankar},
editor = {Vikraman Arvind and
Ramaswamy Ramanujam},
title = {Optimal Regular Tree Pattern Matching Using Pushdown Automata},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1530},
pages = {122--133},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-49382-2\_11},
doi = {10.1007/978-3-540-49382-2\_11},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MadhavanS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KulkarniS96,
author = {Sulekha R. Kulkarni and
Priti Shankar},
title = {Linear Time Parsers for Classes of Non Context Free Languages},
journal = {Theor. Comput. Sci.},
volume = {165},
number = {2},
pages = {355--390},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00231-6},
doi = {10.1016/0304-3975(95)00231-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KulkarniS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GabraniS92,
author = {Naveen Gabrani and
Priti Shankar},
title = {A Note on the Reconstruction of a Binary Tree from its Traversals},
journal = {Inf. Process. Lett.},
volume = {42},
number = {2},
pages = {117--119},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90100-A},
doi = {10.1016/0020-0190(92)90100-A},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GabraniS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarA92,
author = {Priti Shankar and
B. S. Adiga},
title = {Corrigendum: {A} Graph-Based Regularity Test for Deterministic Context-Free
Languages},
journal = {Theor. Comput. Sci.},
volume = {95},
number = {2},
pages = {339--340},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90272-H},
doi = {10.1016/0304-3975(92)90272-H},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarA92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarA91,
author = {Priti Shankar and
B. S. Adiga},
title = {A Graph-Based Regularity Test for Deterministic Context-free Languages},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {117--125},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90076-E},
doi = {10.1016/0304-3975(91)90076-E},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cl/HaripriyanSS88,
author = {H. K. Haripriyan and
Y. N. Srikant and
Priti Shankar},
title = {A Compiler Writing System Based on Affix Grammars},
journal = {Comput. Lang.},
volume = {13},
number = {1},
pages = {1--11},
year = {1988},
url = {https://doi.org/10.1016/0096-0551(88)90002-1},
doi = {10.1016/0096-0551(88)90002-1},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cl/HaripriyanSS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tse/UnnikrishnanSV88,
author = {A. Unnikrishnan and
Priti Shankar and
Y. V. Venkatesh},
title = {Threaded Linear Hierarchical Quadtree for Computation of Geometric
Properties of Binary Images},
journal = {{IEEE} Trans. Software Eng.},
volume = {14},
number = {5},
pages = {659--665},
year = {1988},
url = {https://doi.org/10.1109/32.6143},
doi = {10.1109/32.6143},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tse/UnnikrishnanSV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/UnnikrishnanVS87,
author = {A. Unnikrishnan and
Y. V. Venkatesh and
Priti Shankar},
title = {Connected Component Labelling Using Quadtrees - {A} Bottom-up Approach},
journal = {Comput. J.},
volume = {30},
number = {2},
pages = {176--182},
year = {1987},
url = {https://doi.org/10.1093/comjnl/30.2.176},
doi = {10.1093/COMJNL/30.2.176},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/UnnikrishnanVS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/SrikantS87,
author = {Y. N. Srikant and
Priti Shankar},
title = {Parallel parsing of programming languages},
journal = {Inf. Sci.},
volume = {43},
number = {1-2},
pages = {55--83},
year = {1987},
url = {https://doi.org/10.1016/0020-0255(87)90031-4},
doi = {10.1016/0020-0255(87)90031-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/SrikantS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/SrikantS87,
author = {Y. N. Srikant and
Priti Shankar},
title = {A new parallel algorithm for parsing arithmetic infix expressions},
journal = {Parallel Comput.},
volume = {4},
number = {3},
pages = {291--304},
year = {1987},
url = {https://doi.org/10.1016/0167-8191(87)90028-7},
doi = {10.1016/0167-8191(87)90028-7},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/SrikantS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/UnnikrishnanVS87,
author = {A. Unnikrishnan and
Y. V. Venkatesh and
Priti Shankar},
title = {Distribution of black nodes at various levels in a linear quadtree},
journal = {Pattern Recognit. Lett.},
volume = {6},
number = {5},
pages = {341--342},
year = {1987},
url = {https://doi.org/10.1016/0167-8655(87)90017-1},
doi = {10.1016/0167-8655(87)90017-1},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/UnnikrishnanVS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Shankar79,
author = {Priti Shankar},
title = {On {BCH} codes over arbitrary integer tings (Corresp.)},
journal = {{IEEE} Trans. Inf. Theory},
volume = {25},
number = {4},
pages = {480--483},
year = {1979},
url = {https://doi.org/10.1109/TIT.1979.1056063},
doi = {10.1109/TIT.1979.1056063},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Shankar79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:34 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:
