Cited By
View all- Wierman AZwart B(2012)Is Tail-Optimal Scheduling Possible?Operations Research10.1287/opre.1120.108660:5(1249-1257)Online publication date: 1-Sep-2012
- Venkataramanan VLin X(2010)On wireless scheduling algorithms for minimizing the queue-overflow probabilityIEEE/ACM Transactions on Networking10.1109/TNET.2009.203789618:3(788-801)Online publication date: 1-Jun-2010
- Parag PChamberland J(2010)Queueing analysis of a butterfly network for comparing network coding to classical routingIEEE Transactions on Information Theory10.1109/TIT.2010.204086256:4(1890-1908)Online publication date: 1-Apr-2010
- Show More Cited By