This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-...
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...