![]() | ![]() |
2007 | ||
---|---|---|
12 | EE | Josep Freixas, Xavier Molinero, Salvador Roura: Minimal Representations for Majority Games. CiE 2007: 297-306 |
2006 | ||
11 | EE | Leonor Frias, Jordi Petit, Salvador Roura: Lists Revisited: Cache Conscious STL Lists. WEA 2006: 121-133 |
2001 | ||
10 | EE | Salvador Roura: A New Method for Balancing Binary Search Trees. ICALP 2001: 469-480 |
9 | EE | Salvador Roura: Improved master theorems for divide-and-conquer recurrences. J. ACM 48(2): 170-205 (2001) |
8 | Salvador Roura: Digital Access to Comparison-Based Tree Data Structures and Algorithms. J. Algorithms 40(1): 1-23 (2001) | |
7 | EE | Conrado Martínez, Salvador Roura: Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput. 31(3): 683-705 (2001) |
2000 | ||
6 | EE | Conrado Martínez, Salvador Roura: On the competitiveness of the move-to-front rule. Theor. Comput. Sci. 242(1-2): 313-325 (2000) |
1999 | ||
5 | EE | Salvador Roura: Improving Mergesort for Linked Lists. ESA 1999: 267-276 |
1998 | ||
4 | EE | Conrado Martínez, Salvador Roura: Optimal Sampling Strategies in Quicksort. ICALP 1998: 327-338 |
3 | EE | Conrado Martínez, Salvador Roura: Randomized Binary Search Trees. J. ACM 45(2): 288-323 (1998) |
1997 | ||
2 | Salvador Roura: An Improved Master Theorem for Divide-and-Conquer Recurrences. ICALP 1997: 449-459 | |
1996 | ||
1 | Salvador Roura, Conrado Martínez: Randomization of Search Trees by Subtree Size. ESA 1996: 91-106 |
1 | Josep Freixas | [12] |
2 | Leonor Frias | [11] |
3 | Conrado Martínez (Conrado Martinez) | [1] [3] [4] [6] [7] |
4 | Xavier Molinero | [12] |
5 | Jordi Petit | [11] |