A Simple Optimal Representation for Balanced Parentheses

Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman. A Simple Optimal Representation for Balanced Parentheses. In Süleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusöz, editors, Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings. Volume 3109 of Lecture Notes in Computer Science, pages 159-172, Springer, 2004. [doi]

@inproceedings{GearyRRR04,
  title = {A Simple Optimal Representation for Balanced Parentheses},
  author = {Richard F. Geary and Naila Rahman and Rajeev Raman and Venkatesh Raman},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3109&spage=159},
  researchr = {https://researchr.org/publication/GearyRRR04},
  cites = {0},
  citedby = {0},
  pages = {159-172},
  booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings},
  editor = {Süleyman Cenk Sahinalp and S. Muthukrishnan and Ugur Dogrusöz},
  volume = {3109},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22341-X},
}