Joel Wein

Associate Professor

Harvard University1985

Bachelor of Arts, Applied Mathematics and Computer Science

Hebrew University1986

Israel Fulbright Fellow, Mathematics and Computer Science

Massachusetts Institute of Technology1991

Doctor of Philosophy, Applied Mathematics

Akamai Technologies

Senior Research Scientist and subsequently Engineering Manager an

From: January 1999 to December 2003

Polytechnic Institute of New York University

Assistant Professor

From: September 1991 to August 1997

Polytechnic Institute of New York University

Associate Professor

From: September 1997 to present

Journal Articles

  • New Payload Attribution Methods for Network Forensic Investigations, Miroslav Ponec, Paul Giura, Joel Wein, Herve Bronimann. Accepted to ACM Transactions on Information and System Security.
  • "On the Relationship between Combinatorial and LP-Based Approaches to NP-hard Scheduling Problems" , R. N. Uma, Joel Wein and David P. Williamson. Theoretical Computer Science, special issue on Approximation Algorithms, September 2006, Volume 361, Numbers 2-3, pp 241--256. (Preliminary version appeared in the Proceedings of some of these results appeared in the 6th International IPCO Conference, June 1998. R. E. Bixby, E. A. Boyd, and R. Z. Rios-Mercado (eds.): Integer Programming and Combinatorial Optimization, LNCS 1412, Springer: Berlin, 1998, pp. 394-408.)
  • An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems," Martin W.P.Savelsbergh, R. N. Uma and Joel Wein. INFORMS Journal on Computing, Vol 17, Number 1, Winter 2005, pp. 123-136. (Preliminary version of some of the work appeared in SODA '98 and IPCO '98).
  • A Transport Layer for Live Streaming in a Content Delivery Network. Leonidas Kontothanassis, Ramesh Sitaraman, Joel Wein, Duke Hong, Robert Kleinberg, Brian Mancuso, David Shaw, and Daniel Stodolsky. Proceedings of the IEEE, Special Issue on Evolution of Internet Technologies 92(9):1408-1419 (September, 2004).
  • Techniques for Scheduling with Rejection," Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma and Joel Wein. Journal of Algorithms, 49, 2003, pp.175-191. (Preliminary Version appeared in the Proceedings of the 6th Annual European Symposium on Algorithms, August 1998. Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina and Geppino Pucci (eds.): Algorithms - ESA '98, LNCS 1461, Springer: Berlin, 1998, pp. 490-501.)
  • Optimal Time-Critical Scheduling Via Resource Augmentation coauthors: Cynthia A. Phillips, Cliff Stein, and Joel Wein Algorithmica, 32, pages 163-200, 2002. Preliminary version appeared in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 1997.
  • "Off-line Admission Control for General Scheduling Problems," Cindy A. Phillips, R. N. Uma and Joel Wein. Journal of Scheduling, Volume 3, Number 6, November-December 2000: Special Issue on Approximation Algorithms (Part 2). (Preliminary version appeared in the Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, January 2000.)
  • A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , with Michel Goemans and Joel Wein. Operations Research Letters, 26:149-154, 2000.
  • "Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem," with Cindy Phillips, Andreas Schulz ,David B. Shmoys, and Cliff Stein. The Journal of Combinatorial Optimization, 1(4):413-426, December 1998.
  • "Task Scheduling in Networks," with Cynthia Phillips and Cliff Stein. In SIAM Journal on Discrete Mathematics, 10(4):573--598. Preliminary version in Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, July 1994, pp. 290-301.
  • "Scheduling To Minimize Average Completion Time: Off-line and On-line Approximation Algorithms", with Leslie A. Hall, Andreas Schulz and David B. Shmoys. Mathematics of Operations Research 22, 1997, 513-544. A preliminary version of some of these results appeared in "Scheduling To Minimize Average Completion Time: Off-line and On-line Algorithms", with Leslie A. Hall and David B. Shmoys. Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, January 1996, pp. 142--151.
  • C. Stein and J. Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21, 1997.
  • "Job Scheduling in Rings," with Perry Fizzano, David Karger and Cliff Stein. Journal of Parallel and Distributed Computing, v.5 n.5, p.617-640, October 1988 Preliminary version appeared in Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1994, pp. 210--219.
  • Minimizing Average Completion Time in the Presence of Release Dates Cynthia Phillips, Clifford Stein, and Joel Wein, Mathematical Programming B, 82(1-2):199-224, June 1998. Preliminary version appeared in "Scheduling Jobs That Arrive Over Time." Proceedings of 1995 Workshop on Algorithms and Data Structures, August 1995, pp. 86--97.
  • "On the Existence of Schedules that are Near-Optimal for both Makespan and Total Weighted Completion Time", with Cliff Stein. Operations Research Letters, 21:115-122, 1997.
  •  "Scheduling Parallel Machines On-line," with David Shmoys and David Williamson. SIAM Journal of Computing, December 1995, 24:1313--1331. Preliminary version appeared in the Proceedings of the 1991 IEEE Symposium on Foundations of Computer Science, October 1991,pp. 131--140.
  •  "Improved Approximation Algorithms for Shop Scheduling," with David Shmoys and Cliff Stein. SIAM Journal of Computing, June 1994, 23:617--632. Preliminary version appeared in the Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, January 1991, pp. 148--157.
  • "The Parallel Approximability of the Minimum Cost Maximum Flow Problem," with Cliff Stein. Information Processing Letters, July 1992, 42:315--319.
  •  "Las Vegas RNC Algorithms for Unary Weighted Matching and T-join Problems." Information Processing Letters, November 1991, 40:161--167.
  • "On the Massively Parallel Solution of the Assignment Problem", with Stavros Zenios. The Journal of Parallel and Distributed Computing, October, 1991, pp. 228--237.Preliminary version appeared in Proceedings of the 3rd IEEE-NASA Symposium on the Frontiers of Massively Parallel Processing, October 1990, pp. 90--99.

