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
Almost Optimal Streaming Algorithms for Coverage Problems:
, In:
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
,
Bateni, MohammadHossein
;
Esfandiari, Hossein
;
Mirrokni, Vahab
- p. 13-23 , 2017
Link:
https://dl.acm.org/doi/10.1145/3087556.3087585
RT T1
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
: T1
Almost Optimal Streaming Algorithms for Coverage Problems
UL https://suche.suub.uni-bremen.de/peid=acm-3087585&Exemplar=1&LAN=DE A1 Bateni, MohammadHossein A1 Esfandiari, Hossein A1 Mirrokni, Vahab PB ACM YR 2017 K1 coverage maximization K1 distributed algorithm K1 set cover K1 streaming algorithms K1 submodular maximization K1 Theory of computation K1 Models of computation K1 Streaming models K1 Design and analysis of algorithms K1 Streaming, sublinear and near linear time algorithms K1 Sketching and sampling K1 Concurrency K1 Distributed computing models K1 Parallel algorithms K1 MapReduce algorithms K1 Distributed algorithms K1 Approximation algorithms analysis SP 13 OP 23 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3087556.3087585 DO https://dl.acm.org/doi/10.1145/3087556.3087585 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)