dblp.uni-trier.dewww.uni-trier.de

Alan Siegel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2005
23EEAlan Siegel: Remembrances of Bob Paige. Higher-Order and Symbolic Computation 18(1-2): 9-11 (2005)
2004
22EEAlan Siegel: On Universal Classes of Extremely Random Constant-Time Hash Functions. SIAM J. Comput. 33(3): 505-543 (2004)
2003
21EEAlan Siegel: An Isoperimetric Theorem in Plane Geometry. Discrete & Computational Geometry 29(2): 239-255 (2003)
2001
20 Alan Siegel: Median Bounds and Their Application. J. Algorithms 38(1): 184-236 (2001)
2000
19 Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel: On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM J. Comput. 30(1): 1-43 (2000)
1999
18EEAlan Siegel: Median Bounds and Their Application. SODA 1999: 776-785
1995
17 Alan Siegel: On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. SODA 1995: 10-19
16EEJeanette P. Schmidt, Alan Siegel, Aravind Srinivasan: Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discrete Math. 8(2): 223-250 (1995)
1993
15 Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan: Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA 1993: 331-340
1992
14EEAmos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel: Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992)
1991
13 Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel: An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. 43(3): 406-424 (1991)
1990
12 Jeanette P. Schmidt, Alan Siegel: The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) STOC 1990: 224-234
11 Jeanette P. Schmidt, Alan Siegel: The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM J. Comput. 19(5): 775-786 (1990)
1989
10 Alan Siegel: On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) FOCS 1989: 20-25
9 Jeanette P. Schmidt, Alan Siegel: On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) STOC 1989: 355-366
1988
8 Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel: Storing and Searching a Multikey Table (Extended Abstract) STOC 1988: 344-353
7 Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel: Non-Oblivious Hashing (Extended Abstract) STOC 1988: 367-376
6EERichard Cole, Alan Siegel: Optimal VLSI circuits for sorting. J. ACM 35(4): 777-809 (1988)
5 Alan Siegel, Danny Dolev: Some Geometry for General River Routing. SIAM J. Comput. 17(3): 583-605 (1988)
1986
4 Alan Siegel: Aspects of Information Flow in VLSI Circuits (Extended Abstract) STOC 1986: 448-459
1985
3 Richard Cole, Alan Siegel: On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) FOCS 1985: 208-221
1984
2 Richard Cole, Alan Siegel: River Routing Every Which Way, but Loose (Extended Abstract) FOCS 1984: 65-73
1981
1 Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman: Optimal Wiring between Rectangles STOC 1981: 312-317

Coauthor Index

1Richard Cole [2] [3] [6] [19]
2Danny Dolev [1] [5]
3Amos Fiat [7] [8] [13] [14]
4Kevin Karplus [1]
5Bud Mishra (Bhubaneswar Mishra) [19]
6J. Ian Munro [13]
7Moni Naor [7] [8] [13] [14]
8Alejandro A. Schäffer [8] [13]
9Jeanette P. Schmidt [7] [8] [9] [11] [12] [13] [14] [15] [16] [19]
10Aravind Srinivasan [15] [16]
11Alex Strong [1]
12Jeffrey D. Ullman [1]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)