Main Published Research Results

• Jutge.org: Characteristics and experiences
  J. Petit, S. Roura, et al.
  IEEE Transactions on Learning Technologies, PP(99) (2017)

• Quad-kd trees: A general framework for kd trees and quad trees
  Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura
  Theoretical Computer Science 616: 126-140 (2016)

• Multikey Quickselect
  Leonor Frias, Salvador Roura
  Algorithmica 69(4): 958-973 (2014)

• Fibonacci BSTs: A new balancing method for binary search trees
  Salvador Roura
  Theoretical Computer Science 482: 48-59 (2013)

• Complete voting systems with two classes of voters: weightedness and counting
  Josep Freixas, Xavier Molinero, Salvador Roura
  Annals of Operations Research 193(1): 273-289 (2012)

• Lists revisited: Cache-conscious STL lists
  Leonor Frias, Jordi Petit, Salvador Roura
  ACM Journal of Experimental Algorithmics 14 (2009)

• Improved master theorems for divide-and-conquer recurrences
  Salvador Roura
  Journal of the ACM 48(2): 170-205 (2001)

• Digital Access to Comparison-Based Tree Data Structures and Algorithms
  Salvador Roura
  Journal of Algorithms 40(1): 1-23 (2001)

• Optimal Sampling Strategies in Quicksort and Quickselect
  Conrado Martínez, Salvador Roura
  SIAM Journal on Computing 31(3): 683-705 (2001)

• A New Method for Balancing Binary Search Trees
  Salvador Roura
  ICALP 2001: 469-480

• On the competitiveness of the move-to-front rule
  Conrado Martínez, Salvador Roura
  Theoretical Computer Science 242(1-2): 313-325 (2000)

• Randomized Binary Search Trees
  Conrado Martínez, Salvador Roura
  Journal of the ACM 45(2): 288-323 (1998)