Optimal Wiring between Rectangles - Danny Dolev; Kevin Karplus; Alan Siegel; Alex Strong; Jeffrey D. Ullman (STOC, 1981)

Techniques for Solving Graph Problems in Parallel Environments - Peter H. Hochschild; Ernst W. Mayr; Alan R. Siegel (FOCS, 1983)

River routing: the theory and methodology. - Alan R. Siegel (1983)

River Routing Every Which Way, but Loose (Extended Abstract) - Richard Cole 001; Alan Siegel (FOCS, 1984)

On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) - Richard Cole 001; Alan Siegel (FOCS, 1985)

Minimum Storage Sorting Networks. - Alan R. Siegel (IEEE Trans. Computers, 1985)

Aspects of Information Flow in VLSI Circuits (Extended Abstract) - Alan Siegel (STOC, 1986)

Non-Oblivious Hashing (Extended Abstract) - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

Storing and Searching a Multikey Table (Extended Abstract) - Amos Fiat; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

Optimal VLSI circuits for sorting. - Richard Cole 001; Alan Siegel (J. ACM, 1988)

Some Geometry for General River Routing. - Alan Siegel; Danny Dolev (SIAM J. Comput., 1988)

On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) - Alan Siegel (FOCS, 1989)

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) - Jeanette P. Schmidt; Alan Siegel (STOC, 1989)

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) - Jeanette P. Schmidt; Alan Siegel (STOC, 1990)

The Spatial Complexity of Oblivious k-Probe Hash Functions. - Jeanette P. Schmidt; Alan Siegel (SIAM J. Comput., 1990)

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. - Amos Fiat; J. Ian Munro; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (J. Comput. Syst. Sci., 1991)

Report on the Second Workshop on Parallel Algorithms (WOPA). - Richard Cole 001; Alan Siegel (SIGACT News, 1991)

Nonoblivious Hashing. - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (J. ACM, 1992)

On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. - Alan Siegel (SODA, 1995)

Chernoff-Hoeffding Bounds for Applications with Limited Independence. - Jeanette P. Schmidt; Alan Siegel; Aravind Srinivasan (SIAM J. Discret. Math., 1995)

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. - Richard Cole 001; Bud Mishra; Jeanette P. Schmidt; Alan Siegel (SIAM J. Comput., 2000)

Median Bounds and Their Application. - Alan Siegel (J. Algorithms, 2001)

A Dido Problem as Modernized by Fejes Toth. - Alan Siegel (Discret. Comput. Geom., 2002)

An Isoperimetric Theorem in Plane Geometry. - Alan Siegel (Discret. Comput. Geom., 2003)

On Universal Classes of Extremely Random Constant-Time Hash Functions. - Alan Siegel (SIAM J. Comput., 2004)

Remembrances of Bob Paige. - Alan Siegel (High. Order Symb. Comput., 2005)

MPCT: media propelled computational thinking. - Eric Andrew Freudenthal; Mary K. Roy; Alexandria Nicole Ogrey; Tanja Magoc; Alan Siegel (SIGCSE, 2010)