"Optimal binary search trees meet object-oriented programming."

Stuart Hansen, Lester I. McCann (2001)

> Home

Details and statistics

DOI: 10.5555/771141.771160

access: closed

type: Journal Article

metadata version: 2025-05-23

- view
  - electronic edition @ acm.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcscoll/HansenM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcscoll/HansenM01
Stuart Hansen, Lester I. McCann:
Optimal binary search trees meet object-oriented programming. J. Comput. Sci. Coll. 18(1): 97-106 (2001)

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.