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
Routing without ordering:
, In:
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
,
Charron-Bost, Bernadette
;
Gaillard, Antoine
;
Welch, Jennifer
. - p. 145-153 , 2009
Link:
https://dl.acm.org/doi/10.1145/1583991.1584034
RT T1 <cTitle>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures</cTitle>: T1 <Title>Routing without ordering</Title> UL https://suche.suub.uni-bremen.de/peid=acm-1584034&Exemplar=1&LAN=DE A1 Charron-Bost, Bernadette A1 Gaillard, Antoine A1 Welch, Jennifer A1 Widder, Josef PB ACM YR 2009 K1 link reversal K1 routing K1 work complexity K1 Computer systems organization K1 Architectures K1 Distributed architectures K1 Software and its engineering K1 Software organization and properties K1 Software system structures K1 Distributed systems organizing principles K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Theory of computation K1 Design and analysis of algorithms K1 Graph enumeration SP 145 OP 153 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1583991.1584034 DO https://dl.acm.org/doi/10.1145/1583991.1584034 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
