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
Communication Avoiding All-Pairs Shortest Paths Algorithm f..:
, In:
50th International Conference on Parallel Processing
,
Zhu, Lin
;
Hua, Qiang-Sheng
;
Jin, Hai
- p. 1-10 , 2021
Link:
https://dl.acm.org/doi/10.1145/3472456.3472524
RT T1 <cTitle>50th International Conference on Parallel Processing</cTitle>: T1 <Title>Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3472524&Exemplar=1&LAN=DE A1 Zhu, Lin A1 Hua, Qiang-Sheng A1 Jin, Hai PB ACM YR 2021 K1 APSP K1 communication complexity K1 parallel algorithms K1 sparse graphs SP 1 OP 10 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3472456.3472524 DO https://dl.acm.org/doi/10.1145/3472456.3472524 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
