2009 |
32 | EE | Joel Wein,
Kirill Kourtchikov,
Yan Cheng,
Ron Gutierez,
Roman Khmelichek,
Matthew Topol,
Chris Sherman:
Virtualized games for teaching about distributed systems.
SIGCSE 2009: 246-250 |
2007 |
31 | EE | Miroslav Ponec,
Paul Giura,
Hervé Brönnimann,
Joel Wein:
Highly efficient techniques for network forensics.
ACM Conference on Computer and Communications Security 2007: 150-160 |
2006 |
30 | EE | R. N. Uma,
Joel Wein,
David P. Williamson:
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems.
Theor. Comput. Sci. 361(2-3): 241-256 (2006) |
2005 |
29 | EE | Alex Sherman,
Philip A. Lisiecki,
Andy Berkheimer,
Joel Wein:
ACMS: The Akamai Configuration Management System.
NSDI 2005 |
28 | EE | Martin W. P. Savelsbergh,
R. N. Uma,
Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
INFORMS Journal on Computing 17(1): 123-136 (2005) |
2004 |
27 | EE | Eyjolfur Asgeirsson,
Jonathan W. Berry,
Cynthia A. Phillips,
David J. Phillips,
Clifford Stein,
Joel Wein:
Scheduling an Industrial Production Facility.
IPCO 2004: 116-131 |
2003 |
26 | EE | Daniel W. Engels,
David R. Karger,
Stavros G. Kolliopoulos,
Sudipta Sengupta,
R. N. Uma,
Joel Wein:
Techniques for scheduling with rejection.
J. Algorithms 49(1): 175-191 (2003) |
2002 |
25 | EE | Cynthia A. Phillips,
Clifford Stein,
Eric Torng,
Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation.
Algorithmica 32(2): 163-200 (2002) |
2000 |
24 | EE | Cynthia A. Phillips,
R. N. Uma,
Joel Wein:
Off-line admission control for general scheduling problems.
SODA 2000: 879-888 |
23 | EE | Michel X. Goemans,
Joel Wein,
David P. Williamson:
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem.
Oper. Res. Lett. 26(4): 149-154 (2000) |
1998 |
22 | EE | Daniel W. Engels,
David R. Karger,
Stavros G. Kolliopoulos,
Sudipta Sengupta,
R. N. Uma,
Joel Wein:
Techniques for Scheduling with Rejection.
ESA 1998: 490-501 |
21 | EE | R. N. Uma,
Joel Wein:
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.
IPCO 1998: 394-408 |
20 | | Martin W. P. Savelsbergh,
R. N. Uma,
Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
SODA 1998: 453-462 |
19 | | Cynthia A. Phillips,
Andreas S. Schulz,
David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.
J. Comb. Optim. 1(4): 413-426 (1998) |
18 | | Cynthia A. Phillips,
Clifford Stein,
Joel Wein:
Minimizing average completion time in the presence of release dates.
Math. Program. 82: 199-223 (1998) |
1997 |
17 | EE | Cynthia A. Phillips,
Clifford Stein,
Eric Torng,
Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).
STOC 1997: 140-149 |
16 | | Perry Fizzano,
David R. Karger,
Clifford Stein,
Joel Wein:
Distributed Job Scheduling in Rings.
J. Parallel Distrib. Comput. 45(2): 122-133 (1997) |
15 | EE | Clifford Stein,
Joel Wein:
On the existence of schedules that are near-optimal for both makespan and total weighted completion time.
Oper. Res. Lett. 21(3): 115-122 (1997) |
14 | EE | Cynthia A. Phillips,
Clifford Stein,
Joel Wein:
Task Scheduling in Networks.
SIAM J. Discrete Math. 10(4): 573-598 (1997) |
1996 |
13 | | Soumen Chakrabarti,
Cynthia A. Phillips,
Andreas S. Schulz,
David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Scheduling Algorithms for Minsum Criteria.
ICALP 1996: 646-657 |
12 | | Leslie A. Hall,
David B. Shmoys,
Joel Wein:
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms.
SODA 1996: 142-151 |
11 | | Susan Flynn Hummel,
Jeanette P. Schmidt,
R. N. Uma,
Joel Wein:
Load-Sharing in Heterogeneous Systems via Weighted Factoring.
SPAA 1996: 318-328 |
1995 |
10 | | Cynthia A. Phillips,
Clifford Stein,
Joel Wein:
Scheduling Jobs that Arrive Over Time (Extended Abstract).
WADS 1995: 86-97 |
9 | | David B. Shmoys,
Joel Wein,
David P. Williamson:
Scheduling Parallel Machines On-Line.
SIAM J. Comput. 24(6): 1313-1331 (1995) |
1994 |
8 | EE | Perry Fizzano,
David R. Karger,
Clifford Stein,
Joel Wein:
Job Scheduling in Rings.
SPAA 1994: 210-219 |
7 | | Cynthia A. Phillips,
Clifford Stein,
Joel Wein:
Task Scheduling in Networks (Extended Abstract).
SWAT 1994: 290-301 |
6 | | David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Approximation Algorithms for Shop Scheduling Problems.
SIAM J. Comput. 23(3): 617-632 (1994) |
1992 |
5 | | Clifford Stein,
Joel Wein:
Approximating the Minimum-Cost Maximum Flow is P-Complete.
Inf. Process. Lett. 42(6): 315-319 (1992) |
1991 |
4 | | David B. Shmoys,
Joel Wein,
David P. Williamson:
Scheduling Parallel Machines On-Line
FOCS 1991: 131-140 |
3 | | David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Approximation Algorithms for Shop Scheduling Problems.
SODA 1991: 148-157 |
2 | | Joel Wein:
Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.
Inf. Process. Lett. 40(3): 161-167 (1991) |
1 | | Joel Wein,
Stavros A. Zenios:
On the Massively Parallel Solution of the Assignment Problem.
J. Parallel Distrib. Comput. 13(2): 228-236 (1991) |