World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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