Authored/Edited Books

"Scheduling Algorithms," David Karger, Cliff Stein, Joel Wein, in Algorithms and Theory of Computation Handbook by Mikhail J. Atallah (Editor), CRC Press, 1998.

Other Publications

  • 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
  • Miroslav Ponec, Paul Giura, Herve Bronnimann and Joel Wein. Highly Efficient Techniques for Network Forensics. In Proceedings of 14th ACM Conference on Computer and Communications Security, October 2007, pp 150-160.
  • Mike Afergan, Joel Wein, and Amy LaMeyer. Experience with Some Principles for Building an Internet-Scale Reliable System. In Proceedings of WORLDS '05, 2nd USENIX Workshop on Real, Large Distributed Systems, Dec. 2005.
  •  Andy Berkheimer, Phil Lisiecki, Alex Sherman, Joel Wein, "ACMS: Akamai Configuration Management System", in the Proceedings of NSDI '05, 2nd USENIX Symposium on Networked Systems Design and Implementation, May 2005.
  • Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips, Cliff Stein, Joel Wein, Scheduling an Industrial Production Facility, Lecture Notes in Computer Science, Volume 3064, Jul 2004, Pages 116 - 131.
  • An Active-Learning Approach to Teaching Parallel Algorithms, Proceedings of the Second Forum on Parallel Computing Curricula, 1997.
  • Load-Sharing in Heterogeneous Systems via Weighted Factoring," Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma and Joel Wein. Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures, June 1996, pp.318-327.
  • "Improved Scheduling Algorithms for Minsum Criteria", with Soumen Chakrabarti, Cynthia Phillips, Andreas Schulz , David Shmoys, and Cliff Stein. in ICALP '96.
  •  "On the Scalability of Dynamic Scheduling", with Ioana Banicescu, Susan Flynn Hummel and Chui-Tzi Wang. Proceedings of the Third Workshop on Languages, Compilers and Run-Time Systems for Scalable Parallel Computers, May 1995.

Research Interests

  • Scheduling
  • Parallel and distributed computing
  • Combinatorial optimization
  • Data mining
  • Algorithms