%0 Conference Paper %1 conf/fsttcs/MadhavanS98 %A Madhavan, Maya %A Shankar, Priti %B FSTTCS %D 1998 %E Arvind, Vikraman %E Ramanujam, Ramaswamy %I Springer %K dblp %P 122-133 %T Optimal Regular Tree Pattern Matching Using Pushdown Automata. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs98.html#MadhavanS98 %V 1530 %@ 3-540-65384-8

@inproceedings{conf/fsttcs/MadhavanS98, added-at = {2017-05-23T00:00:00.000+0200}, author = {Madhavan, Maya and Shankar, Priti}, biburl = {https://www.bibsonomy.org/bibtex/2a6dba7f28228fb45b4547dbe71697685/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/1998}, editor = {Arvind, Vikraman and Ramanujam, Ramaswamy}, ee = {https://doi.org/10.1007/978-3-540-49382-2_11}, interhash = {1cd404854664d2d5c7b81bd53f8fb1fd}, intrahash = {a6dba7f28228fb45b4547dbe71697685}, isbn = {3-540-65384-8}, keywords = {dblp}, pages = {122-133}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:08:53.000+0200}, title = {Optimal Regular Tree Pattern Matching Using Pushdown Automata.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs98.html#MadhavanS98}, volume = 1530, year = 1998 }