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
Closing the Gap Between Cache-oblivious and Cache-adaptive ..:
, In:
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
,
Bender, Michael A.
;
Chowdhury, Rezaul A.
;
Das, Rathish
... - p. 63-73 , 2020
Link:
https://dl.acm.org/doi/10.1145/3350755.3400274
RT T1
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
: T1
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis
UL https://suche.suub.uni-bremen.de/peid=acm-3400274&Exemplar=1&LAN=DE A1 Bender, Michael A. A1 Chowdhury, Rezaul A. A1 Das, Rathish A1 Johnson, Rob A1 Kuszmaul, William A1 Lincoln, Andrea A1 Liu, Quanquan C. A1 Lynch, Jayson A1 Xu, Helen PB ACM YR 2020 K1 cache-adaptive algorithms K1 cache-oblivious algorithms K1 smoothed analysis K1 Theory of computation K1 Design and analysis of algorithms K1 Parallel algorithms K1 Online algorithms K1 Caching and paging algorithms SP 63 OP 73 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3350755.3400274 DO https://dl.acm.org/doi/10.1145/3350755.3400274 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)