- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Efficient 1-Space Bounded Hypercube Packing Algorithm ; day:5 ; month:6 ; year:2020 ; pages:1-34
Algorithmica ; (5.6.2020), 1-34
- Creator
-
Grzegorek, Paulina
Januszewski, Janusz
Zielonka, Łukasz
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-020-00723-5
- URN
-
urn:nbn:de:101:1-2020080620142549128578
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:55 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
- Grzegorek, Paulina
- Januszewski, Janusz
- Zielonka, Łukasz
- SpringerLink (Online service)
Other Objects (12)
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Space bounded learning algorithms
Proof of the tree packing conjecture for bounded degree trees
The Mann algorithm in a complete geodesic space with curvature bounded above
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Sublinearly space bounded iterative arrays
Efficient distributed bounded property checking
A fast and efficient particle packing generation algorithm with controllable gradation for discontinuous deformation analysis
Bounded perturbation resilience of the viscosity algorithm
New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Space bounded learning algorithms
Proof of the tree packing conjecture for bounded degree trees
The Mann algorithm in a complete geodesic space with curvature bounded above
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Sublinearly space bounded iterative arrays
Efficient distributed bounded property checking
A fast and efficient particle packing generation algorithm with controllable gradation for discontinuous deformation analysis
Bounded perturbation resilience of the viscosity algorithm
New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Space bounded learning algorithms
Proof of the tree packing conjecture for bounded degree trees
The Mann algorithm in a complete geodesic space with curvature bounded above
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Sublinearly space bounded iterative arrays
Efficient distributed bounded property checking
A fast and efficient particle packing generation algorithm with controllable gradation for discontinuous deformation analysis
Bounded perturbation resilience of the viscosity algorithm