Alan Siegel

Publication Activity (10 Years)

Years Active: 1981-2010
Publications (10 Years): 0

Publications

Eric Andrew Freudenthal, Mary K. Roy, Alexandria Nicole Ogrey, Tanja Magoc, Alan Siegel
MPCT: media propelled computational thinking. SIGCSE (2010)
Alan Siegel
Remembrances of Bob Paige. High. Order Symb. Comput. 18 (1-2) (2005)
Alan Siegel
On Universal Classes of Extremely Random Constant-Time Hash Functions. SIAM J. Comput. 33 (3) (2004)
Alan Siegel
An Isoperimetric Theorem in Plane Geometry. Discret. Comput. Geom. 29 (2) (2003)
Alan Siegel
Median Bounds and Their Application. J. Algorithms 38 (1) (2001)
Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM J. Comput. 30 (1) (2000)
Alan Siegel
Median Bounds and Their Application. SODA (1999)
Alan Siegel
On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. SODA (1995)
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. 8 (2) (1995)
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA (1993)
Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
Nonoblivious Hashing. J. ACM 39 (4) (1992)
Richard Cole, Alan Siegel
Report on the Second Workshop on Parallel Algorithms (WOPA). SIGACT News 22 (3) (1991)
Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. 43 (3) (1991)
Jeanette P. Schmidt, Alan Siegel
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) STOC (1990)
Jeanette P. Schmidt, Alan Siegel
The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM J. Comput. 19 (5) (1990)
Alan Siegel
On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) FOCS (1989)
Jeanette P. Schmidt, Alan Siegel
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) STOC (1989)
Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
Storing and Searching a Multikey Table (Extended Abstract) STOC (1988)
Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
Non-Oblivious Hashing (Extended Abstract) STOC (1988)
Richard Cole, Alan Siegel
Optimal VLSI circuits for sorting. J. ACM 35 (4) (1988)
Alan Siegel, Danny Dolev
Some Geometry for General River Routing. SIAM J. Comput. 17 (3) (1988)
Alan Siegel
Aspects of Information Flow in VLSI Circuits (Extended Abstract) STOC (1986)
Richard Cole, Alan Siegel
On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) FOCS (1985)
Richard Cole, Alan Siegel
River Routing Every Which Way, but Loose (Extended Abstract) FOCS (1984)
Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman
Optimal Wiring between Rectangles STOC (1981)