Adversarial Queueing Theory¶
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., & Williamson, D. P. (1996). Adversarial Queueing Theory. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 376-385.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Adversarial Queueing Network
- The expanded 2001 paper is the source for the general per-edge formulation; its 1996 conference predecessor presents a preliminary path-packing formulation and should not be silently substituted for it.
This sourceOriginal conference paper; its preliminary load formulation is distinguished here from the later expanded formulation.
- The expanded 2001 paper is the source for the general per-edge formulation; its 1996 conference predecessor presents a preliminary path-packing formulation and should not be silently substituted for it.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:11a53db64c2f · see in the full table