No photo of Alan Siegel

Alan Siegel

Associate Professor of Computer Science

1972 …2011
If you made any changes in Pure, your changes will be visible here soon.

Research Output 1972 2011

Filter
Article
2011

Planting the seeds of Computational Thinking: An introduction to programming suitable for inclusion in STEM curricula

Freudenthal, E. A., Duval, A., Hug, S., Ogrey, A. N., Lim, K. H., Tabor, C., Gonzalez, R. Q. & Siegel, A., 2011, In : ASEE Annual Conference and Exposition, Conference Proceedings.

Research output: Contribution to journalArticle

Curricula
Seed
Students
Kinematics
Computer science
2010

A computational introduction to STEM studies

Freudenthal, E., Gonzalez, R., Hug, S., Ogrey, A., Roy, M. K. & Siegel, A., 2010, In : ASEE Annual Conference and Exposition, Conference Proceedings.

Research output: Contribution to journalArticle

Students
Conveying
Curricula
Computer science
Physics
2004

On universal classes of extremely random constant-time hash functions

Siegel, A., 2004, In : SIAM Journal on Computing. 33, 3, p. 505-543 39 p.

Research output: Contribution to journalArticle

Hash functions
Hash Function
Time Constant
Seed
Models of Computation
2003

An isoperimetric theorem in plane geometry

Siegel, A., 2003, In : Discrete and Computational Geometry. 29, 2, p. 239-255 17 p.

Research output: Contribution to journalArticle

Isoperimetric theorem
Half line
Geometry
Triangular
Anticlockwise
2002

A Dido problem as modernized by Fejes Tóth

Siegel, A., 2002, In : Discrete and Computational Geometry. 27, 2, p. 227-238 12 p.

Research output: Contribution to journalArticle

Curve
Simple Polygon
Isoperimetric Inequality
Line segment
Intersect
2001

Median Bounds and Their Application

Siegel, A., Jan 2001, In : Journal of Algorithms. 38, 1, p. 184-236 53 p.

Research output: Contribution to journalArticle

Probability distributions
Interpolation
Weighted Distributions
Bernoulli trial
Emulation

Some dido-type inequalities

Siegel, A., 2001, Elemen. Math., p. 17-20.

Research output: Contribution to specialist publicationArticle

2000

On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences

Cole, R., Mishra, B., Schmidt, J. & Siegel, A., 2000, In : SIAM Journal on Computing. 30, 1, p. 1-43 43 p.

Research output: Contribution to journalArticle

Sorting
Binary Search Tree
Sort
1995

Chernoff-Hoeffding bounds for applications with limited independence

Schmidt, J. P., Siegel, A. & Srinivasan, A., 1995, In : SIAM Journal on Discrete Mathematics. p. 223-250

Research output: Contribution to journalArticle

1992

Nonoblivious hashing

Fiat, A., Naor, M., Schmidt, J. P. & Siegel, A., Oct 1992, In : Journal of the ACM. 39, 4, p. 764-782 19 p.

Research output: Contribution to journalArticle

Hashing
Data storage equipment
Logarithmic
Probe
Requirements
1991

An implicit data structure for searching a multikey table in logarithmic time

Fiat, A., Ian Munro, J., Naor, M., Schäffer, A. A., Schmidt, J. P. & Siegel, A., 1991, In : Journal of Computer and System Sciences. 43, 3, p. 406-424 19 p.

Research output: Contribution to journalArticle

Data structures
Table
Data Structures
Logarithmic
Halve
1990

Spatial complexity of oblivious κ-probe hash functions

Schmidt, J. P. & Siegel, A., Oct 1990, In : SIAM Journal on Computing. 19, 5, p. 775-786 12 p.

Research output: Contribution to journalArticle

Hash functions
Hash Function
Probe
Lower bound
Table lookup
1988

Optimal VLSI circuits for sorting

Cole, R. & Siegel, A., Oct 1988, In : Journal of the ACM. 35, 4, p. 777-809 33 p.

Research output: Contribution to journalArticle

VLSI Circuits
VLSI circuits
Sorting
Merging
Data Flow

Some geometry for general river routing

Siegel, A. & Dolev, D., Jun 1988, In : SIAM Journal on Computing. 17, 3, p. 583-605 23 p.

Research output: Contribution to journalArticle

Routing
Rivers
Electric wiring
Efficient Solution
Placement
1985

MINIMUM STORAGE SORTING NETWORKS.

Siegel, A., Apr 1985, In : IEEE Transactions on Computers. C-34, 4, p. 355-361 7 p.

Research output: Contribution to journalArticle

Sorting Networks
Sorting
Sort
Lower bound
Sharp Bound
1972

On the müntz-szász theorem for C[0, 1]

Siegel, A., 1972, In : Proceedings of the American Mathematical Society. 36, 1, p. 161-166 6 p.

Research output: Contribution to journalArticle

Theorem