Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9613
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing ; day:21 ; month:11 ; year:2016 ; pages:1-6
Journal of statistical physics ; (21.11.2016), 1-6
- Creator
-
Cieśla, Michał
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10955-016-1673-y
- URN
-
urn:nbn:de:1111-201612114092
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 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
- Cieśla, Michał
- SpringerLink (Online service)
Other Objects (12)
Random iterations of subhyperbolic relaxed Newton's methods
Random Function Iterations for Stochastic Feasibility Problems
Best Fit Bin Packing with Random Order Revisited
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Random walks in random environment : random orientations and branching
Random Walks in Random Environment: Random Orientations and Branching
Random iterations of subhyperbolic relaxed Newton's methods
Random Function Iterations for Stochastic Feasibility Problems
Best Fit Bin Packing with Random Order Revisited
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Random walks in random environment : random orientations and branching
Random Walks in Random Environment: Random Orientations and Branching
Random iterations of subhyperbolic relaxed Newton's methods
Random Function Iterations for Stochastic Feasibility Problems
Best Fit Bin Packing with Random Order Revisited
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Random walks in random environment : random orientations and branching