"Optimal binary search trees with costs depending on the access paths."

Jayme Luiz Szwarcfiter et al. (2003)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(02)00084-1

access: open

type: Journal Article

metadata version: 2024-02-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/SzwarcfiterNBOCZ03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/SzwarcfiterNBOCZ03
Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani:
Optimal binary search trees with costs depending on the access paths. Theor. Comput. Sci. 290(3): 1799-1814 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.