On Cartesian Trees and Range Minimum Queries. Demaine, E. D.; Landau, G. M.; and Weimann, O. Algorithmica, 68(3):610-625, 2014.
On Cartesian Trees and Range Minimum Queries [link]Paper  bibtex   
@article{ dblp1652339,
  title = {On Cartesian Trees and Range Minimum Queries},
  author = {Erik D. Demaine and Gad M. Landau and Oren Weimann},
  author_short = {Demaine, E. D. and Landau, G. M. and Weimann, O.},
  bibtype = {article},
  type = {article},
  year = {2014},
  key = {dblp1652339},
  id = {dblp1652339},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/DemaineLW14},
  url = {http://dx.doi.org/10.1007/s00453-012-9683-x},
  journal = {Algorithmica},
  pages = {610-625},
  number = {3},
  volume = {68},
  text = {Algorithmica 68(3):610-625 (2014)}
}
Downloads: 0