default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan R. Siegel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c14]Eric Andrew Freudenthal, Mary K. Roy, Alexandria Nicole Ogrey, Tanja Magoc, Alan Siegel:
MPCT: media propelled computational thinking. SIGCSE 2010: 37-41
2000 – 2009
- 2005
- [j14]Alan Siegel:
Remembrances of Bob Paige. High. Order Symb. Comput. 18(1-2): 9-11 (2005) - 2004
- [j13]Alan Siegel:
On Universal Classes of Extremely Random Constant-Time Hash Functions. SIAM J. Comput. 33(3): 505-543 (2004) - 2003
- [j12]Alan Siegel:
An Isoperimetric Theorem in Plane Geometry. Discret. Comput. Geom. 29(2): 239-255 (2003) - 2002
- [j11]Alan Siegel:
A Dido Problem as Modernized by Fejes Toth. Discret. Comput. Geom. 27(2): 227-250 (2002) - 2001
- [j10]Alan Siegel:
Median Bounds and Their Application. J. Algorithms 38(1): 184-236 (2001) - 2000
- [j9]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)
1990 – 1999
- 1999
- [c13]Alan Siegel:
Median Bounds and Their Application. SODA 1999: 776-785 - 1995
- [j8]Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. 8(2): 223-250 (1995) - [c12]Alan Siegel:
On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. SODA 1995: 10-19 - 1993
- [c11]Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA 1993: 331-340 - 1992
- [j7]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992) - 1991
- [j6]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) - [j5]Richard Cole, Alan Siegel:
Report on the Second Workshop on Parallel Algorithms (WOPA). SIGACT News 22(3): 20-23 (1991) - 1990
- [j4]Jeanette P. Schmidt, Alan Siegel:
The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM J. Comput. 19(5): 775-786 (1990) - [c10]Jeanette P. Schmidt, Alan Siegel:
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract). STOC 1990: 224-234
1980 – 1989
- 1989
- [c9]Alan Siegel:
On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract). FOCS 1989: 20-25 - [c8]Jeanette P. Schmidt, Alan Siegel:
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract). STOC 1989: 355-366 - 1988
- [j3]Richard Cole, Alan Siegel:
Optimal VLSI circuits for sorting. J. ACM 35(4): 777-809 (1988) - [j2]Alan Siegel, Danny Dolev
:
Some Geometry for General River Routing. SIAM J. Comput. 17(3): 583-605 (1988) - [c7]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 - [c6]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Non-Oblivious Hashing (Extended Abstract). STOC 1988: 367-376 - 1986
- [c5]Alan Siegel:
Aspects of Information Flow in VLSI Circuits (Extended Abstract). STOC 1986: 448-459 - 1985
- [j1]Alan R. Siegel:
Minimum Storage Sorting Networks. IEEE Trans. Computers 34(4): 355-361 (1985) - [c4]Richard Cole, Alan Siegel:
On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract). FOCS 1985: 208-221 - 1984
- [c3]Richard Cole, Alan Siegel:
River Routing Every Which Way, but Loose (Extended Abstract). FOCS 1984: 65-73 - 1983
- [b1]Alan R. Siegel:
River routing: the theory and methodology. Stanford University, USA, 1983 - [c2]Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel:
Techniques for Solving Graph Problems in Parallel Environments. FOCS 1983: 351-359 - 1981
- [c1]Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman:
Optimal Wiring between Rectangles. STOC 1981: 312-317
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
