APA (7th ed.) Citation

Xu, J., & Lipton, R. J. (2005). On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms. IEEE/ACM Transactions on Networking, 13(1), 15. https://doi.org/10.1109/TNET.2004.842223

Chicago Style (17th ed.) Citation

Xu, Jun, and Richard J. Lipton. "On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms." IEEE/ACM Transactions on Networking 13, no. 1 (2005): 15. https://doi.org/10.1109/TNET.2004.842223.

MLA (9th ed.) Citation

Xu, Jun, and Richard J. Lipton. "On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms." IEEE/ACM Transactions on Networking, vol. 13, no. 1, 2005, p. 15, https://doi.org/10.1109/TNET.2004.842223.