SIGN IN
SIGN UP
Is linear hashing good?
Full Text:
PDF
Buy this Article
Authors:
Noga Alon
Dep. of Math., Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel and Institute for Advanced Study, Princeton, NJ
Martin Dietzfelbinger
Fachbereich Informatik, Lehrstuhl II, Universität Dortmund, D-44221 Dortmund, Germany
Peter Bro Miltersen
BRICS, Centre of the Danish National Research Foundation, University of Aarhus, Ny Munkegade, Aarhus, Denmark
Erez Petrank
DIMACS, P.O.Box 1179, Piscataway, NJ
Gábor Tardos
Mathematical Institute of the Hungarian Academy of Sciences, Pf. 127, Budapest, H-1364 Hungary and Institute for Advanced Study, Princeton, NJ
1997 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 18
· Downloads (cumulative): 477
· Citation Count: 3
Published in:
· Proceeding
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Pages 465-474
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-888-6
doi>
10.1145/258533.258639
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
design
hash-table representations
linear systems
performance
probabilistic computation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder