<?xml version="1.0"?>
<dblp>
<article key="journals/tcs/SzwarcfiterNBOCZ03" mdate="2011-09-07">
<author>Jayme Luiz Szwarcfiter</author>
<author>Gonzalo Navarro</author>
<author>Ricardo A. Baeza-Yates</author>
<author>Jo&#237;sa de S. Oliveira</author>
<author>Walter Cunto</author>
<author>Nivio Ziviani</author>
<title>Optimal binary search trees with costs depending on the access paths.</title>
<pages>1799-1814</pages>
<year>2003</year>
<volume>290</volume>
<journal>Theor. Comput. Sci.</journal>
<number>3</number>
<url>db/journals/tcs/tcs290.html#SzwarcfiterNBOCZ03</url>
<ee>http://dx.doi.org/10.1016/S0304-3975(02)00084-1</ee>
</article>
</dblp>
