| Preface | p. vii |
| Introduction | p. 1 |
| The Flory model | p. 9 |
| One-dimensional discrete random sequential packing | p. 9 |
| Application of generating function | p. 10 |
| Number of gaps | p. 13 |
| Minimum of gaps | p. 17 |
| Packing on circle and numerical study | p. 20 |
| Appendix: Complex Analysis | p. 21 |
| Random interval packing | p. 23 |
| The probabilistic setup of the problem | p. 24 |
| The solution of the delay differential equation using Laplace transform | p. 26 |
| The computation of the limit | p. 28 |
| Packing on circle and the speed of convergence | p. 31 |
| Appendix: The Laplace transform | p. 36 |
| On the minimum of gaps generated by 1-dimensional random packing | p. 39 |
| Main properties of Pr(L(x) ≥ h) | p. 39 |
| Laplace transform of Pr(L(x) ≥ h) | p. 42 |
| Numerical calculations for a (h) | p. 45 |
| Asymptotic analysis for a(h) | p. 49 |
| Renewal equation technique | p. 50 |
| Approximation for small 1 - h | p. 53 |
| Approximation for small h | p. 56 |
| Maximum of gaps | p. 63 |
| Appendix: Renewal equations | p. 64 |
| Integral equation method for the 1-dimensional random packing | p. 69 |
| Estimating M(x) - CRx | p. 69 |
| The variance and the central limit theorem | p. 76 |
| Random sequential bisection and its associated binary tree | p. 83 |
| Random sequential bisection | p. 84 |
| Binary search tree | p. 86 |
| Expected number of nodes at the d-th level | p. 91 |
| Exponential distribution and uniform distribution | p. 92 |
| Asymptotic size of the associated tree | p. 93 |
| Asymptotic shape of the associated tree | p. 94 |
| More on the associated tree | p. 97 |
| The unified Kakutani Rényi model | p. 99 |
| The limit random packing density | p. 100 |
| Expectation and variance of number of cars for l = 0 | p. 102 |
| The central limit theorem | p. 106 |
| Almost sure convergence results | p. 109 |
| The limit distribution of a randomly chosen gap | p. 112 |
| Parking cars with spin but no length | p. 123 |
| Integral equations | p. 124 |
| Existence of the limit packing density | p. 126 |
| Laplace transform and explicitly solvable cases | p. 130 |
| General solution methods | p. 131 |
| The power series solution | p. 135 |
| Numerical computations | p. 139 |
| Random sequential packing simulations | p. 145 |
| Sequential random packing and the covering problem | p. 145 |
| Random packing of spheres | p. 148 |
| Random packing of cubes | p. 151 |
| Random sequential coding by Hamming distance | p. 153 |
| Frequency of getting Golay code by a random sequential packing | p. 157 |
| Discrete cube packings in the cube | p. 161 |
| Setting of a goal | p. 161 |
| Reduction to another problem | p. 162 |
| Proof of the theorem | p. 167 |
| Discrete cube packings in the torus | p. 171 |
| Introduction | p. 171 |
| Algorithm for generating cube packings | p. 173 |
| Non-extensible cube packings | p. 176 |
| The second moment | p. 182 |
| Appendix: Crystallographic groups | p. 185 |
| Continuous random cube packings in cube and torus | p. 189 |
| Introduction | p. 189 |
| Combinatorial cube packings | p. 191 |
| Discrete random cube packings of the cube | p. 199 |
| Combinatorial torus cube packings and lamination construction | p. 203 |
| Properties of non-extensible cube packings | p. 210 |
| Combinatorial Enumeration | p. 219 |
| The isomorphism and automorphism problems | p. 220 |
| Sequential exhaustive enumeration | p. 224 |
| The homomorphism principle | p. 225 |
| Bibliography | p. 227 |
| Index | p. 237 |
| Table of Contents provided by Ingram. All Rights Reserved. |
