World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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)
Harish Viswanathan
Harish Viswanathan Nokia (United States)
Sanjay Shakkottai
Sanjay Shakkottai The University of Texas at Austin
Edward G. Coffman
Edward G. Coffman Columbia University
Michel Mandjes
Michel Mandjes Leiden University
Martin I. Reiman
Martin I. Reiman Columbia University
Avishai Mandelbaum
Avishai Mandelbaum Technion – Israel Institute of Technology
Scott Shenker
Scott Shenker University of California, Berkeley

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