Rosa M. Jiménez

Learn More
Introduction The problem: Input: An array A[1..n] of n items drawn from a totally ordered domain; a set I = {[ t , u t ] | 1 t p} of p disjoint intervals with 1 1 u 1 < 2 u 2 < · · · < p u p n, Output: The array A rearranged in such a way that 1 A[ t ..u t ] contains the t th,.. . ,u t th smallest elements of A in nondecreasing order, for all t, 1 t p 2 A[u(More)
Easy solution: use an efficient selection algorithm, with (expected) linear cost, e.g., using Hoare's or Floyd and Rivest's algorithms for selection Introduction • What if the collection is organized in some multidimensional index? (e.g., a K-d tree, a quadtree,. . .) • If K = 1 and the collection of n records is stored in some kind of binary search tree ⇒(More)
In this paper we continue previous work from Sannella, Sokolowski and Tarlecki on parameterization in specification languages. Within the loose approach, we define specification and model level semantics for two kinds of parameterizations (parameterized specifications and specifications of parameterized data types) and describe, in a compositional manner,(More)
  • 1