Richard Beigel
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs 49
- Computability, Logic, AI Algorithms 29
- semigroups and automata theory 21
- Advanced Graph Theory Research 17
- Artificial Intelligence top 1%
- Machine Learning and Algorithms 16
- Algorithms and Data Compression 16
-
- Optimization and Search Problems 10
-
- DNA and Biological Computing 8
- Co-authors
- Daniel A. SpielmanSteven RudichNick ReingoldDavid EppsteinJun TaruiJohn GillWilliam GasarchJames Aspnes
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- Computational Complexity (7 papers)Theoretical Computer Science (6 papers)SIAM Journal on Computing (5 papers)
- Partner nations
- United StatesGermanyIsrael
In The Last Decade
Richard Beigel
83 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 72
- Computational Theory and Mathematics 1.3k
- Artificial Intelligence 1.0k
- Discrete Mathematics and Combinatorics 88
- Computer Graphics and Computer-Aided Design 46
- Computer Networks and Communications 285
Countries citing papers authored by Richard Beigel
This map shows the geographic impact of Richard Beigel'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 Richard Beigel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Richard Beigel more than expected).
Fields of papers citing papers by Richard Beigel
This network shows the impact of papers produced by Richard Beigel. 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 Richard Beigel. The network helps show where Richard Beigel may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Richard Beigel, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2015 | 0 | |
| 2 | The multiparty communication complexity of Exact-T: Improved bounds and new problems | 2006 | 0 |
| 3 | Enumerations of the Kolmogorov Function | 2004 | 1 |
| 4 | 2004 | 10 | |
| 5 | The Complexity of Odd$^A_n$ | 2000 | 1 |
| 6 | 2000 | 9 | |
| 7 | Finding maximum independent sets in sparse and general graphs | 1999 | 53 |
| 8 | 1999 | 6 | |
| 9 | Research report: design and evaluation of incremental data structures and algorithms for dynamic query interfaces | 1997 | 1 |
| 10 | 1997 | 19 | |
| 11 | Modulo Information from Nonadaptive Queries to NP | 1996 | 1 |
| 12 | 3-Coloring in Time O(1.3446 n ): A No-MIS Algorithm. | 1995 | 20 |
| 13 | Closure Properties of GapP and #P | 1995 | 1 |
| 14 | 1994 | 29 | |
| 15 | OC1: randomized induction of oblique decision trees | 1993 | 70 |
| 16 | 1993 | 37 | |
| 17 | 1991 | 24 | |
| 18 | 1991 | 66 | |
| 19 | 1990 | 13 | |
| 20 | On the Power of Probabilistic Polynomial Time: P NP[log] subseteq PP. | 1989 | 3 |
About Richard Beigel
Richard Beigel is a scholar working on Computational Theory and Mathematics, Theoretical Computer Science, Artificial Intelligence, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 97 papers that have together received 1.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (49 papers), Computability, Logic, AI Algorithms (29 papers), semigroups and automata theory (21 papers), Advanced Graph Theory Research (17 papers), Machine Learning and Algorithms (16 papers), Algorithms and Data Compression (16 papers), Optimization and Search Problems (10 papers) and DNA and Biological Computing (8 papers). The work is most often cited by research in Computational Theory and Mathematics (1.3k citations), Artificial Intelligence (1.0k citations), Discrete Mathematics and Combinatorics (88 citations), Computer Graphics and Computer-Aided Design (46 citations) and Computer Networks and Communications (285 citations). Richard Beigel has collaborated with scholars based in United States, Germany and Israel. Frequent co-authors include Daniel A. Spielman, Steven Rudich, Nick Reingold, David Eppstein, Jun Tarui, John Gill, William Gasarch, James Aspnes, Merrick L. Furst and Simon Kasif. Their work appears in journals such as Computational Complexity, Theoretical Computer Science, SIAM Journal on Computing, Information and Computation and Journal of Symbolic Logic.
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.