We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved f
On optimal dividend payments and related problems
β Scribed by K.-H. Waldmann
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 728 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0167-6687
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present an iterative domain decomposition method to solve the Helmholtz equation and related optimal control problems. The tionally expresses that the control is optimal. This method proof of convergence of this method relies on energy techniques. actually solves at the same time the equations an
## Strong fractionation of deuterium in photolysis of H 2 O and above the hygropause reduces the production of HD relative to H 2 on Mars by a factor of 3.7 total. The model by Y. L. Yung et al. (1988, Icarus 76, 146-159) for deuterium fractionation in chemical reactions on Mars corrected for this