Now showing items 1-5 of 5

    • Extending STL maps using LBSTs 

      Frias Moya, Leonor (2005-11)
      External research report
      Open Access
      Associative containers are basic generic classes of the C++ standard library. Access to the elements can be done by key or iterator, but not by rank. This paper presents a new implementation of the map class, which extends ...
    • Lists revisited: cache conscious STL lists 

      Frias Moya, Leonor; Petit Silvestre, Jordi; Roura Ferret, Salvador (2005-11)
      External research report
      Open Access
      We present three cache conscious implementations of STL standard compliant lists. Up to now, one could either find simple double linked list implementations that easily cope with standard strict requirements, or theoretical ...
    • Multikey Quickselect 

      Frias Moya, Leonor; Roura Ferret, Salvador (2009-07)
      External research report
      Open Access
      In this paper we introduce Multikey Quickselect: an efficient, in-place, and easy to implement algorithm for the selection problem for strings. We present several variants of our basic algorithm, which apply to two different ...
    • On the number of string lookups in BSTs (and related algorithms) with digital access 

      Frias Moya, Leonor (2009-05)
      External research report
      Open Access
      Binary search trees and quicksort are examples of comparison-based data structure and algorithm respectively. Comparison-based data structures and algorithms can be can be augmented so that no redundant character comparisons ...
    • Parallel partition revisited 

      Frias Moya, Leonor; Petit Silvestre, Jordi (2008-02)
      External research report
      Open Access
      In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose ...