| 2010 | SIGCSE | MPCT: media propelled computational thinking. | Eric Andrew Freudenthal, Mary K. Roy, Alexandria Nicole Ogrey, Tanja Magoc, Alan Siegel |
| 1999 | SODA | Median Bounds and Their Application. | Alan Siegel |
| 1995 | SODA | On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. | Alan Siegel |
| 1993 | SODA | Chernoff-Hoeffding Bounds for Applications with Limited Independence. | Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan |
| 1990 | STOC | The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) | Jeanette P. Schmidt, Alan Siegel |
| 1989 | FOCS | On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) | Alan Siegel |
| 1989 | STOC | On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) | Jeanette P. Schmidt, Alan Siegel |
| 1988 | STOC | Non-Oblivious Hashing (Extended Abstract) | Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel |
| 1988 | STOC | Storing and Searching a Multikey Table (Extended Abstract) | Amos Fiat, Moni Naor, Alejandro A. Schffer, Jeanette P. Schmidt, Alan Siegel |
| 1986 | STOC | Aspects of Information Flow in VLSI Circuits (Extended Abstract) | Alan Siegel |
| 1985 | FOCS | On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) | Richard Cole, Alan Siegel |
| 1984 | FOCS | River Routing Every Which Way, but Loose (Extended Abstract) | Richard Cole, Alan Siegel |
| 1981 | STOC | Optimal Wiring between Rectangles | Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman |