"Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor ..."

Edward G. Coffman Jr., M. R. Garey (1991)

> Home

Details and statistics

DOI: 10.1145/103418.103447

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/CoffmanG91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/CoffmanG91
Edward G. Coffman Jr., M. R. Garey:
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. STOC 1991: 241-248

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.