- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-0484
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Hyperbolic trees for efficient routing computation ; day:15 ; month:4 ; year:2022 ; pages:1-19
The journal of supercomputing ; (15.4.2022), 1-19
- Creator
-
Heszberger, Zalán
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11227-022-04485-5
- URN
-
urn:nbn:de:101:1-2022063019205963776104
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:35 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Heszberger, Zalán
- SpringerLink (Online service)
Other Objects (12)
Greedy routing optimisation in hyperbolic networks
Improving Quantum Computation by Optimized Qubit Routing
Periodic packet routing on trees
Computation by tree transductions
Robust computation tree logic
Distributed distance computation and routing with small messages
Computation and stability of patterns in hyperbolic-parabolic systems
Tree-Structured Problems and Parallel Computation
Efficient Detailed Routing on Optimized Tracks
Attack-resistant Embedding of Rooted Spanning Trees for Efficient Routing in Friend-to-Friend Overlays
On the computation of hyperbolic sets and their invariant manifolds
Efficient computation of descriptive patterns
Greedy routing optimisation in hyperbolic networks
Improving Quantum Computation by Optimized Qubit Routing
Periodic packet routing on trees
Computation by tree transductions
Robust computation tree logic
Distributed distance computation and routing with small messages
Computation and stability of patterns in hyperbolic-parabolic systems
Tree-Structured Problems and Parallel Computation
Efficient Detailed Routing on Optimized Tracks
Attack-resistant Embedding of Rooted Spanning Trees for Efficient Routing in Friend-to-Friend Overlays
On the computation of hyperbolic sets and their invariant manifolds
Efficient computation of descriptive patterns
Greedy routing optimisation in hyperbolic networks
Improving Quantum Computation by Optimized Qubit Routing
Periodic packet routing on trees
Computation by tree transductions
Robust computation tree logic
Distributed distance computation and routing with small messages
Computation and stability of patterns in hyperbolic-parabolic systems
Tree-Structured Problems and Parallel Computation
Efficient Detailed Routing on Optimized Tracks
Attack-resistant Embedding of Rooted Spanning Trees for Efficient Routing in Friend-to-Friend Overlays
On the computation of hyperbolic sets and their invariant manifolds