2026 Bruce Hajek: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	48	6110	5936	2748	2650	171	11264
Mathematics	45	1447	1244	638	509	147	10023

Research.com Recognitions

2003 - IEEE Koji Kobayashi Computers and Communications Award "For the application of stochastic and probabilistic theory to improved understanding of computernetwork behavior, particularly, the modeling and performance optimization of multipleaccess channels."
1999 - Member of the National Academy of Engineering For contributions to stochastic systems, communication networks, and control.
1992 - Fellow of John Simon Guggenheim Memorial Foundation
1989 - IEEE Fellow For contributions to stochastic systems, communications networks, and control systems.

Overview

Bruce Hajek is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their primary field of study is Computer Science, with research encompassing various subfields such as Computer Networks and Communications, Molecular Biology, Information Systems, Statistics and Probability, and Artificial Intelligence.

Their research covers several main topics, including:

Blockchain Technology Applications and Security
Gene Regulatory Network Analysis
Distributed Systems and Fault Tolerance
Distributed Sensor Networks and Detection Algorithms
Bioinformatics and Genomic Networks
Microbial Metabolic Engineering and Bioproduction
Statistical Distribution Estimation and Applications

Frequent collaborators in their work include Xiaohan Kang, Suryanarayana Sankagiri, Taha Ameen, Y. Hanzawa, and Shreyas Gandlur.

Bruce Hajek has contributed to several publication venues, with the most frequent being arXiv (Cornell University), followed by PLoS ONE, Stochastic Systems, bioRxiv (Cold Spring Harbor Laboratory), and the 2022 IEEE International Symposium on Information Theory (ISIT).

Recent publications include:

From graph topology to ODE models for gene regulatory networks, 2020, PLoS ONE
The Longest-Chain Protocol Under Random Delays, 2023, Stochastic Systems
The Longest-Chain Protocol Under Random Delays, 2021, arXiv (Cornell University)
Regenerative Particle Thompson Sampling, 2022, arXiv (Cornell University)
From graph topology to ODE models for gene regulatory networks, 2020, bioRxiv (Cold Spring Harbor Laboratory)

Their work bridges theoretical and applied areas, often intersecting computer science with biology, especially through the analysis of gene regulatory networks and bioinformatics.

Bruce Hajek has received several awards recognizing their contributions, including:

IEEE Koji Kobayashi Computers and Communications Award, 2003, for application of stochastic and probabilistic theory to improved understanding of computer network behavior, particularly the modeling and performance optimization of multiple access channels
Member of the National Academy of Engineering, 1999, for contributions to stochastic systems, communication networks, and control
Fellow of John Simon Guggenheim Memorial Foundation, 1992
IEEE Fellow, 1989, for contributions to stochastic systems, communications networks, and control systems

Best Publications

Cooling Schedules for Optimal Annealing

Bruce Hajek

1863
Citations
Stochastic Processes in Engineering Systems

E. Wong;B. Hajek;H. Saunders

708
Citations
Link scheduling in polynomial time

B. Hajek;G. Sasaki

702
Citations
Information theory and communication networks: an unconsummated union

A. Ephremides;B. Hajek

482
Citations
Hitting-time and occupation-time bounds implied by drift analysis with applications

Bruce Hajek

471
Citations
Optimal control of two interacting service stations

B. Hajek

430
Citations
Decentralized dynamic control of a multiaccess broadcast channel

B. Hajek;T. van Loon

327
Citations
Gossiping with Multiple Messages

S. Sanghavi;B. Hajek;L. Massoulie

300
Citations
Extremal Splittings of Point Processes

Bruce E. Hajek

297
Citations
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

Bruce Hajek;Yihong Wu;Jiaming Xu

249
Citations
VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals

Sichao Yang;B. Hajek

231
Citations
A tutorial survey of theory and applications of simulated annealing

Bruce Hajek

228
Citations
The time complexity of maximum matching by simulated annealing

Galen H. Sasaki;Bruce Hajek

226
Citations
Random Processes for Engineers

Bruce Hajek

212
Citations
An information-theoretic and game-theoretic study of timing channels

J. Giles;B. Hajek

188
Citations
Scheduling nonuniform traffic in a packet-switching system with small propagation delay

Timothy Weller;Bruce Hajek

171
Citations
On the capture probability for a large number of stations

B. Hajek;A. Krishna;R.O. LaMaire

160
Citations
Deflection routing in hypercube networks

A.G. Greenberg;B. Hajek

154
Citations
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

Bruce Hajek;Yihong Wu;Jiaming Xu

135
Citations
OPTIMAL DYNAMIC ROUTING IN COMMUNICATION NETWORKS WITH CONTINUOUS TRAFFIC

Bruce E. Hajek;Richard G. Ogier

129
Citations
2006 IEEE International Symposium on Information Theory

J. A. O'Sullivan;J. B. Anderson;A. Barg;A. Ashikhmin

12
Citations

Frequent Co-Authors

Yihong Wu Yale University

Eugene Wong University of California, Berkeley

Sujay Sanghavi The University of Texas at Austin

R. Srikant University of Illinois at Urbana-Champaign

Laurent Massoulié French Institute for Research in Computer Science and Automation - INRIA

Amos Lapidoth ETH Zurich

Sewoong Oh University of Washington

Ralf Koetter Technical University of Munich

Lei Ying University of Michigan–Ann Arbor

Anthony Ephremides University of Maryland, College Park

External Links

Wikipedia of Bruce Hajek Personal website of Bruce Hajek Google Scholar page

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

Related Online Degrees & Career Pathways

For students interested in expanding their expertise beyond Mathematics, pursuing degrees in business or finance can open up diverse career opportunities. Many opt for flexible, accessible programs that balance quality and affordability. For those exploring management roles, the easiest mba program to get into offers a practical entry point for gaining essential business skills without overwhelming admission requirements.

Similarly, the easiest online mba programs to get into provide flexible schedules ideal for working professionals looking to advance their careers while studying remotely. These programs combine convenience with important business acumen, making them attractive for math graduates transitioning into corporate roles.

For those aiming at high-level leadership and doctoral education, affordable options like the dba online programs can be a strategic choice. These programs offer the chance to specialize in business administration while maintaining cost efficiency.

Additionally, combining a strong mathematical background with finance expertise through the cheapest online masters in finance can lead to lucrative roles in investment analysis, risk management, and financial planning. These affordable degrees make finance accessible without sacrificing quality or flexibility.