"The Time complexity of Scheduling Interval Orders with Communication Is ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Hesham H. Ali, Hesham El-Rewini (1993)

> Home

Details and statistics

DOI: 10.1142/S0129626493000083

access: closed

type: Journal Article

metadata version: 2020-03-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ppl/AliE93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/AliE93
Hesham H. Ali, Hesham El-Rewini:
The Time complexity of Scheduling Interval Orders with Communication Is Polynomial. Parallel Process. Lett. 3: 53-58 (1993)

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.