Alan Siegel

According to our database, Alan Siegel authored at least 24 papers between 1981 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

MPCT: media propelled computational thinking.

Eric Andrew Freudenthal, Mary K. Roy, Alexandria Nicole Ogrey, Tanja Magoc, Alan Siegel

Proceedings of the 41st ACM technical symposium on Computer science education, 2010

2005

Remembrances of Bob Paige.

Alan Siegel

High. Order Symb. Comput., 2005

2004

On Universal Classes of Extremely Random Constant-Time Hash Functions.

Alan Siegel

SIAM J. Comput., 2004

2003

An Isoperimetric Theorem in Plane Geometry.

Alan Siegel

Discret. Comput. Geom., 2003

2002

A Dido Problem as Modernized by Fejes Toth.

Alan Siegel

Discret. Comput. Geom., 2002

2001

Median Bounds and Their Application.

Alan Siegel

J. Algorithms, 2001

2000

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences.

Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel

SIAM J. Comput., 2000

1995

Chernoff-Hoeffding Bounds for Applications with Limited Independence.

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan

SIAM J. Discret. Math., 1995

On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence.

Alan Siegel

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1992

Nonoblivious Hashing.

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

J. ACM, 1992

1991

Report on the Second Workshop on Parallel Algorithms (WOPA).

Richard Cole, Alan Siegel

SIGACT News, 1991

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

1990

The Spatial Complexity of Oblivious k-Probe Hash Functions.

Jeanette P. Schmidt, Alan Siegel

SIAM J. Comput., 1990

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract)

Jeanette P. Schmidt, Alan Siegel

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract)

Jeanette P. Schmidt, Alan Siegel

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

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

Alan Siegel

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Some Geometry for General River Routing.

Alan Siegel, Danny Dolev

SIAM J. Comput., 1988

Optimal VLSI circuits for sorting.

Richard Cole, Alan Siegel

J. ACM, 1988

Storing and Searching a Multikey Table (Extended Abstract)

Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Oblivious Hashing (Extended Abstract)

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1986

Aspects of Information Flow in VLSI Circuits (Extended Abstract)

Alan Siegel

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract)

Richard Cole, Alan Siegel

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

River Routing Every Which Way, but Loose (Extended Abstract)

Richard Cole, Alan Siegel

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1981

Optimal Wiring between Rectangles

Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981