"Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case ..."

Mark H. Overmars, Jan van Leeuwen (1981)

> Home

Details and statistics

DOI: 10.1007/BFB0017314

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/tcs/OvermarsL81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tcs/OvermarsL81
Mark H. Overmars, Jan van Leeuwen:
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science 1981: 224-233

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.