I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Fast hashing with strong concentration bounds:
, In:
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
,
Aamand, Anders
;
Knudsen, Jakob Bæk Tejs
;
Knudsen, Mathias Bæk Tejs
.. - p. 1265-1278 , 2020
Link:
https://dl.acm.org/doi/10.1145/3357713.3384259
RT T1 <cTitle>Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>Fast hashing with strong concentration bounds</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3384259&Exemplar=1&LAN=DE A1 Aamand, Anders A1 Knudsen, Jakob Bæk Tejs A1 Knudsen, Mathias Bæk Tejs A1 Rasmussen, Peter Michael Reichstein A1 Thorup, Mikkel PB ACM YR 2020 K1 Chernoff bounds K1 concentration bounds K1 hashing K1 sampling K1 streaming algorithms K1 Theory of computation K1 Randomness, geometry and discrete structures K1 Pseudorandomness and derandomization K1 Design and analysis of algorithms K1 Streaming, sublinear and near linear time algorithms K1 Sketching and sampling K1 Data structures design and analysis SP 1265 OP 1278 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3357713.3384259 DO https://dl.acm.org/doi/10.1145/3357713.3384259 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
