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
Optimal false-positive-free Bloom filter design for scalabl..:
Tapolcai, János
;
Bíró, József
;
Babarczi, Péter
...
IEEE/ACM Transactions on Networking (TON). 23 (2015) 6 - p. 1832-1845 , 2015
Link:
https://dl.acm.org/doi/10.1109/TNET.2014.2342155
RT Journal T1
Optimal false-positive-free Bloom filter design for scalable multicast forwarding
UL https://suche.suub.uni-bremen.de/peid=acm-2996511&Exemplar=1&LAN=DE A1 Tapolcai, János A1 Bíró, József A1 Babarczi, Péter A1 Gulyás, András A1 Heszberger, Zalán A1 Trossen, Dirk PB IEEE Press YR 2015 SN 1063-6692 K1 Bloom filter K1 information-centric networking K1 multicast addressing K1 source routing JF IEEE/ACM Transactions on Networking (TON) VO 23 IS 6 SP 1832 OP 1845 LK http://dx.doi.org/https://dl.acm.org/doi/10.1109/TNET.2014.2342155 DO https://dl.acm.org/doi/10.1109/TNET.2014.2342155 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)