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
Brief Announcement : A Tight Distributed Algorithm for A..:
, In:
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
,
Hua, Qiang-Sheng
;
Fan, Haoqiang
;
Qian, Lixiang
... - p. 439-441 , 2016
Link:
https://dl.acm.org/doi/10.1145/2935764.2935812
RT T1 <cTitle>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures</cTitle>: T1 <Title>Brief Announcement : A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2935812&Exemplar=1&LAN=DE A1 Hua, Qiang-Sheng A1 Fan, Haoqiang A1 Qian, Lixiang A1 Ai, Ming A1 Li, Yangyang A1 Shi, Xuanhua A1 Jin, Hai PB ACM YR 2016 K1 all-pairs-shortest-paths K1 congest model K1 distributed algorithm K1 scheduling K1 Theory of computation K1 Design and analysis of algorithms K1 Distributed algorithms K1 Models of computation K1 Concurrency K1 Distributed computing models SP 439 OP 441 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2935764.2935812 DO https://dl.acm.org/doi/10.1145/2935764.2935812 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
