 | 2008 |
|---|
| 25 |       | Jay Sethuraman:
Stochastic Scheduling.
Encyclopedia of Algorithms 2008 |
| 24 | | Uriel G. Rothblum,
Jay Sethuraman:
Stochastic scheduling in an in-forest.
Discrete Optimization 5(2): 457-466 (2008) |
| 2007 |
|---|
| 23 | | Fei Li,
Jay Sethuraman,
Clifford Stein:
Better online buffer management.
SODA 2007: 199-208 |
| 22 | | Jay Sethuraman,
John N. Tsitsiklis:
Stochastic Search in a Forest Revisited.
Math. Oper. Res. 32(3): 589-593 (2007) |
| 2006 |
|---|
| 21 | | Jay Sethuraman,
Chung-Piaw Teo,
Liwen Qian:
Many-to-One Stable Matching: Geometry and Fairness.
Math. Oper. Res. 31(3): 581-596 (2006) |
| 2005 |
|---|
| 20 | | Fei Li,
Jay Sethuraman,
Clifford Stein:
An optimal online algorithm for packet scheduling with agreeable deadlines.
SODA 2005: 801-802 |
| 19 | | Jay Sethuraman,
Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks.
Algorithmica 43(1-2): 133-146 (2005) |
| 18 | | Lisa Fleischer,
Jay Sethuraman:
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.
Math. Oper. Res. 30(4): 916-938 (2005) |
| 2004 |
|---|
| 17 | | Akshay-Kumar Katta,
Jay Sethuraman:
A Note on Bandits with a Twist.
SIAM J. Discrete Math. 18(1): 110-113 (2004) |
| 2003 |
|---|
| 16 | | Jay Sethuraman,
Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks.
RANDOM-APPROX 2003: 153-164 |
| 15 | | Lisa Fleischer,
Jay Sethuraman:
Approximately optimal control of fluid networks.
SODA 2003: 56-65 |
| 14 | | Edward G. Coffman Jr.,
Jay Sethuraman,
Vadim G. Timkovsky:
Ideal preemptive schedules on two processors.
Acta Inf. 39(8): 597-612 (2003) |
| 13 | | Jay Sethuraman,
Chung-Piaw Teo,
Rakesh V. Vohra:
Integer Programming and Arrovian Social Welfare Functions.
Math. Oper. Res. 28(2): 309-326 (2003) |
| 12 | | Dimitris Bertsimas,
David Gamarnik,
Jay Sethuraman:
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective.
Operations Research 51(5): 798-813 (2003) |
| 2002 |
|---|
| 11 | | Jay Sethuraman,
Chung-Piaw Teo,
Rakesh Vohra:
Integer Programming and Arrovian Social Welfare Functions.
IPCO 2002: 194-211 |
| 10 | | Joel L. Wolf,
Mark S. Squillante,
Philip S. Yu,
Jay Sethuraman,
L. Ozsen:
Optimal crawling strategies for web search engines.
WWW 2002: 136-147 |
| 2001 |
|---|
| 9 | | Milind Dawande,
Jayant Kalagnanam,
Jay Sethuraman:
Variable Sized Bin Packing With Color Constraints.
Electronic Notes in Discrete Mathematics 7: 154-157 (2001) |
| 8 | | Joel L. Wolf,
Mark S. Squillante,
John Turek,
Philip S. Yu,
Jay Sethuraman:
Scheduling Algorithms for the Broadcast Delivery of Digital Products.
IEEE Trans. Knowl. Data Eng. 13(5): 721-741 (2001) |
| 7 | | Jay Sethuraman,
Chung-Piaw Teo:
A Polynomial-time Algorithm for the Bistable Roommates Problem.
J. Comput. Syst. Sci. 63(3): 486-497 (2001) |
| 6 | | Anton Riabov,
Jay Sethuraman:
Scheduling periodic task graphs with communication delays.
SIGMETRICS Performance Evaluation Review 29(3): 17-18 (2001) |
| 1999 |
|---|
| 5 | | Chung-Piaw Teo,
Jay Sethuraman,
Wee-Peng Tan:
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.
IPCO 1999: 429-438 |
| 4 |  | Charu C. Aggarwal,
Mark S. Squillante,
Joel L. Wolf,
Philip S. Yu,
Jay Sethuraman:
Optimizing Profits in the Broadcast Delivery of Multimedia Products.
Multimedia Information Systems 1999: 88-95 |
| 3 | | Jay Sethuraman,
Mark S. Squillante:
Optimal Stochastic Scheduling in Multiclass Parallel Queues.
SIGMETRICS 1999: 93-102 |
| 2 | | Jay Sethuraman,
Mark S. Squillante:
Optimal Scheduling of Multiclass Parallel Machines.
SODA 1999: 963-964 |
| 1997 |
|---|
| 1 | | Chung-Piaw Teo,
Jay Sethuraman:
LP Based Approach to Optimal Stable Matchings.
SODA 1997: 710-719 |
