Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Roura, Salvador"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multikey quickselect
Leonor Frias
,
Salvador Roura
Algorithmica
69
(4), 2014, pp. 958-973
Fibonacci BSTs: A new balancing method for binary search trees
Salvador Roura
Theoretical Computer Science
482
, 2013, pp. 48-59
Optimal sampling strategies in Quicksort and Quickselect
Conrado Martínez
,
Salvador Roura
SIAM Journal on Computing
31
(3), 2001-2002, pp. 683-705
Improved master theorems for divide-and-conquer recurrences
Salvador Roura
Journal of the ACM
48
(2), 2001, pp. 170-205
Digital access to comparison-based tree data structures and algorithms
Salvador Roura
Journal of Algorithms
40
(1), 2001, pp. 1-23
A new method for balancing binary search trees
Salvador Roura
Lecture Notes in Computer Science
2076
, 2001, pp. 469-480
On the competitiveness of the move-to-front rule
Conrado Martínez
,
Salvador Roura
Theoretical Computer Science
242
(1-2), 2000, pp. 313-325
Improving mergesort for linked lists
Salvador Roura
Lecture Notes in Computer Science
1643
, 1999, pp. 267-276
Optimal sampling strategies in Quicksort and Quickselect
Conrado Martínez
,
Salvador Roura
Technical Report (LSI-98-1-R), 1998, January
Optimal sampling strategies in Quicksort
Conrado Martínez
,
Salvador Roura
Lecture Notes in Computer Science
1443
, 1998, pp. 327-338
Randomized binary search trees
Conrado Martínez
,
Salvador Roura
Journal of the ACM
45
(2), 1998, pp. 288-323
Randomized binary search trees
Conrado Martínez
,
Salvador Roura
Technical Report (LSI-97-8-R), 1997, January
An improved master theorem for divide-and-conquer recurrences
Salvador Roura
Technical Report (LSI-97-7-R), 1997, January
An improved master theorem for divide-and-conquer recurrences
Salvador Roura
Lecture Notes in Computer Science
1256
, 1997, pp. 449-459
On the competitiveness of the Move-to-Front rule
Salvador Roura
,
Conrado Martínez
Technical Report (LSI-96-63-R), 1996
Randomization of search trees by subtree size
Salvador Roura
,
Conrado Martínez
Lecture Notes in Computer Science
1136
, 1996, pp. 91-106
Optimal and nearly optimal static weighted skip lists
Conrado Martínez
,
Salvador Roura
Technical Report (LSI-95-34-R), 1995