World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
7433
World Ranking
7614
National Ranking
3299

Paul Beame 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 Paul Beame 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: 146 publications — 25th percentile

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

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

Paul Beame 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 Paul Beame 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: 44 D-Index — 48th percentile

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

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

Research.com Recognitions

  • 2019 - ACM Fellow For contributions in computational and proof complexity and their applications, and for outstanding service

Overview

Paul Beame is affiliated with the University of Washington in the United States. Their research contributions span across multiple areas within computer science, focusing on computational theory, algorithms, and formal verification methods.

Beame has a notable publication record featuring contributions to the fields of computer science and several specialized subfields, including:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering
  • Molecular Biology
  • Computer Networks and Communications

Their work addresses a range of topics such as:

  • Cryptography and Data Security
  • Quantum Computing Algorithms and Architecture
  • Complexity and Algorithms in Graphs
  • Formal Methods in Verification
  • Stochastic Gradient Optimization Techniques
  • Security and Verification in Computing
  • Radiation Effects in Electronics

Among their frequent co-authors are:

  • Niels Kornerup
  • Jakob Nordström
  • Daniela Kaufmann
  • Armin Biere
  • Sariel Har-Peled

Beame's publications have appeared in a variety of academic venues, including:

  • arXiv (Cornell University)
  • 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE)
  • ACM Transactions on Algorithms
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Discrete Mathematics

Some of the recent papers authored or co-authored by Beame include:

  • "Edge Estimation with Independent Set Oracles," 2020, published in ACM Transactions on Algorithms
  • "On the Bias of Reed-Muller Codes over Odd Prime Fields," 2020, published in SIAM Journal on Discrete Mathematics
  • "Cumulative Memory Lower Bounds for Randomized and Quantum Computation," 2023, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Other relevant works involving Beame include co-authored contributions to verification and reasoning techniques in hardware and algebraic contexts, exemplified in papers such as "Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification" (2022, DATE) and "Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning" (2020, reposiTUm at TU Wien).

In 2019, Paul Beame was recognized as an ACM Fellow for contributions in computational and proof complexity and their applications, as well as for outstanding service to the field.

Best Publications

  • Model checking large software specifications

    Richard J. Anderson;Paul Beame;Steve Burns;William Chan

  • Towards understanding and harnessing the potential of clause learning

    Paul Beame;Henry Kautz;Ashish Sabharwal

  • Log depth circuits for division and related problems

    Paul W Beame;Stephen A Cook;H James Hoover

  • Optimal bounds for decision problems on the CRCW PRAM

    Paul Beame;Johan Hastad

  • Combining Component Caching and Clause Learning for Effective Model Counting.

    Tian Sang;Fahiem Bacchus;Paul Beame;Henry A. Kautz

  • Simplified and improved resolution lower bounds

    P. Beame;T. Pitassi

  • Propositional proof complexity: past, present, and future

    Paul Beame;Toniann Pitassi

  • Exponential lower bounds for the pigeonhole principle

    Toniann Pitassi;Paul Beame;Russell Impagliazzo

  • Optimal bounds for the predecessor problem and related problems

    Paul Beame;Faith E. Fich

  • The Relative Complexity of NP Search Problems

    Paul Beame;Stephen Cook;Jeff Edmonds;Russell Impagliazzo

  • Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs

    Paul Beame;Russell Impagliazzo;Jan Krajíček;Toniann Pitassi

  • Communication steps for parallel query processing

    Paul Beame;Paraschos Koutris;Dan Suciu

  • Communication Steps for Parallel Query Processing

    Paul Beame;Paraschos Koutris;Dan Suciu

  • The Efficiency of Resolution and Davis--Putnam Procedures

    Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

  • On the complexity of unsatisfiability proofs for random k-CNF formulas

    Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks

  • Skew in parallel query processing

    Paul Beame;Paraschos Koutris;Dan Suciu

  • Optimal bounds for the predecessor problem

    Paul Beame;Faith E. Fich

  • A general sequential time-space tradeoff for finding unique elements

    P. Beame

  • Exponential lower bounds for the pigeonhole principle

    Paul Beame;Russell Impagliazzo;Jan Krajíček;Toniann Pitassi

  • Heuristics for fast exact model counting

    Tian Sang;Paul Beame;Henry Kautz

  • An exponential separation between the parity principle and the pigeonhole principle

    Paul Beame;Toniann Pitassi

Frequent Co-Authors

Toniann Pitassi
Toniann Pitassi Columbia University
Russell Impagliazzo
Russell Impagliazzo University of California, San Diego
Dan Suciu
Dan Suciu University of Washington
Ashish Sabharwal
Ashish Sabharwal Allen Institute for Artificial Intelligence
Michael Saks
Michael Saks Rutgers, The State University of New Jersey
Henry Kautz
Henry Kautz University of Virginia
Martin Tompa
Martin Tompa University of Washington
David Notkin
David Notkin University of Washington
Walter L. Ruzzo
Walter L. Ruzzo University of Washington
Stephen A. Cook
Stephen A. Cook University of Toronto

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

Studying Computer Science in the USA opens many doors, but there are several complementary online degrees to consider as you shape your career. For future business leaders, an online executive mba offers advanced business skills, preparing you for technology management roles.

If you're interested in data curation, research, and information management, a mlis degree (Master of Library and Information Science) could be a great fit. This pathway combines tech know-how with information organization and digital preservation.

Cost is often a concern. Exploring the most affordable online masters can help you meet your academic and professional goals without overwhelming debt. Flexible learning enables you to keep working while you study.

Ambitious professionals interested in broader leadership roles can aim for an online doctorate in organizational leadership. This degree builds advanced skills for guiding organizations through technological change—an ideal pathway for computer science graduates who aspire to influence at the highest level.

Best Scientists Citing Paul Beame

Trending Scientists

Recently Published Articles