Previously, it was shown in a paper by Kaldewaij and Schoenmakers that for top-down skew heaps the amortized number of comparisons required for meld and delmin is upper bounded by log+ R, where n is the total size of the inputs to these operations and r#~ = (& + 1) /2 denotes the golden ratio. In th
The derivation of a tighter bound for top-down skew heaps
β Scribed by Anne Kaldewaij; Berry Schoenmakers
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 915 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let ~1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S so that each edge is crossed over by no more than one other edge. In the previous paper the author has proved that F(S) -34 ~< ~1(S), where F(S) = [\_Β½(9 + ~/(81 -32E(S))).J is Ringel's upper bound for xl(S) a
## Abstract We present a method employing topβdown Fourier transform mass spectrometry (FTMS) for the rapid profiling of amino acid sideβchain reactivity. The reactivity of sideβchain groups can be used to infer residueβspecific solvent accessibility and can also be used in the same way as H/D exch