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
Distributed Algorithms for the Graph Biconnectivity and Lea..:
, In:
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
,
Bogle, Ian
;
Slota, George M.
- p. 1139-1142 , 2022
Link:
https://doi.org/10.1109/IPDPSW55747.2022.00187
RT T1
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
: T1
Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems
UL https://suche.suub.uni-bremen.de/peid=ieee-9835316&Exemplar=1&LAN=DE A1 Bogle, Ian A1 Slota, George M. YR 2022 K1 Distributed processing K1 Social networking (online) K1 Conferences K1 Distributed algorithms K1 biconnectivity K1 least common ancestor K1 parallel algorithms SP 1139 OP 1142 LK http://dx.doi.org/https://doi.org/10.1109/IPDPSW55747.2022.00187 DO https://doi.org/10.1109/IPDPSW55747.2022.00187 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)