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
Minimum Cost Loop Nests for Contraction of a Sparse Tensor ..:
, In:
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
,
Kanakagiri, Raghavendra
;
Solomonik, Edgar
- p. 169-181 , 2024
Link:
https://dl.acm.org/doi/10.1145/3626183.3659985
RT T1
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
: T1
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network
UL https://suche.suub.uni-bremen.de/peid=acm-3659985&Exemplar=1&LAN=DE A1 Kanakagiri, Raghavendra A1 Solomonik, Edgar PB ACM YR 2024 K1 sparse tensor algebra K1 tensor contraction K1 tensor decomposition and completion K1 Theory of computation K1 Design and analysis of algorithms K1 Algorithm design techniques K1 Dynamic programming K1 Software and its engineering K1 Software notations and tools K1 Compilers K1 Runtime environments K1 Parallel algorithms K1 Massively parallel algorithms SP 169 OP 181 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3626183.3659985 DO https://dl.acm.org/doi/10.1145/3626183.3659985 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)