World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
8913
World Ranking
10026
National Ranking
4225

Alexander L. Stolyar publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Alexander L. Stolyar sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 100 publications — 8th percentile

8% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Alexander L. Stolyar D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Alexander L. Stolyar sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 38 D-Index — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Alexander L. Stolyar is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their research spans across multiple disciplines, primarily focusing on Business, Management and Accounting, and Computer Science. Within these broader fields, their work concentrates on Management Information Systems and Computer Networks and Communications, with significant contributions also in Mathematical Physics, Industrial and Manufacturing Engineering, and Condensed Matter Physics.

Their scholarly output reflects a strong emphasis on several complex and technical topics. These include Advanced Queuing Theory Analysis, Supply Chain and Inventory Management, Stochastic Processes and Statistical Mechanics, Theoretical and Computational Physics, Random Matrices and Applications, Optimization and Search Problems, as well as Distributed Systems and Fault Tolerance.

Alexander L. Stolyar has published in a variety of academic venues, often contributing to specialized journals and preprint repositories. Frequent publication venues include arXiv (Cornell University), Operations Research, SSRN Electronic Journal, Queueing Systems, and Stochastic Systems.

Notable recent papers by Stolyar or closely associated with their research include:

  • Large-scale parallel server system with multi-component jobs, 2021, Queueing Systems
  • Exploiting Random Lead Times for Significant Inventory Cost Savings, 2021, Operations Research
  • Asymptotic Optimality of Open-Loop Policies in Lost-Sales Inventory Models with Stochastic Lead Times, 2023, SSRN Electronic Journal
  • Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models, 2023, Mathematics of Operations Research
  • Asymptotic Optimality of Semi-Open-Loop Policies in Markov Decision Processes with Large Lead Times, 2023, Operations Research

Throughout their career, Stolyar has collaborated regularly with several researchers, including Xin Chen, Xingyu Bai, Seva Shneer, Menglong Li, and Aditi Taneja. These collaborations have contributed to the diversity and depth of their research topics across inventory management and queuing theory.

Best Publications

  • Providing quality of service over a shared wireless link

    M. Andrews;K. Kumaran;K. Ramanan;A. Stolyar

  • Scheduling algorithms for a mixture of real-time and non-real-time data in HDR

    Sanjay Shakkottai;Sanjay Shakkottai;Alexander L. Stolyar

  • Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

    Alexander L. Stolyar

  • MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic

    Alexander L. Stolyar

  • Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule

    Avishai Mandelbaum;Alexander L. Stolyar

  • Scheduling for multiple flows sharing a time-varying channel: the exponential rule

    Unknown

  • SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

    Matthew Andrews;Krishnan Kumaran;Kavita Ramanan;Alexander Stolyar

  • On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

    Alexander L. Stolyar

  • Optimal utility based multi-user throughput allocation subject to throughput constraints

    M. Andrews;L. Qian;A. Stolyar

  • LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY

    Alexander L. Stolyar;Kavita Ramanan

  • Self-Organizing Dynamic Fractional Frequency Reuse in OFDMA Systems

    A.L. Stolyar;H. Viswanathan

  • Self-Organizing Dynamic Fractional Frequency Reuse for Best-Effort Traffic through Distributed Inter-Cell Coordination

    A. L. Stolyar;H. Viswanathan

  • Pull-based load distribution in large-scale heterogeneous service systems

    Alexander L. Stolyar

  • Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing

    L. Bui;R. Srikant;A. Stolyar

  • Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks

    U. Akyol;M. Andrews;P. Gupta;J. Hobby

  • Pathwise optimality of the exponential scheduling rule for wireless channels

    Sanjay Shakkottai;R. Srikant;Alexander L. Stolyar

  • Greedy primal-dual algorithm for dynamic resource allocation in complex networks

    Alexander L. Stolyar

  • Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials

    Avi Mandelbaum;William A. Massey;Martin I. Reiman;Alexander Stolyar

  • Shadow-Routing Based Dynamic Algorithms for Virtual Machine Placement in a Network Cloud

    Yang Guo;Alexander L. Stolyar;Anwar Walid

  • A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm

    Loc X. Bui;R. Srikant;Alexander Stolyar

  • Back-pressure-based packet-by-packet adaptive routing in communication networks

    Eleftheria Athanasopoulou;Loc X. Bui;Tianxiong Ji;R. Srikant

Frequent Co-Authors

R. Srikant
R. Srikant University of Illinois at Urbana-Champaign
Matthew Andrews
Matthew Andrews Nokia (United States)
Sanjay Shakkottai
Sanjay Shakkottai The University of Texas at Austin
Harish Viswanathan
Harish Viswanathan Nokia (United States)
Kavita Ramanan
Kavita Ramanan Brown University
Michel Mandjes
Michel Mandjes Leiden University
Edward G. Coffman
Edward G. Coffman Columbia University
Avishai Mandelbaum
Avishai Mandelbaum Technion – Israel Institute of Technology
Martin I. Reiman
Martin I. Reiman Columbia University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options is a smart way to launch or advance your tech career. Many students begin their journey with an associates degree online, which offers a flexible and affordable introduction to the field. These programs are ideal for students seeking foundational skills and a quick entry into the job market.

For those wanting to move up faster, consider enrolling in one of the quickest masters degree online programs. These can fast-track your credentials and boost your career potential in as little as one year.

When choosing a graduate program, focus on graduate degrees that are worth it—such as computer science, data analytics, or cybersecurity—which are consistently in high demand and deliver strong returns on investment.

Finally, cost is always a concern. Researching the cheapest online college options can help you minimize debt while still receiving a high-quality education. Combining affordability with in-demand credentials will set you firmly on the path to online learning success.

Best Scientists Citing Alexander L. Stolyar

Trending Scientists

Recently Published Articles