Joel Wein

2.9k total citations
40 papers, 1.6k citations indexed

About

Joel Wein is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Joel Wein has authored 40 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computer Networks and Communications, 20 papers in Industrial and Manufacturing Engineering and 7 papers in Computational Theory and Mathematics. Recurrent topics in Joel Wein's work include Optimization and Search Problems (23 papers), Scheduling and Optimization Algorithms (20 papers) and Distributed and Parallel Computing Systems (10 papers). Joel Wein is often cited by papers focused on Optimization and Search Problems (23 papers), Scheduling and Optimization Algorithms (20 papers) and Distributed and Parallel Computing Systems (10 papers). Joel Wein collaborates with scholars based in United States, Germany and Japan. Joel Wein's co-authors include David B. Shmoys, Clifford Stein, L. A. Hall, Cynthia A. Phillips, Andreas S. Schulz, R. Uma, David P. Williamson, David R. Karger, Eric Torng and Susan Flynn Hummel and has published in prestigious journals such as Proceedings of the IEEE, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Joel Wein

38 papers receiving 1.4k citations

Peers

Joel Wein
Edward G. Coffman United States
Kirk Pruhs United States
C. Greg Plaxton United States
Richard W. Conway United States
Tami Tamir Israel
Jeffrey M. Jaffe United States
J.A. Hoogeveen Netherlands
Joel Wein
Citations per year, relative to Joel Wein Joel Wein (= 1×) peers Susanne Albers

Countries citing papers authored by Joel Wein

Since Specialization
Citations

This map shows the geographic impact of Joel Wein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joel Wein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joel Wein more than expected).

Fields of papers citing papers by Joel Wein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joel Wein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joel Wein. The network helps show where Joel Wein may publish in the future.

Co-authorship network of co-authors of Joel Wein

This figure shows the co-authorship network connecting the top 25 collaborators of Joel Wein. A scholar is included among the top collaborators of Joel Wein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joel Wein. Joel Wein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Wein, Joel, et al.. (2010). Keeping track of 70,000+ servers: the akamai query system. USENIX Large Installation Systems Administration Conference. 1–13. 9 indexed citations
2.
Wein, Joel & Miroslav Ponec. (2010). Utility Maximization in P2P Systems.
3.
Zhang, Chi, et al.. (2010). I want to go home: Empowering the lost mobile device. 1. 64–70. 1 indexed citations
4.
Wein, Joel, et al.. (2009). Virtualized games for teaching about distributed systems. ACM SIGCSE Bulletin. 41(1). 246–250. 4 indexed citations
5.
Wein, Joel, et al.. (2009). Virtualized games for teaching about distributed systems. 246–250. 7 indexed citations
6.
Ponec, Miroslav, et al.. (2007). Highly efficient techniques for network forensics. 150–160. 20 indexed citations
7.
Uma, RN, Joel Wein, & David P. Williamson. (2006). On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theoretical Computer Science. 361(2-3). 241–256. 4 indexed citations
8.
Sherman, Alex, et al.. (2005). ACMS: the Akamai configuration management system. Networked Systems Design and Implementation. 245–258. 20 indexed citations
9.
Wein, Joel, et al.. (2005). Experience with some principles for building an internet-scale reliable system. 1–6. 17 indexed citations
10.
Engels, Daniel W., David R. Karger, Stavros G. Kolliopoulos, et al.. (2003). Techniques for scheduling with rejection. Journal of Algorithms. 49(1). 175–191. 109 indexed citations
11.
Wein, Joel & R. Uma. (2001). Theoretical and experimental perspectives on hard scheduling problems. 3 indexed citations
12.
Phillips, Cynthia A., R. Uma, & Joel Wein. (2000). Off-line admission control for general scheduling problems. Symposium on Discrete Algorithms. 879–888. 29 indexed citations
13.
Savelsbergh, Martin, R. Uma, & Joel Wein. (1998). An experimental study of LP-based approximation algorithms for scheduling problems. Symposium on Discrete Algorithms. 453–462. 22 indexed citations
14.
Phillips, Cynthia A., Clifford Stein, & Joel Wein. (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming. 82(1-2). 199–223. 103 indexed citations
15.
Stein, Clifford & Joel Wein. (1997). On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters. 21(3). 115–122. 65 indexed citations
16.
Phillips, Cynthia A., Clifford Stein, Eric Torng, & Joel Wein. (1997). Optimal time-critical scheduling via resource augmentation (extended abstract). 140–149. 117 indexed citations
17.
Hall, L. A., David B. Shmoys, & Joel Wein. (1996). Scheduling to minimize average completion time: off-line and on-line algorithms. Symposium on Discrete Algorithms. 142–151. 97 indexed citations
18.
Hummel, Susan Flynn, Jeanette P. Schmidt, R. Uma, & Joel Wein. (1996). Load-sharing in heterogeneous systems via weighted factoring. 318–328. 79 indexed citations
19.
Wein, Joel & Stavros A. Zenios. (1991). On the massively parallel solution of the assignment problem. Journal of Parallel and Distributed Computing. 13(2). 228–236. 15 indexed citations
20.
Wein, Joel. (1991). Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems. Information Processing Letters. 40(3). 161–167. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026