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
A Framework for Adversarially Robust Streaming Algorithms:
, In:
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
,
Ben-Eliezer, Omri
;
Jayaram, Rajesh
;
Woodruff, David P.
. - p. 63-80 , 2020
Link:
https://dl.acm.org/doi/10.1145/3375395.3387658
RT T1 <cTitle>Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</cTitle>: T1 <Title>A Framework for Adversarially Robust Streaming Algorithms</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3387658&Exemplar=1&LAN=DE A1 Ben-Eliezer, Omri A1 Jayaram, Rajesh A1 Woodruff, David P. A1 Yogev, Eylon PB ACM YR 2020 K1 adversarial robustness K1 databases K1 distinct elements K1 frequency moments K1 heavy hitters K1 streaming algorithms 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 Approximation algorithms analysis K1 Rounding techniques K1 Online algorithms K1 Adversary models SP 63 OP 80 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3375395.3387658 DO https://dl.acm.org/doi/10.1145/3375395.3387658 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
