| 2014 | MOBIHOC | On optimal scheduling of multiple mobile chargers in wireless sensor networks. | Richard Beigel, Jie Wu, Huanyang Zheng |
| 2012 | AAIM | A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. | Richard Beigel, Bin Fu |
| 2006 | MFCS | The Multiparty Communication Complexity of Exact- | Richard Beigel, William I. Gasarch, James Glenn |
| 2004 | ISAAC | Diagnosis in the Presence of Intermittent Faults. | Bin Fu, Richard Beigel |
| 2003 | ISAAC | Infinitely-Often Autoreducible Sets. | Richard Beigel, Lance Fortnow, Frank Stephan |
| 2002 | FOCS | Learning a Hidden Matching. | Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov |
| 2001 | RECOMB | An optimal procedure for gap closing in whole genome shotgun sequencing. | Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow |
| 1999 | SODA | Finding Maximum Independent Sets in Sparse and General Graphs. | Richard Beigel |
| 1998 | LATIN | The Geometry of Browsing. | Richard Beigel, Egemen Tanin |
| 1998 | STOC | NP Might Not Be As Easy As Detecting Unique Solutions. | Richard Beigel, Harry Buhrman, Lance Fortnow |
| 1998 | STOC | One Help Bit Doesn't Help. | Richard Beigel, Tirza Hirst |
| 1998 | STACS | The Complexity of Modular Graph Automorphism. | Vikraman Arvind, Richard Beigel, Antoni Lozano |
| 1997 | ICALP | Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. | Richard Beigel, Bin Fu |
| 1996 | MFCS | On the Query Complexity of Sets. | Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan |
| 1995 | FOCS | 3-Coloring in Time O(1.3446 | Richard Beigel, David Eppstein |
| 1995 | FOCS | Fault Diagnosis in a Flash. | Richard Beigel, William Hurwood, Nabil Kahal |
| 1994 | SODA | An Efficient Algorithm for Dynamic Text Indexing. | Ming Gu, Martin Farach, Richard Beigel |
| 1993 | AAAI | OC1: A Randomized Induction of Oblique Decision Trees. | Sreerama K. Murthy, Simon Kasif, Steven Salzberg, Richard Beigel |
| 1993 | SPAA | Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. | Richard Beigel, Grigorii Margulis, Daniel A. Spielman |
| 1992 | ISAAC | On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. | Richard Beigel, Jun Tarui, Seinosuke Toda |
| 1992 | LFCS | Quantifying the Amount of Verboseness. | Richard Beigel, Martin Kummer, Frank Stephan |
| 1992 | STOC | Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) | David A. Mix Barrington, Richard Beigel, Steven Rudich |
| 1992 | STOC | When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One | Richard Beigel |
| 1991 | FOCS | Languages that Are Easier than their Proofs | Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser |
| 1991 | FOCS | On ACC | Richard Beigel, Jun Tarui |
| 1991 | STOC | The Expressive Power of Voting Polynomials | James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich |
| 1991 | STOC | PP Is Closed Under Intersection (Extended Abstract) | Richard Beigel, Nick Reingold, Daniel A. Spielman |
| 1990 | STACS | A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
| 1990 | STACS | Counting Classes: Thresholds, Parity, Mods, and Fewness. | Richard Beigel, John Gill, Ulrich Hertrampf |
| 1989 | SPAA | Locating Faults in a Constant Number of Parallel Testing Rounds. | Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan |