In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any othe...

in this paper, an algorithm is presented for the formation of optimal null basis vectors corresponding to sparse flexibility matrices. for controlling the independence of the vectors, a generator is selected in each corresponding self-equilibrating systems, and the sequence of generators is modeled as decision variables. since the equilibrium conditions and uniqueness of generators consists a u...

Current high-throughput experiments already generate enough data for retrieving the DNA sequence-dependent binding affinities of transcription factors (TF) and other chromosomal proteins throughout the complete genome. However, the reverse task of calculating binding maps in a chromatin context for a given set of concentrations and TF affinities appears to be even more challenging and computati...

This paper investigates price competition with private information on the demand side. Two sellers each offer a different variety of a good to a buyer endowed with a private binary signal on their relative quality. The model provides an informational foundation to differentiation in Hotelling's price competition game. Equilibrium comparative statics is performed with respect to the prior belief...