Arthur B. Davies, Sacramental Trees

Arthur-Merlin Games in Boolean Decision Trees

It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...

B Davies 14 April 2006 1 Introduction

B-slack Trees: Space Efficient B-Trees

B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.

Sacramental and spiritual use of hallucinogenic drugs.

Arguably, the religious use of hallucinogenic drugs stems from a human search of metaphysical insight rather than from a direct need for cognitive, emotional, social, physical, or sexual improvement. Therefore, the sacramental and spiritual intake of hallucinogenic drugs goes so far beyond other biopsychosocial functions that it deserves its own category in the drug instrumentalization list.

B-slack trees: Highly Space Efficient B-trees

B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.