Paul Beame
About
In The Last Decade
Paul Beame
103 papers receiving 2.4k citations
Peers
Comparison fields: 5 of 84
- Computational Theory and Mathematics 1.8k
- Artificial Intelligence 1.5k
- Computer Networks and Communications 683
- Software 373
- Signal Processing 230
Countries citing papers authored by Paul Beame
This map shows the geographic impact of Paul Beame's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Paul Beame with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Beame more than expected).
Fields of papers citing papers by Paul Beame
This network shows the impact of papers produced by Paul Beame. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Paul Beame. The network helps show where Paul Beame may publish in the future.
Co-authorship network of co-authors of Paul Beame
This figure shows the co-authorship network connecting the top 25 collaborators of Paul Beame. A scholar is included among the top collaborators of Paul Beame based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paul Beame. Paul Beame is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials | 3 |
| 3 | 1 | |
| 4 | 62 | |
| 5 | New limits for knowledge compilation and applications to exact model counting | 2 |
| 6 | Lower bounds for exact model counting and applications in probabilistic databases | 7 |
| 7 | Making RAMs Oblivious Requires Superlogarithmic Overhead. | 1 |
| 8 | 9 | |
| 9 | Multiparty Communication Complexity of AC 0 | 7 |
| 10 | A dynamic approach to MPE and weighted MAX-SAT | 10 |
| 11 | The resolution complexity of random graph k-colorability | 9 |
| 12 | Lower bounds for Lovász-Schrijver systems and beyond, using multiparty communication complexity | 2 |
| 13 | Combining Component Caching and Clause Learning for Effective Model Counting. | 96 |
| 14 | 10 | |
| 15 | Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation | 2 |
| 16 | Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 | 1 |
| 17 | On Searching Sorted Lists: A Near-Optimal Lower Bound | 2 |
| 18 | 12 | |
| 19 | 9 | |
| 20 | 13 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.