H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 35 Citations 6,332 97 World Ranking 6035 National Ranking 2883

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Discrete mathematics
  • Programming language

His primary scientific interests are in Discrete mathematics, Combinatorics, Mathematical proof, Proof complexity and Resolution. His study ties his expertise on Relational database together with the subject of Discrete mathematics. In general Combinatorics, his work in Pigeonhole principle, Binary logarithm and Ideal is often linked to Hilbert's Nullstellensatz linking many areas of study.

His Mathematical proof research is multidisciplinary, incorporating perspectives in Polynomial, Exponential function and Boolean satisfiability problem. Paul Beame has researched Proof complexity in several fields, including Satisfiability, Calculus and Structural proof theory. Paul Beame combines subjects such as Structure, Graph and Nondeterministic algorithm with his study of Resolution.

His most cited work include:

  • Model checking large software specifications (312 citations)
  • Towards understanding and harnessing the potential of clause learning (245 citations)
  • Log depth circuits for division and related problems (207 citations)

What are the main themes of his work throughout his whole career to date?

Paul Beame mainly focuses on Discrete mathematics, Combinatorics, Binary logarithm, Function and Theoretical computer science. His research integrates issues of Proof complexity, Mathematical proof, Computational complexity theory and Exponential function in his study of Discrete mathematics. Paul Beame works mostly in the field of Proof complexity, limiting it down to topics relating to Resolution and, in certain cases, Satisfiability, as a part of the same area of interest.

His Combinatorics research is multidisciplinary, relying on both Polynomial and Circuit complexity. In general Binary logarithm study, his work on Log-log plot often relates to the realm of Bounded function, Wallace tree and Diagonal, thereby connecting several areas of interest. His Theoretical computer science research is multidisciplinary, incorporating elements of Simple and Hash function.

He most often published in these fields:

  • Discrete mathematics (58.90%)
  • Combinatorics (40.49%)
  • Binary logarithm (22.09%)

What were the highlights of his more recent work (between 2016-2020)?

  • Discrete mathematics (58.90%)
  • Combinatorics (40.49%)
  • Mathematical proof (14.72%)

In recent papers he was focusing on the following fields of study:

His main research concerns Discrete mathematics, Combinatorics, Mathematical proof, Algorithm and Diagonal. His Discrete mathematics research integrates issues from Group testing, Oracle and Degree. His study in the field of Random polynomials, Finite field and Hypercube is also linked to topics like Hamming weight and Hamming graph.

His biological study spans a wide range of topics, including Commutative property, Algebraic number, Simple and Multiplication, Arithmetic. His work in Algorithm tackles topics such as Graphical model which are related to areas like Inference. His Inference study incorporates themes from Theoretical computer science, Binary decision diagram and Query optimization.

Between 2016 and 2020, his most popular works were:

  • Exact Model Counting of Query Expressions: Limitations of Propositional Methods (68 citations)
  • Communication Steps for Parallel Query Processing (46 citations)
  • Edge Estimation with Independent Set Oracles. (14 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Algebra
  • Programming language

The scientist’s investigation covers issues in Algorithm, Inference, Tuple, Discrete mathematics and Time space. His research in Algorithm intersects with topics in Smoothing, Quadratic equation and Massively parallel. His Inference research includes elements of Graphical model, Probabilistic logic and Theoretical computer science.

His work carried out in the field of Tuple brings together such families of science as Matching, Path, Analysis of parallel algorithms, Conjunctive query and Connected component. The Discrete mathematics study combines topics in areas such as Probability distribution and Dimension, Combinatorics. His multidisciplinary approach integrates Time space and Algebra in his work.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Model checking large software specifications

Richard J. Anderson;Paul Beame;Steve Burns;William Chan.
foundations of software engineering (1996)

481 Citations

Log depth circuits for division and related problems

Paul W Beame;Stephen A Cook;H James Hoover.
SIAM Journal on Computing (1986)

359 Citations

Towards understanding and harnessing the potential of clause learning

Paul Beame;Henry Kautz;Ashish Sabharwal.
Journal of Artificial Intelligence Research (2004)

348 Citations

Optimal bounds for decision problems on the CRCW PRAM

Paul Beame;Johan Hastad.
Journal of the ACM (1989)

299 Citations

Combining Component Caching and Clause Learning for Effective Model Counting.

Tian Sang;Fahiem Bacchus;Paul Beame;Henry A. Kautz.
theory and applications of satisfiability testing (2004)

255 Citations

Simplified and improved resolution lower bounds

P. Beame;T. Pitassi.
foundations of computer science (1996)

246 Citations

Communication Steps for Parallel Query Processing

Paul Beame;Paraschos Koutris;Dan Suciu.
Journal of the ACM (2017)

236 Citations

Optimal bounds for the predecessor problem and related problems

Paul Beame;Faith E. Fich.
symposium on the theory of computing (2002)

194 Citations

Exponential lower bounds for the pigeonhole principle

Toniann Pitassi;Paul Beame;Russell Impagliazzo.
Computational Complexity (1993)

193 Citations

The Relative Complexity of NP Search Problems

Paul Beame;Stephen Cook;Jeff Edmonds;Russell Impagliazzo.
Journal of Computer and System Sciences (1998)

168 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Paul Beame

Toniann Pitassi

Toniann Pitassi

University of Toronto

Publications: 58

Samuel R. Buss

Samuel R. Buss

University of California, San Diego

Publications: 41

Russell Impagliazzo

Russell Impagliazzo

University of California, San Diego

Publications: 29

Alexander A. Razborov

Alexander A. Razborov

University of Chicago

Publications: 28

Eric Allender

Eric Allender

Rutgers, The State University of New Jersey

Publications: 26

Eli Ben-Sasson

Eli Ben-Sasson

Technion – Israel Institute of Technology

Publications: 25

Yossi Matias

Yossi Matias

Google (United States)

Publications: 24

Mikkel Thorup

Mikkel Thorup

University of Copenhagen

Publications: 20

Mats P. E. Heimdahl

Mats P. E. Heimdahl

University of Minnesota

Publications: 20

Uzi Vishkin

Uzi Vishkin

University of Maryland, College Park

Publications: 19

Pavel Pudlák

Pavel Pudlák

Czech Academy of Sciences

Publications: 18

Frank Neven

Frank Neven

Hasselt University

Publications: 18

Bart Selman

Bart Selman

Cornell University

Publications: 18

Dimitris Achlioptas

Dimitris Achlioptas

National and Kapodistrian University of Athens

Publications: 18

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 18

Something went wrong. Please try again later.