Browsing by Author "Martínez Parra, Conrado"
Now showing items 1-20 of 33
-
A Top-down design of a parallel dictionary using skip lists
(1994-02)
External research report
Open AccessWe present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give algorithms to search, insert or delete k elements in a skip list of n elements, in parallel. The algorithms are simple ... -
An Efficient generic algorithm for the generation of unlabelled cycles
(2003-06-06)
External research report
Open AccessIn this report we combine two recent generation algorithms to obtain a new algorithm for the generation of unlabelled cycles. Sawada's algorithm lists all k-ary unlabelled cycles with fixed content, that is, the number ... -
Analysis of an optimized search algorithm for skip lists
(1994-03)
External research report
Open AccessIt was suggested in Pugh's Skip List Cookbook to avoid redundant queries in the skip list search algorithm by marking those elements whose key had already been checked by the search algorithm. We present here a precise ... -
Analysis of Hoare's FIND algorithm with median-of-three partition
(1995-02)
External research report
Open AccessHoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a remarkable similarity to Quicksort; in each pass of the algorithm, a pivot element is used to split the file into two ... -
Analysis of pivot sampling in dual-pivot Quicksort: A holistic analysis of Yaroslavskiy's partitioning scheme
(2016-08)
Article
Open AccessThe new dual-pivot Quicksort by Vladimir Yaroslavskiy-used in Oracle's Java runtime library since version 7-features intriguing asymmetries. They make a basic variant of this algorithm use less comparisons than classic ... -
Analysis of quickfind with small subfiles
(2001-11)
External research report
Open AccessIn this paper we investigate the variants of the well-known Hoare's Quickfind algorithm for the selection of the j-th element out of n, when recursion stops for subfiles whose size is below a predefined threshold and a ... -
Analysis of the strategy "Hiring above the alpha-quantile"
(2012-11)
External research report
Open AccessWe study here the strategy hiring above the α-quantile of the hired staff. This strategy was introduced first by Archibald and Martınez in 2009. We show here more results like lower and upper bounds for many interesting ... -
Average-case analysis of equality of binary trees under the BST probability model
(1991-03)
External research report
Open AccessIn this paper a simple algorithm to test equality of binary trees currently used in symbolic computation, unification, etc. is investigated. Surprisingly enough, it takes 0(1) steps on average to decide if a given pair of ... -
Average-case analysis on simple families of trees using a balanced probabilistic model
(1991-02-20)
External research report
Open AccessIn this paper we study a balanced probability model defined over simple families of trees, which from the point of doing statistics on trees, behave in quite a different way from the uniform distribution. Using the new ... -
Deletion algorithms for binary search trees
(1990-10-19)
External research report
Open AccessThe effect of updating (deletions/insertions) on binary search trees has been an interesting research topic for almost three decades, but in the last five years there have been a few contributions, due partially to the ... -
Elaboració d’un pla de tutories per a la FIB
(Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2013-02-08)
Conference report / Conference lecture
Open AccessLa majoria d'estudiants que accedeixen a la universitat, i en concret a la FIB, no són conscients del que comporta cursar una carrera universitària. Els estudis universitaris requereixen molta dedicació. Sovint els ... -
Fixed partial match queries in quadtrees
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
Conference report
Open AccessSeveral recent papers in the literature have addressed the analysis of the cost P_{n,q} of partial match search for a given fixed query q - that has s out of K specified coordinates - in different multidimensional data ... -
Generic algorithms for the generation of combinatorial objects
(2003-06)
External research report
Open AccessThis report briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite description of a combinatorial class A using ... -
Hiring above the m-th best candidate: a generalization of records in permutations
(2011)
External research report
Open AccessThe hiring problem is a simple model of on-line decision- making under uncertainty. As in many other such models, the input is a sequence of instances and a decision must be taken for each instance depending on the subsequence ... -
On deletions in open addressing hashing
(Society for Industrial and Applied Mathematics (SIAM), 2018)
Conference report
Open AccessDeletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting ... -
On deletions in open addressing hashing
(2011)
External research report
Open AccessDeletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark ’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting ... -
On the average performance of fixed partial match queries in random relaxed K-d trees
(2014)
Conference report
Restricted access - publisher's policyWe obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified ... -
On the average performance of orthogonal range search in multidimensional data structures
(2001-11)
External research report
Open AccessIn this work we present the average-case analysis of orthogonal range search for several multidimensional data structures. We first consider random relaxed K-d trees as a prototypical example and later extend our results ... -
On the average size of the intersection of binary trees
(1989-01)
External research report
Open AccessThe average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by ... -
On the competitiveness of the move-to-front rule
(1996-11)
External research report
Open AccessWe consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (Amortized Efficiency of List Update and Paging Rules, CACM, 28(2):202-208, ...
