Alan Siegel

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