Thesis
| [1] |
L. Frias.
Data Structures Libraries.
PhD thesis, Universitat Politècnica de Catalunya, June 2010.
Advisors: Jordi Petit and Salvador Roura. [ bib ] [ .pdf ] [ Defense presentation (.pdf) ] [ Defense presentation (.wmv) ] |
Journal articles
| [2] |
L. Frias, J. Petit, and S. Roura.
Lists Revisited: Cache Conscious STL Lists.
Journal of Experimental Algorithmics (JEA),
14:3.5-3.27, 2009. [ bib ] [ DOI ] [ .pdf ] [ Source and tests ] [ Sourceforge project ] |
| [3] |
L. Frias, J. Singler, and P. Sanders.
Single-pass list partitioning.
Scalable Computing: Practice and Experience, 9(3):179-184, 2008. [ bib ] [ http ] [ .pdf ] [ Source (libstdc++ parallel mode) ] |
Articles in refereed conferences
| [4] |
L. Frias and J. Petit.
Combining digital access and parallel partition for quicksort and
quickselect.ICSE Workshop on Multicore Software Engineering, 0:33-40,
2009. [ bib ] [ DOI ] [ .pdf ] [ Source and tests ] [ IWMSE Presentation (.pdf) ] [ Sourceforge project ] |
| [5] |
L. Frias and J. Petit.
Parallel partition revisited.
In Experimental Algorithms, 7th International Workshop, WEA
2008, Provincetown, MA, USA, May 30-June 1, 2008, volume 5038 of
Lecture Notes in Computer Science, pages 142-153. Springer, 2008. [ bib ] [ .pdf ] [ Source and tests ] [ WEA Presentation (.pdf) ] [ Sourceforge project ] |
| [6] |
L. Frias, J. Singler, and P. Sanders.
Single-Pass List Partitioning.
In The Second International Conference on Complex, Intelligent
and Software Intensive Systems, pages 817-821. IEEE Computer Society Press,
March 2008. [ bib ] [ .pdf ] [ MuCoCoS Presentation (.pdf) ] [ Source (libstdc++ parallel mode) ] |
| [7] |
L. Frias and J. Singler.
Parallelization of Bulk Operations for STL Dictionaries.
In Proceedings of the Workshop on Highly Parallel
Processing on a Chip (HPPC), volume 4854,
pages 49-58. Lecture Notes in Computer Science, March 2008. [ bib ] [ http ] [ .pdf ] [ Source (in the MCSTL) ] [ HPPC Presentation (.pdf) ] |
| [8] |
L. Frias, J. Petit, and S. Roura.
Lists Revisited: Cache Conscious STL Lists.
In Proceedings of the Fifth International Workshop on
Experimental Algorithms (WEA), volume 4007, pages 121-133. Lecture Notes in
Computer Science, May 2006. [ bib ] [ http ] [ .pdf ] [ Source and tests ] [ WEA Presentation (.pdf) ] [ Sourceforge project ] |
| [9] |
L. Frias.
Extending STL maps using LBSTs.
In Proceedings of the Seventh Workshop on Algorithm Engineering
and Experiments and the Second Workshop on Analytic Algorithmics and
Combinatorics (ALENEX/ANALCO), pages 155-166. SIAM, 2005. [ bib ] [ .pdf ] [ Source and tests ] [ ALENEX Presentation (.pdf) ] |
Research reports
| [10] |
L. Frias and S. Roura.
Multikey Quickselect.
Technical report LSI-09-27-R, Universitat Politècnica de Catalunya,
Departament de Llenguatges i Sistemes Informàtics, 2009. [ bib ] [ http ] [ Sourceforge project ] |
| [11] |
L. Frias.
On the number of string lookups in BSTs (and related algorithms)
with digital access.
Technical report LSI-09-14-R, Universitat Politècnica de Catalunya,
Departament de Llenguatges i Sistemes Informàtics, 2009. [ bib ] [ http ] [ Sourceforge project ] |
| [12] |
L. Frias.
Algorithm Engineering: Efficient Data Structure Libraries.
Technical report 25/2007, Matematisches Forschungsinstitut
Oberwolfach, 2007. [ bib ] [ http ] |
| [13] |
L. Frias, A. Queralt, and A. Olivé.
EU-Rent Car Rentals Specification.
Technical report LSI-03-59-R, Universitat Politècnica de Catalunya,
Departament de Llenguatges i Sistemes Informàtics, 2003. [ bib] [ http ] [ .zip ] |