"An Approximation Algorithm for Binary Searching in Trees."

Eduardo Sany Laber, Marco Molinaro (2011)

> Home

Details and statistics

DOI: 10.1007/S00453-009-9325-0

access: closed

type: Journal Article

metadata version: 2022-03-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/LaberM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/LaberM11
Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59(4): 601-620 (2011)

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.