A characterization of the set of fixed points of the quicksort transformation.
A limit theorem for “quicksort”
A limiting distribution for quicksort
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.
A new class of balanced search trees : half-balanced binary search tress
A new uncertainty-aware similarity for user-based collaborative filtering
User-based Collaborative Filtering (UBCF) is a common approach in Recommender Systems (RS). Essentially, UBCF predicts unprovided entries for the target user by selecting similar neighbors. The effectiveness of UBCF greatly depends on the selected similarity measure and the subsequent choice of neighbors. This paper presents a new Uncertainty-Aware Similarity measure "UASim" which enhances CF by accurately calculating how similar, dissimilar, and uncertain users' preferences are. Uncertainty is...
A note on certain ergodicity coeflcients
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem...
A note on the asymptotic behavior of the heights in -trees for large.
A static sorting algorithm for sytems with mobile catalysts.
Adaptive search heuristics for the generalized assignment problem.
The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an adaptive sampling...
An analysis of selection sort using recurrence relations.
This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm...
An application of -ary trees to the design of data structures for geometric searching problems
Analysis of Algorithms: An Example of a Sort Algorithm
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
Analysis of quickselect : an algorithm for order statistics
Application of the Constrained Edit Distance Algorithm to Search Procedures
Arbitrary weight changes in dynamic trees