Now showing items 1-20 of 46

    • A new distribution to do statistics on k-ary trees 

      Cases Muñoz, Rafael; Díaz Cort, Josep; Martínez Parra, Conrado (1990-04-02)
      Research report
      Open Access
      In this paper we study distributions on k-ary trees, which from the point of doing statistics on trees, they behave in a more realistic way than the usual uniform distribution. In particular, we choose a distribution for ...
    • A probabilistic model revealing shortcomings in Lua’s hybrid tables 

      Martínez Parra, Conrado; Nicaud, Cyril; Rotondo, Pablo (Springer, 2022)
      Part of book or chapter of book
      Open Access
      Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mechanism in Lua, is an associative array ...
    • A Top-down design of a parallel dictionary using skip lists 

      Gabarró Vallès, Joaquim; Martínez Parra, Conrado; Messeguer Peypoch, Xavier (1994-02)
      Research report
      Open Access
      We 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 ...
    • Affirmative sampling: theory and applications 

      Lumbroso, Jérémie; Martínez Parra, Conrado (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
      Conference report
      Open Access
      Affirmative Sampling is a practical and efficient novel algorithm to obtain random samples of distinct elements from a data stream. Its most salient feature is that the size S of the sample will, on expectation, grow with ...
    • An Efficient generic algorithm for the generation of unlabelled cycles 

      Martínez Parra, Conrado; Molinero Albareda, Xavier (2003-06-06)
      Research report
      Open Access
      In 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 

      Martínez Parra, Conrado (1994-03)
      Research report
      Open Access
      It 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 

      Kirschenhofer, P; Martínez Parra, Conrado; Prodinger, H (1995-02)
      Research report
      Open Access
      Hoare'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 

      Nebel, Markus E.; Wild, Sebastian; Martínez Parra, Conrado (2016-08)
      Article
      Open Access
      The 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 

      Martínez Parra, Conrado; Panario, Daniel; Viola Deambrosis, Alfredo (2001-11)
      Research report
      Open Access
      In 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" 

      Helmiy, Ahmed; Martínez Parra, Conrado; Panholzer, Alois (2012-11)
      Research report
      Open Access
      We 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 

      Martínez Parra, Conrado (1991-03)
      Research report
      Open Access
      In 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 

      Cases Muñoz, Rafel; Díaz Cort, Josep; Martínez Parra, Conrado (1991-02-20)
      Research report
      Open Access
      In 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 

      Martínez Parra, Conrado; Messeguer Peypoch, Xavier (1990-10-19)
      Research report
      Open Access
      The 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 

      Mora Giné, Mercè; Castell Ariño, Núria; Fernández Ruzafa, José; Herrero Zaragoza, José Ramón; Sánchez Carracedo, Fermín; Martínez Parra, Conrado; Nonell i Torrent, Ramon; Raventós Pagès, Ruth; Rius Carrasco, Roser (Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2013-02-08)
      Conference report / Conference lecture
      Open Access
      La 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 

      Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
      Conference report
      Open Access
      Several 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 ...
    • Fonaments teòrics del paral·lelisme : apunts del curs de doctorat 

      Gabarró Vallès, Joaquim; Martínez Parra, Conrado (1994-11)
      Research report
      Open Access
      This manuscript consists of the lecture notes for the doctorate course Theoretical Foundations of Parallelism taugth in 1994. The notes were written by the students and they are not meant to be in polished form.
    • Generic algorithms for the generation of combinatorial objects 

      Molinero Albareda, Xavier; Martínez Parra, Conrado (2003-06)
      Research report
      Open Access
      This 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 ...
    • Guía y normas de programación de las prácticas de EDA 

      Jiménez Gómez, Rosa María; Martínez Parra, Conrado (2002-04-09)
      Research report
      Open Access
    • Hiring above the m-th best candidate: a generalization of records in permutations 

      Helmy, Ahmed Mohamed; Martínez Parra, Conrado; Panholzer, Alois (2011)
      Research report
      Open Access
      The 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 ...
    • Informàtica bàsica II, ETSEIB. Memòria del curs 1994-1995 

      Vila Marta, Sebastià; Pla García, Núria; Soto Riera, Antoni; Pérez Vidal, Lluís; Roura Ferret, Salvador; Franquesa Niubó, Marta; Cotrina Navau, Josep; Alquézar Mancho, René; Martínez Parra, Conrado (1995-02-06)
      Research report
      Open Access
      Memòria de l'assignatura d'Infomàtica bàsica II del curs 94-95.