"On fundamental tradeoffs between delay bounds and computational complexity ..."

Jun (Jim) Xu, Richard J. Lipton (2002)

> Home

Details and statistics

DOI: 10.1145/633025.633052

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-21

- view
  authority control:
- export record
  dblp key:
  - conf/sigcomm/XuL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcomm/XuL02
Jun (Jim) Xu, Richard J. Lipton:
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. SIGCOMM 2002: 279-292

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.