Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Gad Landau, and Oren Weimann, “On Cartesian Trees and Range Minimum Queries”, Algorithmica, volume 68, number 3, 2014, pages 610–625.

BibTeX

@Article{Cartesian_Algorithmica,
  AUTHOR        = {Erik D. Demaine and Gad Landau and Oren Weimann},
  TITLE         = {On {Cartesian} Trees and Range Minimum Queries},
  JOURNAL       = {Algorithmica},
  journalurl    = {https://www.springer.com/journal/453},
  VOLUME        = 68,
  NUMBER        = 3,
  PAGES         = {610--625},
  YEAR          = 2014,

  replaces      = {Cartesian_ICALP2009},
  papers        = {Cartesian_ICALP2009},
  doi           = {https://dx.doi.org/10.1007/s00453-012-9683-x},
  dblp          = {https://dblp.org/rec/journals/algorithmica/DemaineLW14},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/s00453-012-9683-x">SpringerLink</A>.},
}

Comments:

This paper is also available from SpringerLink.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

Cartesian_ICALP2009 (On Cartesian Trees and Range Minimum Queries)