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
Fully-adaptive minimal deadlock-free packet routing in hype..:
, In:
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
,
Pifarré, Gustavo D.
;
Gravano, Luis
;
Felperin, Sergio A.
. - p. 278-290 , 1991
Link:
https://dl.acm.org/doi/10.1145/113379.113405
RT T1 <cTitle>Proceedings of the third annual ACM symposium on Parallel algorithms and architectures</cTitle>: T1 <Title>Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks</Title> UL https://suche.suub.uni-bremen.de/peid=acm-113405&Exemplar=1&LAN=DE A1 Pifarré, Gustavo D. A1 Gravano, Luis A1 Felperin, Sergio A. A1 Sanz, Jorge L. C. PB ACM YR 1991 K1 Networks K1 Network types K1 Packet-switching networks K1 Computer systems organization K1 Architectures K1 Parallel architectures K1 Theory of computation K1 Models of computation K1 Concurrency K1 Parallel computing models K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Randomness, geometry and discrete structures SP 278 OP 290 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/113379.113405 DO https://dl.acm.org/doi/10.1145/113379.113405 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
