"Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for ..."

Jianer Chen, Iyad A. Kanj, Ge Xia (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-24587-2_17

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/ChenKX03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ChenKX03
Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157

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.