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 Minimum Cuts in Near-linear Work and Low Depth:
, In:
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
,
Geissmann, Barbara
;
Gianinazzi, Lukas
- p. 1-11 , 2018
Link:
https://dl.acm.org/doi/10.1145/3210377.3210393
RT T1
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
: T1
Parallel Minimum Cuts in Near-linear Work and Low Depth
UL https://suche.suub.uni-bremen.de/peid=acm-3210393&Exemplar=1&LAN=DE A1 Geissmann, Barbara A1 Gianinazzi, Lukas PB ACM YR 2018 K1 cache-oblivious algorithms K1 graph algorithms K1 minimum cut K1 minimum path data structure K1 parallel algorithms K1 Theory of computation K1 Design and analysis of algorithms K1 Parallel algorithms SP 1 OP 11 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3210377.3210393 DO https://dl.acm.org/doi/10.1145/3210377.3210393 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)