| 2007 | CiE | Linear Transformations in Boolean Complexity Theory. | Joel Friedman |
| 2006 | ISAIM | A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems. | Robert St-Aubin, Joel Friedman, Alan K. Mackworth |
| 2003 | STOC | A proof of Alon's second eigenvalue conjecture. | Joel Friedman |
| 2001 | ICALP | Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. | Joel Friedman, Andreas Goerdt |
| 1996 | STOC | Computing Betti Numbers via Combinatorial Laplacians. | Joel Friedman |
| 1996 | STACS | The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography. | Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich |
| 1992 | FOCS | On the Bit Extraction Problem | Joel Friedman |
| 1989 | STOC | On the Second Eigenvalue in Random Regular Graphs | Joel Friedman, Jeff Kahn, Endre Szemerdi |
| 1988 | FOCS | A Deterministic View of Random Sampling and its Use in Geometry | Bernard Chazelle, Joel Friedman |
| 1986 | FOCS | On Newton's Method for Polynomials | Joel Friedman |
| 1986 | STOC | Non-Blocking Networks (Preliminary Version) | Paul Feldman, Joel Friedman, Nicholas Pippenger |
| 1985 | FOCS | The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) | Benny Chor, Oded Goldreich, Johan Hstad, Joel Friedman, Steven Rudich, Roman Smolensky |