Alan Siegel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2010

MPCT: media propelled computational thinkingEric Andrew Freudenthal, Mary K. Roy, Alexandria Nicole Ogrey, Tanja Magoc, Alan Siegel. sigcse 2009: 37-41 [doi]

2005

Remembrances of Bob PaigeAlan Siegel. lisp, 18(1-2):9-11, 2005. [doi]

2004

On Universal Classes of Extremely Random Constant-Time Hash FunctionsAlan Siegel. SICOMP, 33(3):505-543, 2004. [doi]

2003

An Isoperimetric Theorem in Plane GeometryAlan Siegel. dcg, 29(2):239-255, 2003. [doi]

2001

Median Bounds and Their ApplicationAlan Siegel. jal, 38(1):184-236, 2001.

2000

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block SequencesRichard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel. SICOMP, 30(1):1-43, 2000.

1999

Median Bounds and Their ApplicationAlan Siegel. soda 1999: 776-785 [doi]

1995

Chernoff-Hoeffding Bounds for Applications with Limited IndependenceJeanette P. Schmidt, Alan Siegel, Aravind Srinivasan. siamdm, 8(2):223-250, 1995. [doi]

On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited IndependenceAlan Siegel. soda 1995: 10-19

1993

Chernoff-Hoeffding Bounds for Applications with Limited IndependenceJeanette P. Schmidt, Alan Siegel, Aravind Srinivasan. soda 1993: 331-340

1992

Nonoblivious HashingAmos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. JACM, 39(4):764-782, 1992. [doi]

1991

Report on the Second Workshop on Parallel Algorithms (WOPA)Richard Cole 0001, Alan Siegel. sigact, 22(3):20-23, 1991. [doi]

An Implicit Data Structure for Searching a Multikey Table in Logarithmic TimeAmos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel. jcss, 43(3):406-424, 1991.

1990

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract)Jeanette P. Schmidt, Alan Siegel. stoc 1990: 224-234

The Spatial Complexity of Oblivious k-Probe Hash FunctionsJeanette P. Schmidt, Alan Siegel. SICOMP, 19(5):775-786, 1990.

1989

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract)Jeanette P. Schmidt, Alan Siegel. stoc 1989: 355-366

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

1988

Optimal VLSI circuits for sortingRichard Cole, Alan Siegel. JACM, 35(4):777-809, 1988. [doi]

Non-Oblivious Hashing (Extended Abstract)Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. stoc 1988: 367-376

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

Some Geometry for General River RoutingAlan Siegel, Danny Dolev. SICOMP, 17(3):583-605, 1988.

1986

Aspects of Information Flow in VLSI Circuits (Extended Abstract)Alan Siegel. stoc 1986: 448-459

1985

On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract)Richard Cole, Alan Siegel. focs 1985: 208-221

1984

River Routing Every Which Way, but Loose (Extended Abstract)Richard Cole, Alan Siegel. focs 1984: 65-73

1981

Optimal Wiring between RectanglesDanny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman. stoc 1981: 312-317

Sign in or sign up to see more results.

runs on WebDSL