"The Complexity of Parallel Multisearch on Coarse-Grained Machines."

Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina (1999)

> Home

Details and statistics

DOI: 10.1007/PL00008261

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BaumkerDP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BaumkerDP99
Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999)

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.