Alan Siegel

Understanding and misunderstanding the Third International Mathematics and Science Study: what is at stake (2009)

Alan Siegel

Abstract. The technical portion of this paper concerns a videotape classroom study of eighth grade mathematics lessons in Japan, and how methodological design errors led to conclusions that are...

Delegation Logic: A Logic-based Approach to Distributed Authorization (2009)

Ninghui Li, Joan Feigenbaum, Alan Siegel

To my parents and my wife iii Acknowledgment First and foremost, I must thank Joan Feigenbaum, my advisor, for her guidance, patience, and encouragement over these years. If I became a better writer...

OPTIMAL WIRING BETWEEN IIECTANGI,ES (2008)

Danny Dolevf, Alan Siegel, Jeffrey D. Ullmanff, Qt Q, Qa Q, Pt P

We consider the problem of wiring together two parallel rows of points under a variety of conditions. The op-tions'include whether we allow tim rows to slide relative to one another, wb.ether we...

On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff (2007)

Alan Siegel

A family of functions F that map [0; n] 7! [0; n], is said to be h-wise independent if any h points in [0; n] have an image, for randomly selected f 2 F , that is uniformly distributed. This paper...

Comment (2003)

Siegel, Alan.

Brookings Papers on Education Policy - 2003

Delegation Logic: A logic-based approach to distributed authorization (2003)

Ninghui Li, Joan Feigenbaum, Alan Siegel, C Ninghui Li, Fangzhe Chang, Hseu-ming Chen, ...

To my parents and my wife iii Acknowledgment First and foremost, I must thank Joan Feigenbaum, my advisor, for her guidance, pa-tience, and encouragement over these years. If I became a better writer...

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

Richard Cole, Bud Mishra, Jeanette Schmidt, Alan Siegel

A special case of the Dynamic Finger Conjecture is proved; this special case introduces a number of useful techniques. 1 Introduction The splay tree is a self-adjusting binary search tree devised by...

Chernoff-Hoeffding Bounds for Applications with Limited Independence (1992)

Schmidt, Jeanette P., Siegel, Alan, Srinivasan, Aravind

Chernoff-Hoeffding bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables. We present a simple technique which gives slightly...

Chernoff-Hoeffding Bounds for Applications with Limited Independence (1992)

Schmidt, Jeanette P., Siegel, Alan, Srinivasan, Aravind

Chernoff-Hoeffding bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables. We present a simple technique which gives slightly...

Toward a usable theory of Chernoff Bounds for heterogeneous and partially dependent random variables (1992)

Alan Siegel

Let X be a sum of real valued random variables and have a bounded mean E[X]. The generic Chernoff-Hoeffding estimate for large deviations of X is: P rfX \GammaE[X ] ag min 0 e \Gamma(a+E[X]) E[e X ],...

Long internal inverted repeat in a yeast viral double-stranded RNA (1985)

Bruenn, Jeremy, Madura, Kiran, Siegel, Alan, Miner, Zoe, Lee, Myunghee

The Saccharomyces cerevisiae viruses are non-infectious double-stranded (ds) RNA viruses present in most laboratory strains of yeast. Their genome consists of one or more dsRNAs separately...

Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions

Alan Siegel, Jeanette P. Schmidt

Universal hash functions that exhibit c log n-wise independence are shown to give a performance in double hashing, uniform hashing and virtually any reasonable generalization of double hashing that...

Double Hashing is Computable and Randomizable with Universal Hash Functions

Jeanette P. Schmidt, Alan Siegel

Universal hash functions that exhibit c log n-wise independence are shown to give a performance in double hashing and virtually any reasonable generalization of double hashing that has an expected...