"An Efficient Algorithm for Computing Lower Bounds on Time and Processors ..."

B. S. Panda, Sajal K. Das (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-45307-5_5

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/hipc/PandaD01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hipc/PandaD01
B. S. Panda, Sajal K. Das:
An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. HiPC 2001: 47-57

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.