default search action
Joel Wein
Person information
- affiliation: New York University Tandon School of Engineering, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j20]Erik Nygren, Ramesh K. Sitaraman
, Joel Wein:
Networked systems research at Akamai. ACM SIGOPS Oper. Syst. Rev. 44(3): 1 (2010) - [j19]Thomas Repantis, Jeff Cohen, Scott Smith, Joel Wein:
Scaling a monitoring infrastructure for the Akamai network. ACM SIGOPS Oper. Syst. Rev. 44(3): 20-26 (2010) - [j18]Miroslav Ponec, Paul Giura, Joel Wein, Hervé Brönnimann:
New payload attribution methods for network forensic investigations. ACM Trans. Inf. Syst. Secur. 13(2): 15:1-15:32 (2010) - [c22]Jeff Cohen, Thomas Repantis, Sean McDermott, Scott Smith, Joel Wein:
Keeping Track of 70, 000+ Servers: The Akamai Query System. LISA 2010 - [c21]Chi Zhang, Robert W. H. Fisher, Joel Wein:
I want to go home: Empowering the lost mobile device. WiMob 2010: 64-70
2000 – 2009
- 2009
- [c20]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
- [c19]Miroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein:
Highly efficient techniques for network forensics. CCS 2007: 150-160 - 2006
- [j17]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
- [j16]Martin W. P. Savelsbergh
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. INFORMS J. Comput. 17(1): 123-136 (2005) - [c18]Mike Afergan, Joel Wein, Amy LaMeyer:
Experience with Some Principles for Building an Internet-Scale Reliable System. WORLDS 2005 - [c17]Alex Sherman, Philip A. Lisiecki, Andy Berkheimer, Joel Wein:
ACMS: The Akamai Configuration Management System. NSDI 2005 - 2004
- [j15]Leonidas I. Kontothanassis, Ramesh K. Sitaraman
A transport layer for live streaming in a content delivery network. Proc. IEEE 92(9): 1408-1419 (2004) - [c16]Eyjolfur Ingi Asgeirsson
Scheduling an Industrial Production Facility. IPCO 2004: 116-131 - 2003
- [j14]Daniel W. Engels, David R. Karger
Techniques for scheduling with rejection. J. Algorithms 49(1): 175-191 (2003) - 2002
- [j13]Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 (2002) - 2000
- [j12]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) - [c15]Cynthia A. Phillips, R. N. Uma, Joel Wein:
Off-line admission control for general scheduling problems. SODA 2000: 879-888
1990 – 1999
- 1999
- [p1]David R. Karger, Cliff Stein, Joel Wein:
Scheduling Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j11]Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 (1998) - [j10]Cynthia A. Phillips, Clifford Stein, Joel Wein:
Minimizing average completion time in the presence of release dates. Math. Program. 82: 199-223 (1998) - [c14]Daniel W. Engels, David R. Karger
Techniques for Scheduling with Rejection. ESA 1998: 490-501 - [c13]R. N. Uma, Joel Wein:
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. IPCO 1998: 394-408 - [c12]Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. SODA 1998: 453-462 - 1997
- [j9]Perry Fizzano, David R. Karger
Distributed Job Scheduling in Rings. J. Parallel Distributed Comput. 45(2): 122-133 (1997) - [j8]Leslie A. Hall, Andreas S. Schulz
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22(3): 513-544 (1997) - [j7]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) - [j6]Cynthia A. Phillips, Clifford Stein, Joel Wein:
Task Scheduling in Networks. SIAM J. Discret. Math. 10(4): 573-598 (1997) - [c11]Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). STOC 1997: 140-149 - 1996
- [c10]Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz
Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657 - [c9]Leslie A. Hall, David B. Shmoys
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. SODA 1996: 142-151 - [c8]Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein:
Load-Sharing in Heterogeneous Systems via Weighted Factoring. SPAA 1996: 318-328 - 1995
- [j5]David B. Shmoys
Scheduling Parallel Machines On-Line. SIAM J. Comput. 24(6): 1313-1331 (1995) - [c7]Susan Flynn Hummel, Ioana Banicescu, Chui-Tzu Wang, Joel Wein:
Load Balancing and Data Locality Via Fractiling: An Experimental Study. LCR 1995: 85-98 - [c6]Cynthia A. Phillips, Clifford Stein, Joel Wein:
Scheduling Jobs that Arrive Over Time (Extended Abstract). WADS 1995: 86-97 - 1994
- [j4]David B. Shmoys
Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. 23(3): 617-632 (1994) - [c5]Perry Fizzano, David R. Karger
Job Scheduling in Rings. SPAA 1994: 210-219 - [c4]Cynthia A. Phillips, Clifford Stein, Joel Wein:
Task Scheduling in Networks (Extended Abstract). SWAT 1994: 290-301 - 1992
- [j3]Clifford Stein, Joel Wein:
Approximating the Minimum-Cost Maximum Flow is P-Complete. Inf. Process. Lett. 42(6): 315-319 (1992) - 1991
- [j2]Joel Wein:
Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems. Inf. Process. Lett. 40(3): 161-167 (1991) - [j1]Joel Wein, Stavros A. Zenios
On the Massively Parallel Solution of the Assignment Problem. J. Parallel Distributed Comput. 13(2): 228-236 (1991) - [c3]David B. Shmoys
Scheduling Parallel Machines On-line. On-Line Algorithms 1991: 163-166 - [c2]David B. Shmoys
Scheduling Parallel Machines On-Line. FOCS 1991: 131-140 - [c1]David B. Shmoys
Improved Approximation Algorithms for Shop Scheduling Problems. SODA 1991: 148-157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: