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
Parallel Shortest Paths with Negative Edge Weights:
, In:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
,
Cao, Nairen
;
Fineman, Jeremy T.
;
Russell, Katina
- p. 177-190 , 2022
Link:
https://dl.acm.org/doi/10.1145/3490148.3538583
RT T1
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
: T1
Parallel Shortest Paths with Negative Edge Weights
UL https://suche.suub.uni-bremen.de/peid=acm-3538583&Exemplar=1&LAN=DE A1 Cao, Nairen A1 Fineman, Jeremy T. A1 Russell, Katina PB ACM YR 2022 K1 parallel algorithm K1 shortest paths K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis K1 Shortest paths K1 Parallel algorithms SP 177 OP 190 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3490148.3538583 DO https://dl.acm.org/doi/10.1145/3490148.3538583 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)