Joel Wein

Affiliations:
  • New York University Tandon School of Engineering, New York City, USA


According to our database1, Joel Wein authored at least 38 papers between 1991 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
New payload attribution methods for network forensic investigations.
ACM Trans. Inf. Syst. Secur., 2010

Scaling a monitoring infrastructure for the Akamai network.
ACM SIGOPS Oper. Syst. Rev., 2010

Networked systems research at Akamai.
ACM SIGOPS Oper. Syst. Rev., 2010

I want to go home: Empowering the lost mobile device.
Proceedings of the IEEE 6th International Conference on Wireless and Mobile Computing, 2010

Keeping Track of 70, 000+ Servers: The Akamai Query System.
Proceedings of the Uncovering the Secrets of System Administration: Proceedings of the 24th Large Installation System Administration Conference, 2010

2009
Virtualized games for teaching about distributed systems.
Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

2007
Highly efficient techniques for network forensics.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

2006
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems.
Theor. Comput. Sci., 2006

2005
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
INFORMS J. Comput., 2005

ACMS: The Akamai Configuration Management System.
Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI 2005), 2005

Experience with Some Principles for Building an Internet-Scale Reliable System.
Proceedings of the Second USENIX Workshop on Real, Large Distributed Systems, 2005

2004
A transport layer for live streaming in a content delivery network.
Proc. IEEE, 2004

Scheduling an Industrial Production Facility.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Techniques for scheduling with rejection.
J. Algorithms, 2003

2002
Optimal Time-Critical Scheduling via Resource Augmentation.
Algorithmica, 2002

2000
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem.
Oper. Res. Lett., 2000

Off-line admission control for general scheduling problems.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Scheduling Algorithms.
Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998
Minimizing average completion time in the presence of release dates.
Math. Program., 1998

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.
J. Comb. Optim., 1998

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Task Scheduling in Networks.
SIAM J. Discret. Math., 1997

On the existence of schedules that are near-optimal for both makespan and total weighted completion time.
Oper. Res. Lett., 1997

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.
Math. Oper. Res., 1997

Distributed Job Scheduling in Rings.
J. Parallel Distributed Comput., 1997

Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Load-Sharing in Heterogeneous Systems via Weighted Factoring.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Improved Scheduling Algorithms for Minsum Criteria.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Scheduling Parallel Machines On-Line.
SIAM J. Comput., 1995

Scheduling Jobs that Arrive Over Time (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Load Balancing and Data Locality Via Fractiling: An Experimental Study.
Proceedings of the Languages, 1995

1994
Improved Approximation Algorithms for Shop Scheduling Problems.
SIAM J. Comput., 1994

Task Scheduling in Networks (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

Job Scheduling in Rings.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1992
Approximating the Minimum-Cost Maximum Flow is P-Complete.
Inf. Process. Lett., 1992

1991
On the Massively Parallel Solution of the Assignment Problem.
J. Parallel Distributed Comput., 1991

Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.
Inf. Process. Lett., 1991


  Loading...