World's Best Scientists 2026 revealed!
Philip Heidelberger

Philip Heidelberger

D-Index & Metrics

Computer Science

D-Index
60
Citations
16321
World Ranking
3207
National Ranking
1557

Research.com Recognitions

  • 2006 - ACM Gordon Bell Prize The BlueGene/L Supercomputer and Quantum Chromodynamics
  • 1996 - ACM Fellow For contributions to the theory and practice of efficient discrete event simulations.
  • 1994 - IEEE Fellow For contributions to the theory of discrete event simulations.

Overview

Philip Heidelberger is affiliated with IBM in the United States. Their professional work is associated primarily with research and development in computing, particularly in areas aligned with discrete event simulations and quantum computing.

The awards received by Philip Heidelberger highlight contributions in both theoretical and applied computational sciences. They were recognized with the ACM Fellow distinction in 1996 for contributions to the theory and practice of efficient discrete event simulations. Two years earlier, in 1994, they received the IEEE Fellow award for contributions specifically to the theory of discrete event simulations. In 2006, Heidelberger was awarded the ACM Gordon Bell Prize for work related to the BlueGene/L Supercomputer and Quantum Chromodynamics.

The focus on discrete event simulations indicated by these awards suggests their research centers on simulation methods critical to modeling complex systems where events occur at discrete points in time. The connection to the BlueGene/L Supercomputer and Quantum Chromodynamics reflects involvement in high-performance computing and applications of computational methods in physics.

Philip Heidelberger has not been listed with any available recent papers, coauthors, publication venues, book publications, main fields or subfields of study, or main topics of work in the source data.

Best Publications

  • Massively parallel supercomputer

    Matthias A. Blumrich;Dong Chen;George L. Chiu;Thomas M. Cipolla

  • Fast simulation of rare events in queueing and reliability models

    Philip Heidelberger

  • An Overview of the BlueGene/L Supercomputer

    N.R. Adiga;G. Almasi;G.S. Almasi;Y. Aridor

  • A spectral method for confidence interval generation and run length control in simulations

    Philip Heidelberger;Peter D. Welch

  • Overview of the Blue Gene/L system architecture

    A. Gara;M. A. Blumrich;D. Chen;G. L.-T. Chiu

  • Blue Gene/L torus interconnection network

    N. R. Adiga;M. A. Blumrich;D. Chen;P. Coteus

  • Proactive management of software aging

    V. Castelli;R. E. Harper;P. Heidelberger;S. W. Hunter

  • Multi-petascale highly efficient parallel supercomputer

    Sameh Asaad;Ralph E. Bellofatto;Michael A. Blocksome;Matthias A. Blumrich

  • The IBM Blue Gene/Q Compute Chip

    Ruud A. Haring;Martin Ohmacht;Thomas W. Fox;Michael K. Gschwind

  • Portfolio Value-at-Risk with Heavy-Tailed Risk Factors

    Paul Glasserman;Philip Heidelberger;Perwez Shahabuddin

  • Multilevel Splitting for Estimating Rare Event Probabilities

    Paul Glasserman;Philip Heidelberger;Perwez Shahabuddin;Tim Zajic

  • The IBM Blue Gene/Q interconnection network and message unit

    Dong Chen;Noel A. Eisley;Philip Heidelberger;Robert M. Senger

  • A unified framework for simulating Markovian models of highly dependable systems

    A. Goyal;P. Shahabuddin;P. Heidelberger;V.F. Nicola

  • Asymptotically Optimal Importance Sampling and Stratification for Pricing Path‐Dependent Options

    Paul Glasserman;Philip Heidelberger;Perwez Shahabuddin

  • Variance Reduction Techniques for Estimating Value-at-Risk

    Paul Glasserman;Philip Heidelberger;Perwez Shahabuddin

  • Optimization of MPI collective communication on BlueGene/L systems

    George Almási;Philip Heidelberger;Charles J. Archer;Xavier Martorell

  • Ultrascalable petaflop parallel supercomputer

    Matthias A. Blumrich;Dong Chen;George Chiu;Thomas M. Cipolla

  • Convergence properties of infinitesimal perturbation analysis

    Philip Heidelberger;Xi-Ren Cao;Michael A. Zazanis;Rajan Suri

  • Effective bandwidth and fast simulation of ATM intree networks

    Cheng-Shang Chang;Philip Heidelberger;Sandeep Juneja;Perwez Shahabuddin

  • Multiple reservations and the Oklahoma update

    J.M. Stone;H.S. Stone;P. Heidelberger;J. Turek

  • The IBM Blue Gene/Q Interconnection Fabric

    Dong Chen;N. A. Eisley;P. Heidelberger;R. M. Senger

Frequent Co-Authors

Mark E. Giampapa
Mark E. Giampapa IBM (United States)
Alan Gara
Alan Gara IBM (United States)
Paul W. Coteus
Paul W. Coteus IBM (United States)
Sameer Kumar
Sameer Kumar Google (United States)
Valentina Salapura
Valentina Salapura Google (United States)
Peter W. Glynn
Peter W. Glynn Stanford University
David M. Nicol
David M. Nicol University of Illinois at Urbana-Champaign
José E. Moreira
José E. Moreira IBM (United States)
John A. Gunnels
John A. Gunnels Nvidia (United States)
Robert W. Wisniewski
Robert W. Wisniewski Intel (United States)

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 alternative online degree options can be a smart move for students interested in Computer Science. There are numerous programs designed for flexibility, affordability, and career advancement.

For those seeking to fast-track their education, quick masters degrees online can help you earn a recognized credential in less time than traditional programs. These accelerated paths are particularly beneficial for professionals who want to upskill quickly.

If you’re considering a master’s program, it’s important to focus on masters degrees that are worth it. These programs are in high demand among employers and offer strong salary potential in technology fields.

Those new to higher education or looking for a stepping stone may find that an associate's degree online is a flexible and cost-effective way to start a tech career. These degrees often provide transfer pathways to four-year programs.

Budget-minded students can also explore cheap online colleges to find reputable programs without heavy debt loads. This makes pursuing a computing career more accessible to all.

Best Scientists Citing Philip Heidelberger

Trending Scientists

Recently Published Articles